./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.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 bee6bfabfc9168d01d046a770b423c49a0035ad8b39e289385170f3b76ba2fb2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:01:36,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:01:36,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:01:36,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:01:36,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:01:36,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:01:36,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:01:36,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:01:36,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:01:36,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:01:36,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:01:36,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:01:36,225 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:01:36,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:01:36,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:01:36,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:01:36,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:01:36,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:01:36,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:01:36,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:01:36,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:01:36,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:01:36,226 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:01:36,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:01:36,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:01:36,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:01:36,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:01:36,228 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:01:36,228 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:01:36,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:01:36,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:01:36,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:01:36,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:01:36,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:01:36,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:01:36,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:01:36,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:01:36,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:01:36,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:01:36,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:01:36,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:01:36,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:01:36,229 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 -> bee6bfabfc9168d01d046a770b423c49a0035ad8b39e289385170f3b76ba2fb2 [2025-03-13 22:01:36,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:01:36,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:01:36,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:01:36,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:01:36,525 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:01:36,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i [2025-03-13 22:01:37,679 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca2a76c2/5b8db59b0aa54a38b9ecd7a6c56c6a83/FLAGb5808c88d [2025-03-13 22:01:37,961 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:01:37,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i [2025-03-13 22:01:37,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca2a76c2/5b8db59b0aa54a38b9ecd7a6c56c6a83/FLAGb5808c88d [2025-03-13 22:01:38,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca2a76c2/5b8db59b0aa54a38b9ecd7a6c56c6a83 [2025-03-13 22:01:38,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:01:38,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:01:38,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:01:38,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:01:38,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:01:38,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aaac7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38, skipping insertion in model container [2025-03-13 22:01:38,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:01:38,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:01:38,477 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:01:38,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:01:38,535 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:01:38,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38 WrapperNode [2025-03-13 22:01:38,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:01:38,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:01:38,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:01:38,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:01:38,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,568 INFO L138 Inliner]: procedures = 169, calls = 16, calls flagged for inlining = 6, calls inlined = 9, statements flattened = 175 [2025-03-13 22:01:38,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:01:38,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:01:38,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:01:38,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:01:38,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:01:38,588 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:01:38,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:01:38,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:01:38,589 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (1/1) ... [2025-03-13 22:01:38,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:01:38,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:01:38,618 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-13 22:01:38,620 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-13 22:01:38,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:01:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 22:01:38,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 22:01:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:01:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:01:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:01:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:01:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:01:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:01:38,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:01:38,638 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:01:38,723 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:01:38,724 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:01:38,848 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: havoc ~#l~0#1.base, ~#l~0#1.offset; [2025-03-13 22:01:38,848 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: SUMMARY for call ULTIMATE.dealloc(~#l~0#1.base, ~#l~0#1.offset); srcloc: null [2025-03-13 22:01:38,971 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: havoc thr1_~#l~0#1.base, thr1_~#l~0#1.offset; [2025-03-13 22:01:38,971 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: SUMMARY for call ULTIMATE.dealloc(thr1_~#l~0#1.base, thr1_~#l~0#1.offset); srcloc: null [2025-03-13 22:01:38,972 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:01:38,973 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:01:38,973 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:01:39,085 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:01:39,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:01:39 BoogieIcfgContainer [2025-03-13 22:01:39,087 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:01:39,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:01:39,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:01:39,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:01:39,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:01:38" (1/3) ... [2025-03-13 22:01:39,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b7576e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:01:39, skipping insertion in model container [2025-03-13 22:01:39,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:01:38" (2/3) ... [2025-03-13 22:01:39,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b7576e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:01:39, skipping insertion in model container [2025-03-13 22:01:39,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:01:39" (3/3) ... [2025-03-13 22:01:39,095 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-b.i [2025-03-13 22:01:39,107 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:01:39,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-b.i that has 2 procedures, 147 locations, 1 initial locations, 3 loop locations, and 24 error locations. [2025-03-13 22:01:39,108 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:01:39,157 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:39,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 156 transitions, 316 flow [2025-03-13 22:01:39,264 INFO L124 PetriNetUnfolderBase]: 14/237 cut-off events. [2025-03-13 22:01:39,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:39,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 237 events. 14/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 824 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 142. Up to 4 conditions per place. [2025-03-13 22:01:39,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 156 transitions, 316 flow [2025-03-13 22:01:39,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 156 transitions, 316 flow [2025-03-13 22:01:39,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:39,299 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;@60e26583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:39,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-03-13 22:01:39,305 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:39,305 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-03-13 22:01:39,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:39,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:39,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:39,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-13 22:01:39,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:39,310 INFO L85 PathProgramCache]: Analyzing trace with hash 66093569, now seen corresponding path program 1 times [2025-03-13 22:01:39,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:39,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129522014] [2025-03-13 22:01:39,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:39,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:01:39,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:01:39,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:39,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:39,435 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-13 22:01:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129522014] [2025-03-13 22:01:39,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129522014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:39,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:39,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:39,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879302045] [2025-03-13 22:01:39,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:39,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:01:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:39,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:01:39,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:01:39,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 156 [2025-03-13 22:01:39,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 156 transitions, 316 flow. Second operand has 2 states, 2 states have (on average 135.0) internal successors, (270), 2 states have internal predecessors, (270), 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-13 22:01:39,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:39,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 156 [2025-03-13 22:01:39,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:39,539 INFO L124 PetriNetUnfolderBase]: 5/255 cut-off events. [2025-03-13 22:01:39,540 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:01:39,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 255 events. 5/255 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 803 event pairs, 1 based on Foata normal form. 16/232 useless extension candidates. Maximal degree in co-relation 175. Up to 7 conditions per place. [2025-03-13 22:01:39,546 INFO L140 encePairwiseOnDemand]: 139/156 looper letters, 3 selfloop transitions, 0 changer transitions 0/135 dead transitions. [2025-03-13 22:01:39,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 280 flow [2025-03-13 22:01:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:01:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:01:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 288 transitions. [2025-03-13 22:01:39,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-03-13 22:01:39,560 INFO L175 Difference]: Start difference. First operand has 150 places, 156 transitions, 316 flow. Second operand 2 states and 288 transitions. [2025-03-13 22:01:39,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 280 flow [2025-03-13 22:01:39,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 135 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:39,567 INFO L231 Difference]: Finished difference. Result has 137 places, 135 transitions, 274 flow [2025-03-13 22:01:39,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=274, PETRI_PLACES=137, PETRI_TRANSITIONS=135} [2025-03-13 22:01:39,572 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -13 predicate places. [2025-03-13 22:01:39,572 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 135 transitions, 274 flow [2025-03-13 22:01:39,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.0) internal successors, (270), 2 states have internal predecessors, (270), 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-13 22:01:39,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:39,573 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:39,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:01:39,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-13 22:01:39,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash -772696544, now seen corresponding path program 1 times [2025-03-13 22:01:39,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:39,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574800173] [2025-03-13 22:01:39,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:39,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:39,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 22:01:39,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 22:01:39,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:39,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:39,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:01:39,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 22:01:39,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 22:01:39,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:39,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:39,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:01:39,619 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:01:39,621 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 37 remaining) [2025-03-13 22:01:39,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2025-03-13 22:01:39,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2025-03-13 22:01:39,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2025-03-13 22:01:39,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2025-03-13 22:01:39,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2025-03-13 22:01:39,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2025-03-13 22:01:39,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2025-03-13 22:01:39,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2025-03-13 22:01:39,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2025-03-13 22:01:39,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2025-03-13 22:01:39,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2025-03-13 22:01:39,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2025-03-13 22:01:39,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:01:39,625 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 22:01:39,627 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:01:39,627 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:01:39,678 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:39,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 218 transitions, 446 flow [2025-03-13 22:01:39,728 INFO L124 PetriNetUnfolderBase]: 23/380 cut-off events. [2025-03-13 22:01:39,728 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:01:39,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 380 events. 23/380 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1739 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 238. Up to 6 conditions per place. [2025-03-13 22:01:39,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 218 transitions, 446 flow [2025-03-13 22:01:39,771 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 218 transitions, 446 flow [2025-03-13 22:01:39,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:39,773 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;@60e26583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:39,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-03-13 22:01:39,777 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:39,777 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-03-13 22:01:39,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:39,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:39,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:39,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-13 22:01:39,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash -327715429, now seen corresponding path program 1 times [2025-03-13 22:01:39,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:39,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064443757] [2025-03-13 22:01:39,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:39,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:39,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:01:39,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:01:39,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:39,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:39,818 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-13 22:01:39,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:39,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064443757] [2025-03-13 22:01:39,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064443757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:39,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:39,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:39,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901045030] [2025-03-13 22:01:39,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:39,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:01:39,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:39,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:01:39,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:01:39,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 218 [2025-03-13 22:01:39,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 218 transitions, 446 flow. Second operand has 2 states, 2 states have (on average 186.0) internal successors, (372), 2 states have internal predecessors, (372), 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-13 22:01:39,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:39,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 218 [2025-03-13 22:01:39,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:39,919 INFO L124 PetriNetUnfolderBase]: 18/628 cut-off events. [2025-03-13 22:01:39,919 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 22:01:39,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 628 events. 18/628 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3596 event pairs, 7 based on Foata normal form. 46/567 useless extension candidates. Maximal degree in co-relation 385. Up to 21 conditions per place. [2025-03-13 22:01:39,927 INFO L140 encePairwiseOnDemand]: 193/218 looper letters, 5 selfloop transitions, 0 changer transitions 0/187 dead transitions. [2025-03-13 22:01:39,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 187 transitions, 394 flow [2025-03-13 22:01:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:01:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:01:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 400 transitions. [2025-03-13 22:01:39,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9174311926605505 [2025-03-13 22:01:39,930 INFO L175 Difference]: Start difference. First operand has 210 places, 218 transitions, 446 flow. Second operand 2 states and 400 transitions. [2025-03-13 22:01:39,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 187 transitions, 394 flow [2025-03-13 22:01:39,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 187 transitions, 394 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:39,934 INFO L231 Difference]: Finished difference. Result has 190 places, 187 transitions, 384 flow [2025-03-13 22:01:39,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=384, PETRI_PLACES=190, PETRI_TRANSITIONS=187} [2025-03-13 22:01:39,936 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -20 predicate places. [2025-03-13 22:01:39,936 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 187 transitions, 384 flow [2025-03-13 22:01:39,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 186.0) internal successors, (372), 2 states have internal predecessors, (372), 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-13 22:01:39,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:39,936 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] [2025-03-13 22:01:39,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:01:39,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-13 22:01:39,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1094041373, now seen corresponding path program 1 times [2025-03-13 22:01:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:39,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838448099] [2025-03-13 22:01:39,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:39,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:39,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 22:01:39,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 22:01:39,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:39,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:40,399 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-13 22:01:40,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:40,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838448099] [2025-03-13 22:01:40,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838448099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:40,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:40,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:01:40,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499193475] [2025-03-13 22:01:40,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:40,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:01:40,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:40,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:01:40,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:01:40,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 218 [2025-03-13 22:01:40,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 187 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 176.33333333333334) internal successors, (1058), 6 states have internal predecessors, (1058), 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-13 22:01:40,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:40,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 218 [2025-03-13 22:01:40,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:40,870 INFO L124 PetriNetUnfolderBase]: 134/2680 cut-off events. [2025-03-13 22:01:40,871 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 22:01:40,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 2680 events. 134/2680 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 24295 event pairs, 33 based on Foata normal form. 0/2214 useless extension candidates. Maximal degree in co-relation 2899. Up to 141 conditions per place. [2025-03-13 22:01:40,888 INFO L140 encePairwiseOnDemand]: 209/218 looper letters, 18 selfloop transitions, 14 changer transitions 0/204 dead transitions. [2025-03-13 22:01:40,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 204 transitions, 482 flow [2025-03-13 22:01:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:01:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:01:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1083 transitions. [2025-03-13 22:01:40,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8279816513761468 [2025-03-13 22:01:40,892 INFO L175 Difference]: Start difference. First operand has 190 places, 187 transitions, 384 flow. Second operand 6 states and 1083 transitions. [2025-03-13 22:01:40,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 204 transitions, 482 flow [2025-03-13 22:01:40,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 204 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:40,895 INFO L231 Difference]: Finished difference. Result has 200 places, 201 transitions, 486 flow [2025-03-13 22:01:40,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=200, PETRI_TRANSITIONS=201} [2025-03-13 22:01:40,896 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -10 predicate places. [2025-03-13 22:01:40,896 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 201 transitions, 486 flow [2025-03-13 22:01:40,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.33333333333334) internal successors, (1058), 6 states have internal predecessors, (1058), 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-13 22:01:40,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:40,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:40,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:01:40,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-13 22:01:40,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:40,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1663252078, now seen corresponding path program 1 times [2025-03-13 22:01:40,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:40,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854188359] [2025-03-13 22:01:40,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:40,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:40,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:01:40,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:01:40,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:40,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:41,148 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-13 22:01:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:41,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854188359] [2025-03-13 22:01:41,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854188359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:41,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:41,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:01:41,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256266713] [2025-03-13 22:01:41,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:41,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:01:41,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:41,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:01:41,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:01:41,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 218 [2025-03-13 22:01:41,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 201 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 178.33333333333334) internal successors, (1070), 6 states have internal predecessors, (1070), 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-13 22:01:41,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:41,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 218 [2025-03-13 22:01:41,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:41,839 INFO L124 PetriNetUnfolderBase]: 424/5479 cut-off events. [2025-03-13 22:01:41,839 INFO L125 PetriNetUnfolderBase]: For 593/629 co-relation queries the response was YES. [2025-03-13 22:01:41,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6940 conditions, 5479 events. 424/5479 cut-off events. For 593/629 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 59227 event pairs, 36 based on Foata normal form. 0/4584 useless extension candidates. Maximal degree in co-relation 6930. Up to 366 conditions per place. [2025-03-13 22:01:41,880 INFO L140 encePairwiseOnDemand]: 209/218 looper letters, 28 selfloop transitions, 30 changer transitions 0/238 dead transitions. [2025-03-13 22:01:41,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 238 transitions, 768 flow [2025-03-13 22:01:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:01:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:01:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1097 transitions. [2025-03-13 22:01:41,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8386850152905199 [2025-03-13 22:01:41,884 INFO L175 Difference]: Start difference. First operand has 200 places, 201 transitions, 486 flow. Second operand 6 states and 1097 transitions. [2025-03-13 22:01:41,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 238 transitions, 768 flow [2025-03-13 22:01:41,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 238 transitions, 768 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:41,892 INFO L231 Difference]: Finished difference. Result has 210 places, 231 transitions, 764 flow [2025-03-13 22:01:41,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=764, PETRI_PLACES=210, PETRI_TRANSITIONS=231} [2025-03-13 22:01:41,893 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 0 predicate places. [2025-03-13 22:01:41,893 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 231 transitions, 764 flow [2025-03-13 22:01:41,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.33333333333334) internal successors, (1070), 6 states have internal predecessors, (1070), 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-13 22:01:41,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:41,894 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] [2025-03-13 22:01:41,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:01:41,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-13 22:01:41,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:41,894 INFO L85 PathProgramCache]: Analyzing trace with hash 893248419, now seen corresponding path program 1 times [2025-03-13 22:01:41,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:41,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844846571] [2025-03-13 22:01:41,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:41,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:41,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:01:41,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:01:41,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:41,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:41,925 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-13 22:01:41,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:41,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844846571] [2025-03-13 22:01:41,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844846571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:41,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:41,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:41,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125308746] [2025-03-13 22:01:41,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:41,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:01:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:41,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:01:41,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:01:41,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 218 [2025-03-13 22:01:41,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 231 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-13 22:01:41,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:41,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 218 [2025-03-13 22:01:41,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:44,690 INFO L124 PetriNetUnfolderBase]: 4584/30499 cut-off events. [2025-03-13 22:01:44,690 INFO L125 PetriNetUnfolderBase]: For 5609/5768 co-relation queries the response was YES. [2025-03-13 22:01:44,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43317 conditions, 30499 events. 4584/30499 cut-off events. For 5609/5768 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 437059 event pairs, 1493 based on Foata normal form. 3/26115 useless extension candidates. Maximal degree in co-relation 43302. Up to 5433 conditions per place. [2025-03-13 22:01:44,939 INFO L140 encePairwiseOnDemand]: 197/218 looper letters, 94 selfloop transitions, 15 changer transitions 0/282 dead transitions. [2025-03-13 22:01:44,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 282 transitions, 1305 flow [2025-03-13 22:01:44,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:01:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:01:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2025-03-13 22:01:44,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8302752293577982 [2025-03-13 22:01:44,941 INFO L175 Difference]: Start difference. First operand has 210 places, 231 transitions, 764 flow. Second operand 3 states and 543 transitions. [2025-03-13 22:01:44,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 282 transitions, 1305 flow [2025-03-13 22:01:44,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 282 transitions, 1305 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:44,960 INFO L231 Difference]: Finished difference. Result has 214 places, 246 transitions, 896 flow [2025-03-13 22:01:44,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=214, PETRI_TRANSITIONS=246} [2025-03-13 22:01:44,962 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 4 predicate places. [2025-03-13 22:01:44,962 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 246 transitions, 896 flow [2025-03-13 22:01:44,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-13 22:01:44,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:44,962 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:44,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:01:44,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-13 22:01:44,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash 21071113, now seen corresponding path program 1 times [2025-03-13 22:01:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125348688] [2025-03-13 22:01:44,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:44,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:01:44,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:01:44,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:44,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:44,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:01:44,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:01:44,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:01:44,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:44,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:01:44,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:01:44,983 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:01:44,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 49 remaining) [2025-03-13 22:01:44,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2025-03-13 22:01:44,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2025-03-13 22:01:44,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2025-03-13 22:01:44,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2025-03-13 22:01:44,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2025-03-13 22:01:44,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2025-03-13 22:01:44,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2025-03-13 22:01:44,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2025-03-13 22:01:44,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2025-03-13 22:01:44,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2025-03-13 22:01:44,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2025-03-13 22:01:44,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2025-03-13 22:01:44,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2025-03-13 22:01:44,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2025-03-13 22:01:44,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2025-03-13 22:01:44,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2025-03-13 22:01:44,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (19 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (18 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (17 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (16 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2025-03-13 22:01:44,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2025-03-13 22:01:44,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2025-03-13 22:01:44,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2025-03-13 22:01:44,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2025-03-13 22:01:44,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2025-03-13 22:01:44,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2025-03-13 22:01:44,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2025-03-13 22:01:44,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2025-03-13 22:01:44,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2025-03-13 22:01:44,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:01:44,987 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-13 22:01:44,988 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:01:44,988 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:01:45,032 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:01:45,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 280 transitions, 578 flow [2025-03-13 22:01:45,189 INFO L124 PetriNetUnfolderBase]: 32/523 cut-off events. [2025-03-13 22:01:45,189 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:01:45,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 523 events. 32/523 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2698 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 384. Up to 8 conditions per place. [2025-03-13 22:01:45,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 280 transitions, 578 flow [2025-03-13 22:01:45,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 280 transitions, 578 flow [2025-03-13 22:01:45,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:01:45,200 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;@60e26583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:01:45,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-13 22:01:45,202 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:01:45,202 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-03-13 22:01:45,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:01:45,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:45,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:45,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 22:01:45,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:45,203 INFO L85 PathProgramCache]: Analyzing trace with hash 151559091, now seen corresponding path program 1 times [2025-03-13 22:01:45,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:45,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041966064] [2025-03-13 22:01:45,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:45,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:45,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:01:45,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:01:45,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:45,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:45,217 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-13 22:01:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:45,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041966064] [2025-03-13 22:01:45,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041966064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:45,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:45,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611183672] [2025-03-13 22:01:45,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:45,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:01:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:45,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:01:45,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:01:45,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-03-13 22:01:45,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 280 transitions, 578 flow. Second operand has 2 states, 2 states have (on average 237.0) internal successors, (474), 2 states have internal predecessors, (474), 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-13 22:01:45,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:45,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-03-13 22:01:45,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:45,338 INFO L124 PetriNetUnfolderBase]: 53/1407 cut-off events. [2025-03-13 22:01:45,339 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-13 22:01:45,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 1407 events. 53/1407 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11183 event pairs, 27 based on Foata normal form. 116/1271 useless extension candidates. Maximal degree in co-relation 811. Up to 57 conditions per place. [2025-03-13 22:01:45,354 INFO L140 encePairwiseOnDemand]: 247/280 looper letters, 7 selfloop transitions, 0 changer transitions 0/239 dead transitions. [2025-03-13 22:01:45,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 239 transitions, 510 flow [2025-03-13 22:01:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:01:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:01:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 512 transitions. [2025-03-13 22:01:45,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9142857142857143 [2025-03-13 22:01:45,356 INFO L175 Difference]: Start difference. First operand has 270 places, 280 transitions, 578 flow. Second operand 2 states and 512 transitions. [2025-03-13 22:01:45,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 239 transitions, 510 flow [2025-03-13 22:01:45,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 239 transitions, 508 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:45,359 INFO L231 Difference]: Finished difference. Result has 243 places, 239 transitions, 494 flow [2025-03-13 22:01:45,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=494, PETRI_PLACES=243, PETRI_TRANSITIONS=239} [2025-03-13 22:01:45,360 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -27 predicate places. [2025-03-13 22:01:45,360 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 239 transitions, 494 flow [2025-03-13 22:01:45,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 237.0) internal successors, (474), 2 states have internal predecessors, (474), 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-13 22:01:45,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:45,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:45,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:01:45,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 22:01:45,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1783371037, now seen corresponding path program 1 times [2025-03-13 22:01:45,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:45,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927368488] [2025-03-13 22:01:45,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:45,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:45,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 22:01:45,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 22:01:45,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:45,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:45,536 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-13 22:01:45,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:45,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927368488] [2025-03-13 22:01:45,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927368488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:45,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:45,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:01:45,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863807950] [2025-03-13 22:01:45,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:45,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:01:45,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:45,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:01:45,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:01:45,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 280 [2025-03-13 22:01:45,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 239 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 227.33333333333334) internal successors, (1364), 6 states have internal predecessors, (1364), 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-13 22:01:45,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:45,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 280 [2025-03-13 22:01:45,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:46,346 INFO L124 PetriNetUnfolderBase]: 444/7105 cut-off events. [2025-03-13 22:01:46,346 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-13 22:01:46,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7729 conditions, 7105 events. 444/7105 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 81827 event pairs, 131 based on Foata normal form. 0/5860 useless extension candidates. Maximal degree in co-relation 7723. Up to 442 conditions per place. [2025-03-13 22:01:46,468 INFO L140 encePairwiseOnDemand]: 270/280 looper letters, 20 selfloop transitions, 18 changer transitions 0/260 dead transitions. [2025-03-13 22:01:46,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 260 transitions, 612 flow [2025-03-13 22:01:46,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:01:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:01:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1395 transitions. [2025-03-13 22:01:46,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8303571428571429 [2025-03-13 22:01:46,471 INFO L175 Difference]: Start difference. First operand has 243 places, 239 transitions, 494 flow. Second operand 6 states and 1395 transitions. [2025-03-13 22:01:46,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 260 transitions, 612 flow [2025-03-13 22:01:46,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 260 transitions, 612 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:46,474 INFO L231 Difference]: Finished difference. Result has 253 places, 257 transitions, 622 flow [2025-03-13 22:01:46,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=253, PETRI_TRANSITIONS=257} [2025-03-13 22:01:46,475 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -17 predicate places. [2025-03-13 22:01:46,475 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 257 transitions, 622 flow [2025-03-13 22:01:46,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 227.33333333333334) internal successors, (1364), 6 states have internal predecessors, (1364), 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-13 22:01:46,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:46,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:01:46,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:01:46,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 22:01:46,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash -660056819, now seen corresponding path program 1 times [2025-03-13 22:01:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:46,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310737884] [2025-03-13 22:01:46,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:46,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:46,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:01:46,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:01:46,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:46,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:46,680 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-13 22:01:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310737884] [2025-03-13 22:01:46,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310737884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:46,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:46,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:01:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465851510] [2025-03-13 22:01:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:46,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:01:46,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:46,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:01:46,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:01:46,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 280 [2025-03-13 22:01:46,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 257 transitions, 622 flow. Second operand has 6 states, 6 states have (on average 229.33333333333334) internal successors, (1376), 6 states have internal predecessors, (1376), 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-13 22:01:46,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:46,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 280 [2025-03-13 22:01:46,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:01:49,004 INFO L124 PetriNetUnfolderBase]: 1843/18400 cut-off events. [2025-03-13 22:01:49,005 INFO L125 PetriNetUnfolderBase]: For 2485/2593 co-relation queries the response was YES. [2025-03-13 22:01:49,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23689 conditions, 18400 events. 1843/18400 cut-off events. For 2485/2593 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 250027 event pairs, 169 based on Foata normal form. 0/15321 useless extension candidates. Maximal degree in co-relation 23678. Up to 1595 conditions per place. [2025-03-13 22:01:49,205 INFO L140 encePairwiseOnDemand]: 270/280 looper letters, 38 selfloop transitions, 50 changer transitions 0/318 dead transitions. [2025-03-13 22:01:49,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 318 transitions, 1104 flow [2025-03-13 22:01:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:01:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:01:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1413 transitions. [2025-03-13 22:01:49,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8410714285714286 [2025-03-13 22:01:49,208 INFO L175 Difference]: Start difference. First operand has 253 places, 257 transitions, 622 flow. Second operand 6 states and 1413 transitions. [2025-03-13 22:01:49,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 318 transitions, 1104 flow [2025-03-13 22:01:49,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 318 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:01:49,216 INFO L231 Difference]: Finished difference. Result has 263 places, 307 transitions, 1102 flow [2025-03-13 22:01:49,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1102, PETRI_PLACES=263, PETRI_TRANSITIONS=307} [2025-03-13 22:01:49,217 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -7 predicate places. [2025-03-13 22:01:49,217 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 307 transitions, 1102 flow [2025-03-13 22:01:49,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.33333333333334) internal successors, (1376), 6 states have internal predecessors, (1376), 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-13 22:01:49,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:01:49,218 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] [2025-03-13 22:01:49,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:01:49,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 22:01:49,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:01:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash -127586141, now seen corresponding path program 1 times [2025-03-13 22:01:49,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:01:49,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837620788] [2025-03-13 22:01:49,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:01:49,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:01:49,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:01:49,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:01:49,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:01:49,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:01:49,241 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-13 22:01:49,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:01:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837620788] [2025-03-13 22:01:49,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837620788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:01:49,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:01:49,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:01:49,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245238702] [2025-03-13 22:01:49,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:01:49,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:01:49,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:01:49,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:01:49,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:01:49,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 280 [2025-03-13 22:01:49,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 307 transitions, 1102 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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-13 22:01:49,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:01:49,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 280 [2025-03-13 22:01:49,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:02:23,474 INFO L124 PetriNetUnfolderBase]: 74421/327896 cut-off events. [2025-03-13 22:02:23,474 INFO L125 PetriNetUnfolderBase]: For 102182/105108 co-relation queries the response was YES. [2025-03-13 22:02:26,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498756 conditions, 327896 events. 74421/327896 cut-off events. For 102182/105108 co-relation queries the response was YES. Maximal size of possible extension queue 6881. Compared 5989884 event pairs, 25975 based on Foata normal form. 17/277103 useless extension candidates. Maximal degree in co-relation 498740. Up to 75459 conditions per place. [2025-03-13 22:02:28,328 INFO L140 encePairwiseOnDemand]: 252/280 looper letters, 153 selfloop transitions, 20 changer transitions 0/389 dead transitions. [2025-03-13 22:02:28,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 389 transitions, 2018 flow [2025-03-13 22:02:28,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:02:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:02:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2025-03-13 22:02:28,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.825 [2025-03-13 22:02:28,330 INFO L175 Difference]: Start difference. First operand has 263 places, 307 transitions, 1102 flow. Second operand 3 states and 693 transitions. [2025-03-13 22:02:28,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 389 transitions, 2018 flow [2025-03-13 22:02:28,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 389 transitions, 2018 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:02:28,463 INFO L231 Difference]: Finished difference. Result has 267 places, 327 transitions, 1278 flow [2025-03-13 22:02:28,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1278, PETRI_PLACES=267, PETRI_TRANSITIONS=327} [2025-03-13 22:02:28,465 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -3 predicate places. [2025-03-13 22:02:28,465 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 327 transitions, 1278 flow [2025-03-13 22:02:28,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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-13 22:02:28,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:02:28,465 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] [2025-03-13 22:02:28,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:02:28,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 22:02:28,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:02:28,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1187355539, now seen corresponding path program 1 times [2025-03-13 22:02:28,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:02:28,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817264143] [2025-03-13 22:02:28,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:02:28,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:02:28,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:02:28,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:02:28,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:02:28,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:02:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:02:28,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:02:28,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817264143] [2025-03-13 22:02:28,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817264143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:02:28,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:02:28,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:02:28,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258231967] [2025-03-13 22:02:28,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:02:28,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:02:28,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:02:28,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:02:28,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:02:28,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 280 [2025-03-13 22:02:28,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 327 transitions, 1278 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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-13 22:02:28,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:02:28,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 280 [2025-03-13 22:02:28,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand