./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:33:44,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:33:44,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:33:44,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:33:44,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:33:44,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:33:44,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:33:44,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:33:44,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:33:44,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:33:44,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:33:44,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:33:44,170 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:33:44,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:33:44,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:33:44,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:33:44,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:33:44,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:33:44,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:33:44,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:33:44,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:33:44,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:33:44,171 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:33:44,171 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:33:44,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:33:44,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:33:44,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:33:44,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:33:44,172 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:33:44,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:33:44,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:33:44,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:33:44,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:33:44,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:33:44,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:33:44,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:33:44,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:33:44,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:33:44,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:33:44,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:33:44,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:33:44,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:33:44,173 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2025-02-08 05:33:44,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:33:44,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:33:44,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:33:44,382 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:33:44,382 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:33:44,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-02-08 05:33:45,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56663c1d4/a7f6fa0c896c4c3b9e97f200dfaf372b/FLAGaf90f4861 [2025-02-08 05:33:45,907 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:33:45,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-02-08 05:33:45,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56663c1d4/a7f6fa0c896c4c3b9e97f200dfaf372b/FLAGaf90f4861 [2025-02-08 05:33:45,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56663c1d4/a7f6fa0c896c4c3b9e97f200dfaf372b [2025-02-08 05:33:45,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:33:45,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:33:45,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:33:45,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:33:45,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:33:45,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:33:45" (1/1) ... [2025-02-08 05:33:45,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c095b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:45, skipping insertion in model container [2025-02-08 05:33:45,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:33:45" (1/1) ... [2025-02-08 05:33:45,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:33:46,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:33:46,207 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:33:46,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:33:46,290 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:33:46,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46 WrapperNode [2025-02-08 05:33:46,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:33:46,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:33:46,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:33:46,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:33:46,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (1/1) ... [2025-02-08 05:33:46,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (1/1) ... [2025-02-08 05:33:46,330 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2025-02-08 05:33:46,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:33:46,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:33:46,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:33:46,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:33:46,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (1/1) ... [2025-02-08 05:33:46,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (1/1) ... [2025-02-08 05:33:46,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (1/1) ... [2025-02-08 05:33:46,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (1/1) ... [2025-02-08 05:33:46,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (1/1) ... [2025-02-08 05:33:46,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (1/1) ... [2025-02-08 05:33:46,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (1/1) ... [2025-02-08 05:33:46,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (1/1) ... [2025-02-08 05:33:46,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:33:46,367 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:33:46,367 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:33:46,367 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:33:46,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (1/1) ... [2025-02-08 05:33:46,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:33:46,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:33:46,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:33:46,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:33:46,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:33:46,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:33:46,431 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:33:46,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:33:46,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:33:46,431 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:33:46,431 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:33:46,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:33:46,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:33:46,431 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:33:46,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:33:46,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:33:46,432 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:33:46,509 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:33:46,510 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:33:46,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 05:33:46,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 05:33:46,715 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:33:46,715 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:33:46,744 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:33:46,744 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:33:46,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:33:46 BoogieIcfgContainer [2025-02-08 05:33:46,744 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:33:46,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:33:46,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:33:46,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:33:46,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:33:45" (1/3) ... [2025-02-08 05:33:46,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56df645a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:33:46, skipping insertion in model container [2025-02-08 05:33:46,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:46" (2/3) ... [2025-02-08 05:33:46,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56df645a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:33:46, skipping insertion in model container [2025-02-08 05:33:46,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:33:46" (3/3) ... [2025-02-08 05:33:46,752 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2025-02-08 05:33:46,762 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:33:46,765 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_02-simple_racefree.i that has 2 procedures, 187 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-02-08 05:33:46,766 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:33:46,824 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:33:46,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 198 transitions, 403 flow [2025-02-08 05:33:46,924 INFO L124 PetriNetUnfolderBase]: 15/256 cut-off events. [2025-02-08 05:33:46,926 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:33:46,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 256 events. 15/256 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 653 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 140. Up to 4 conditions per place. [2025-02-08 05:33:46,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 198 transitions, 403 flow [2025-02-08 05:33:46,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 198 transitions, 403 flow [2025-02-08 05:33:46,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:33:46,954 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;@267ff69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:33:46,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 05:33:46,975 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:33:46,976 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-08 05:33:46,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:33:46,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:46,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:46,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:46,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1207619626, now seen corresponding path program 1 times [2025-02-08 05:33:46,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:46,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316357581] [2025-02-08 05:33:46,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:46,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:47,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:33:47,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:33:47,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:47,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:47,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:47,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316357581] [2025-02-08 05:33:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316357581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:47,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:47,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:33:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85720442] [2025-02-08 05:33:47,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:47,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:47,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:47,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:47,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:47,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 198 [2025-02-08 05:33:47,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 198 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:47,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:47,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 198 [2025-02-08 05:33:47,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:47,532 INFO L124 PetriNetUnfolderBase]: 48/560 cut-off events. [2025-02-08 05:33:47,532 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:33:47,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 560 events. 48/560 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2359 event pairs, 28 based on Foata normal form. 81/589 useless extension candidates. Maximal degree in co-relation 553. Up to 108 conditions per place. [2025-02-08 05:33:47,535 INFO L140 encePairwiseOnDemand]: 185/198 looper letters, 22 selfloop transitions, 2 changer transitions 0/192 dead transitions. [2025-02-08 05:33:47,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 192 transitions, 439 flow [2025-02-08 05:33:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2025-02-08 05:33:47,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2025-02-08 05:33:47,545 INFO L175 Difference]: Start difference. First operand has 190 places, 198 transitions, 403 flow. Second operand 3 states and 548 transitions. [2025-02-08 05:33:47,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 192 transitions, 439 flow [2025-02-08 05:33:47,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 192 transitions, 439 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:47,551 INFO L231 Difference]: Finished difference. Result has 191 places, 186 transitions, 387 flow [2025-02-08 05:33:47,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=191, PETRI_TRANSITIONS=186} [2025-02-08 05:33:47,559 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places. [2025-02-08 05:33:47,559 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 186 transitions, 387 flow [2025-02-08 05:33:47,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:47,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:47,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:47,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:33:47,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:47,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:47,561 INFO L85 PathProgramCache]: Analyzing trace with hash 786881005, now seen corresponding path program 1 times [2025-02-08 05:33:47,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:47,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511648000] [2025-02-08 05:33:47,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:47,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:47,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:33:47,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:33:47,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:47,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:48,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:48,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511648000] [2025-02-08 05:33:48,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511648000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:48,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:48,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:48,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715704122] [2025-02-08 05:33:48,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:48,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:48,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:48,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:48,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 198 [2025-02-08 05:33:48,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 186 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 158.5) internal successors, (951), 6 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:48,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:48,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 198 [2025-02-08 05:33:48,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:48,426 INFO L124 PetriNetUnfolderBase]: 108/802 cut-off events. [2025-02-08 05:33:48,428 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:33:48,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 802 events. 108/802 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4383 event pairs, 43 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 940. Up to 181 conditions per place. [2025-02-08 05:33:48,435 INFO L140 encePairwiseOnDemand]: 192/198 looper letters, 48 selfloop transitions, 5 changer transitions 0/209 dead transitions. [2025-02-08 05:33:48,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 209 transitions, 539 flow [2025-02-08 05:33:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 996 transitions. [2025-02-08 05:33:48,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8383838383838383 [2025-02-08 05:33:48,440 INFO L175 Difference]: Start difference. First operand has 191 places, 186 transitions, 387 flow. Second operand 6 states and 996 transitions. [2025-02-08 05:33:48,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 209 transitions, 539 flow [2025-02-08 05:33:48,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 209 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:48,445 INFO L231 Difference]: Finished difference. Result has 193 places, 185 transitions, 391 flow [2025-02-08 05:33:48,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=193, PETRI_TRANSITIONS=185} [2025-02-08 05:33:48,447 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 3 predicate places. [2025-02-08 05:33:48,447 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 185 transitions, 391 flow [2025-02-08 05:33:48,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.5) internal successors, (951), 6 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:48,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:48,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:48,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:33:48,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:48,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1336643323, now seen corresponding path program 1 times [2025-02-08 05:33:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:48,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281748209] [2025-02-08 05:33:48,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:48,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:48,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:33:48,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:33:48,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:48,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:48,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:48,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281748209] [2025-02-08 05:33:48,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281748209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:48,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:48,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:48,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632507416] [2025-02-08 05:33:48,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:48,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:48,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:48,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:48,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 198 [2025-02-08 05:33:48,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 185 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:48,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:48,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 198 [2025-02-08 05:33:48,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:48,636 INFO L124 PetriNetUnfolderBase]: 91/856 cut-off events. [2025-02-08 05:33:48,636 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:33:48,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 856 events. 91/856 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4758 event pairs, 30 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 973. Up to 125 conditions per place. [2025-02-08 05:33:48,639 INFO L140 encePairwiseOnDemand]: 189/198 looper letters, 30 selfloop transitions, 6 changer transitions 0/198 dead transitions. [2025-02-08 05:33:48,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 198 transitions, 492 flow [2025-02-08 05:33:48,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2025-02-08 05:33:48,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8939393939393939 [2025-02-08 05:33:48,641 INFO L175 Difference]: Start difference. First operand has 193 places, 185 transitions, 391 flow. Second operand 3 states and 531 transitions. [2025-02-08 05:33:48,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 198 transitions, 492 flow [2025-02-08 05:33:48,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 198 transitions, 482 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:33:48,644 INFO L231 Difference]: Finished difference. Result has 190 places, 187 transitions, 419 flow [2025-02-08 05:33:48,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=190, PETRI_TRANSITIONS=187} [2025-02-08 05:33:48,645 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 0 predicate places. [2025-02-08 05:33:48,645 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 187 transitions, 419 flow [2025-02-08 05:33:48,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:48,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:48,646 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:48,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:33:48,646 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:48,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:48,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1303222452, now seen corresponding path program 1 times [2025-02-08 05:33:48,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:48,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481992766] [2025-02-08 05:33:48,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:48,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:33:48,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:33:48,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:48,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:33:48,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:33:48,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:33:48,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:33:48,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:48,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:33:48,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:33:48,716 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:33:48,716 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-02-08 05:33:48,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-02-08 05:33:48,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-02-08 05:33:48,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-02-08 05:33:48,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-02-08 05:33:48,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-02-08 05:33:48,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-02-08 05:33:48,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-02-08 05:33:48,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-02-08 05:33:48,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-02-08 05:33:48,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-02-08 05:33:48,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-02-08 05:33:48,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:33:48,719 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:33:48,721 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:33:48,721 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:33:48,750 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:33:48,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 249 transitions, 514 flow [2025-02-08 05:33:48,787 INFO L124 PetriNetUnfolderBase]: 27/392 cut-off events. [2025-02-08 05:33:48,787 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:33:48,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 392 events. 27/392 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1226 event pairs, 0 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 258. Up to 6 conditions per place. [2025-02-08 05:33:48,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 249 transitions, 514 flow [2025-02-08 05:33:48,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 236 places, 249 transitions, 514 flow [2025-02-08 05:33:48,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:33:48,795 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;@267ff69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:33:48,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 05:33:48,800 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:33:48,800 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-08 05:33:48,800 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:33:48,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:48,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:48,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:48,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2110077999, now seen corresponding path program 1 times [2025-02-08 05:33:48,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:48,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126158349] [2025-02-08 05:33:48,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:48,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:33:48,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:33:48,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:48,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:48,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:48,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126158349] [2025-02-08 05:33:48,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126158349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:48,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:48,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:33:48,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356043322] [2025-02-08 05:33:48,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:48,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:48,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:48,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:48,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:48,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 249 [2025-02-08 05:33:48,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 249 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:48,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:48,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 249 [2025-02-08 05:33:48,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:49,397 INFO L124 PetriNetUnfolderBase]: 788/4501 cut-off events. [2025-02-08 05:33:49,397 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-08 05:33:49,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5854 conditions, 4501 events. 788/4501 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 42738 event pairs, 348 based on Foata normal form. 1025/5140 useless extension candidates. Maximal degree in co-relation 744. Up to 1303 conditions per place. [2025-02-08 05:33:49,417 INFO L140 encePairwiseOnDemand]: 230/249 looper letters, 31 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2025-02-08 05:33:49,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 238 transitions, 558 flow [2025-02-08 05:33:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2025-02-08 05:33:49,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022757697456493 [2025-02-08 05:33:49,419 INFO L175 Difference]: Start difference. First operand has 236 places, 249 transitions, 514 flow. Second operand 3 states and 674 transitions. [2025-02-08 05:33:49,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 238 transitions, 558 flow [2025-02-08 05:33:49,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 238 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:49,422 INFO L231 Difference]: Finished difference. Result has 237 places, 232 transitions, 490 flow [2025-02-08 05:33:49,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=237, PETRI_TRANSITIONS=232} [2025-02-08 05:33:49,423 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, 1 predicate places. [2025-02-08 05:33:49,423 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 232 transitions, 490 flow [2025-02-08 05:33:49,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:49,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:49,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:49,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:33:49,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:49,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:49,425 INFO L85 PathProgramCache]: Analyzing trace with hash 556292525, now seen corresponding path program 1 times [2025-02-08 05:33:49,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:49,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029174218] [2025-02-08 05:33:49,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:49,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:49,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:33:49,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:33:49,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:49,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:49,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:49,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029174218] [2025-02-08 05:33:49,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029174218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:49,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:49,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:49,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543788941] [2025-02-08 05:33:49,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:49,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:49,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:49,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:49,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:49,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 249 [2025-02-08 05:33:49,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 232 transitions, 490 flow. Second operand has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:49,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:49,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 249 [2025-02-08 05:33:49,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:50,453 INFO L124 PetriNetUnfolderBase]: 1718/5902 cut-off events. [2025-02-08 05:33:50,454 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-02-08 05:33:50,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8914 conditions, 5902 events. 1718/5902 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 55876 event pairs, 222 based on Foata normal form. 0/5475 useless extension candidates. Maximal degree in co-relation 8129. Up to 2015 conditions per place. [2025-02-08 05:33:50,488 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 80 selfloop transitions, 6 changer transitions 0/279 dead transitions. [2025-02-08 05:33:50,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 279 transitions, 756 flow [2025-02-08 05:33:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1250 transitions. [2025-02-08 05:33:50,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8366800535475234 [2025-02-08 05:33:50,492 INFO L175 Difference]: Start difference. First operand has 237 places, 232 transitions, 490 flow. Second operand 6 states and 1250 transitions. [2025-02-08 05:33:50,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 279 transitions, 756 flow [2025-02-08 05:33:50,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 279 transitions, 754 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:33:50,496 INFO L231 Difference]: Finished difference. Result has 240 places, 231 transitions, 498 flow [2025-02-08 05:33:50,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=240, PETRI_TRANSITIONS=231} [2025-02-08 05:33:50,497 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, 4 predicate places. [2025-02-08 05:33:50,497 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 231 transitions, 498 flow [2025-02-08 05:33:50,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:50,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:50,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:50,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:33:50,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:50,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1855697748, now seen corresponding path program 1 times [2025-02-08 05:33:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:50,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579686643] [2025-02-08 05:33:50,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:50,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:33:50,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:33:50,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:50,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:50,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:50,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579686643] [2025-02-08 05:33:50,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579686643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:50,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:50,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:50,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084432833] [2025-02-08 05:33:50,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:50,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:50,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:50,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:50,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:50,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 249 [2025-02-08 05:33:50,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 231 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:50,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:50,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 249 [2025-02-08 05:33:50,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:51,812 INFO L124 PetriNetUnfolderBase]: 3895/14780 cut-off events. [2025-02-08 05:33:51,813 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-02-08 05:33:51,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21338 conditions, 14780 events. 3895/14780 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 165382 event pairs, 1409 based on Foata normal form. 0/13248 useless extension candidates. Maximal degree in co-relation 14719. Up to 3516 conditions per place. [2025-02-08 05:33:51,875 INFO L140 encePairwiseOnDemand]: 230/249 looper letters, 58 selfloop transitions, 14 changer transitions 0/264 dead transitions. [2025-02-08 05:33:51,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 264 transitions, 719 flow [2025-02-08 05:33:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2025-02-08 05:33:51,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781793842034806 [2025-02-08 05:33:51,877 INFO L175 Difference]: Start difference. First operand has 240 places, 231 transitions, 498 flow. Second operand 3 states and 656 transitions. [2025-02-08 05:33:51,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 264 transitions, 719 flow [2025-02-08 05:33:51,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 264 transitions, 707 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:33:51,883 INFO L231 Difference]: Finished difference. Result has 239 places, 245 transitions, 608 flow [2025-02-08 05:33:51,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=239, PETRI_TRANSITIONS=245} [2025-02-08 05:33:51,884 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, 3 predicate places. [2025-02-08 05:33:51,884 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 245 transitions, 608 flow [2025-02-08 05:33:51,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:51,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:51,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:51,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:33:51,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:51,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1548485929, now seen corresponding path program 1 times [2025-02-08 05:33:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:51,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114750807] [2025-02-08 05:33:51,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:51,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:33:51,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:33:51,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:51,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:51,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:51,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114750807] [2025-02-08 05:33:51,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114750807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:51,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:51,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:51,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951635950] [2025-02-08 05:33:51,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:51,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:51,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:51,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:51,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:52,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 249 [2025-02-08 05:33:52,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 245 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:52,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:52,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 249 [2025-02-08 05:33:52,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:53,607 INFO L124 PetriNetUnfolderBase]: 4045/16817 cut-off events. [2025-02-08 05:33:53,607 INFO L125 PetriNetUnfolderBase]: For 4383/4566 co-relation queries the response was YES. [2025-02-08 05:33:53,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27572 conditions, 16817 events. 4045/16817 cut-off events. For 4383/4566 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 198254 event pairs, 2517 based on Foata normal form. 46/15315 useless extension candidates. Maximal degree in co-relation 26225. Up to 5540 conditions per place. [2025-02-08 05:33:53,677 INFO L140 encePairwiseOnDemand]: 240/249 looper letters, 52 selfloop transitions, 14 changer transitions 0/269 dead transitions. [2025-02-08 05:33:53,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 269 transitions, 826 flow [2025-02-08 05:33:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2025-02-08 05:33:53,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8701472556894244 [2025-02-08 05:33:53,679 INFO L175 Difference]: Start difference. First operand has 239 places, 245 transitions, 608 flow. Second operand 3 states and 650 transitions. [2025-02-08 05:33:53,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 269 transitions, 826 flow [2025-02-08 05:33:53,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 269 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:53,688 INFO L231 Difference]: Finished difference. Result has 241 places, 257 transitions, 706 flow [2025-02-08 05:33:53,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=241, PETRI_TRANSITIONS=257} [2025-02-08 05:33:53,689 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, 5 predicate places. [2025-02-08 05:33:53,689 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 257 transitions, 706 flow [2025-02-08 05:33:53,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:53,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:53,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:53,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:33:53,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:53,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash -492856831, now seen corresponding path program 1 times [2025-02-08 05:33:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696813189] [2025-02-08 05:33:53,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:53,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 05:33:53,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 05:33:53,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:53,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:53,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:53,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696813189] [2025-02-08 05:33:53,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696813189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:53,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:53,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:53,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601239095] [2025-02-08 05:33:53,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:53,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:33:53,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:53,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:33:53,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:33:53,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249 [2025-02-08 05:33:53,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 257 transitions, 706 flow. Second operand has 5 states, 5 states have (on average 206.4) internal successors, (1032), 5 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:53,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:53,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249 [2025-02-08 05:33:53,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:55,361 INFO L124 PetriNetUnfolderBase]: 3100/18258 cut-off events. [2025-02-08 05:33:55,361 INFO L125 PetriNetUnfolderBase]: For 1484/1830 co-relation queries the response was YES. [2025-02-08 05:33:55,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25978 conditions, 18258 events. 3100/18258 cut-off events. For 1484/1830 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 237128 event pairs, 1331 based on Foata normal form. 18/16272 useless extension candidates. Maximal degree in co-relation 11754. Up to 3766 conditions per place. [2025-02-08 05:33:55,528 INFO L140 encePairwiseOnDemand]: 244/249 looper letters, 56 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2025-02-08 05:33:55,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 289 transitions, 892 flow [2025-02-08 05:33:55,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1286 transitions. [2025-02-08 05:33:55,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8607764390896921 [2025-02-08 05:33:55,532 INFO L175 Difference]: Start difference. First operand has 241 places, 257 transitions, 706 flow. Second operand 6 states and 1286 transitions. [2025-02-08 05:33:55,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 289 transitions, 892 flow [2025-02-08 05:33:55,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 289 transitions, 864 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:55,541 INFO L231 Difference]: Finished difference. Result has 247 places, 259 transitions, 704 flow [2025-02-08 05:33:55,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=704, PETRI_PLACES=247, PETRI_TRANSITIONS=259} [2025-02-08 05:33:55,543 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, 11 predicate places. [2025-02-08 05:33:55,543 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 259 transitions, 704 flow [2025-02-08 05:33:55,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 206.4) internal successors, (1032), 5 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:55,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:55,544 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:55,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:33:55,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:55,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1048768133, now seen corresponding path program 1 times [2025-02-08 05:33:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:55,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942169039] [2025-02-08 05:33:55,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:55,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:55,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 05:33:55,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 05:33:55,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:55,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:33:55,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:33:55,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 05:33:55,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 05:33:55,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:55,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:33:55,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:33:55,617 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:33:55,618 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-08 05:33:55,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-02-08 05:33:55,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-02-08 05:33:55,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-02-08 05:33:55,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-02-08 05:33:55,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-02-08 05:33:55,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-02-08 05:33:55,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-02-08 05:33:55,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-02-08 05:33:55,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-02-08 05:33:55,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-02-08 05:33:55,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-02-08 05:33:55,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-02-08 05:33:55,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-02-08 05:33:55,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-02-08 05:33:55,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-02-08 05:33:55,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:33:55,619 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:33:55,620 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:33:55,620 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:33:55,650 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:33:55,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 300 transitions, 627 flow [2025-02-08 05:33:55,708 INFO L124 PetriNetUnfolderBase]: 42/571 cut-off events. [2025-02-08 05:33:55,708 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:33:55,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 571 events. 42/571 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2056 event pairs, 1 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 400. Up to 12 conditions per place. [2025-02-08 05:33:55,712 INFO L82 GeneralOperation]: Start removeDead. Operand has 282 places, 300 transitions, 627 flow [2025-02-08 05:33:55,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 300 transitions, 627 flow [2025-02-08 05:33:55,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:33:55,721 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;@267ff69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:33:55,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-02-08 05:33:55,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:33:55,726 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-08 05:33:55,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:33:55,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:55,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:55,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:33:55,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:55,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1967576539, now seen corresponding path program 1 times [2025-02-08 05:33:55,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:55,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368138362] [2025-02-08 05:33:55,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:55,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:55,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:33:55,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:33:55,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:55,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:55,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:55,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368138362] [2025-02-08 05:33:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368138362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:55,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:33:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117602854] [2025-02-08 05:33:55,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:55,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:55,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:55,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:55,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:55,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 300 [2025-02-08 05:33:55,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 300 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:55,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:55,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 300 [2025-02-08 05:33:55,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:59,512 INFO L124 PetriNetUnfolderBase]: 8949/36723 cut-off events. [2025-02-08 05:33:59,512 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2025-02-08 05:33:59,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49968 conditions, 36723 events. 8949/36723 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 480142 event pairs, 8324 based on Foata normal form. 10573/43865 useless extension candidates. Maximal degree in co-relation 36484. Up to 12808 conditions per place. [2025-02-08 05:33:59,681 INFO L140 encePairwiseOnDemand]: 275/300 looper letters, 39 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-02-08 05:33:59,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 283 transitions, 675 flow [2025-02-08 05:33:59,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2025-02-08 05:33:59,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8877777777777778 [2025-02-08 05:33:59,683 INFO L175 Difference]: Start difference. First operand has 282 places, 300 transitions, 627 flow. Second operand 3 states and 799 transitions. [2025-02-08 05:33:59,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 283 transitions, 675 flow [2025-02-08 05:33:59,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 283 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:59,686 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 591 flow [2025-02-08 05:33:59,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2025-02-08 05:33:59,687 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 1 predicate places. [2025-02-08 05:33:59,687 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 591 flow [2025-02-08 05:33:59,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:59,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:59,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:59,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:33:59,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:33:59,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash 433714861, now seen corresponding path program 1 times [2025-02-08 05:33:59,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:59,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588589756] [2025-02-08 05:33:59,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:59,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:59,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:33:59,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:33:59,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:59,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:59,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:59,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588589756] [2025-02-08 05:33:59,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588589756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:59,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:59,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217166236] [2025-02-08 05:33:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:59,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:59,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:59,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:59,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:59,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 300 [2025-02-08 05:33:59,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 591 flow. Second operand has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:59,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:59,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 300 [2025-02-08 05:33:59,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:07,047 INFO L124 PetriNetUnfolderBase]: 19597/67584 cut-off events. [2025-02-08 05:34:07,047 INFO L125 PetriNetUnfolderBase]: For 1507/1507 co-relation queries the response was YES. [2025-02-08 05:34:07,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96523 conditions, 67584 events. 19597/67584 cut-off events. For 1507/1507 co-relation queries the response was YES. Maximal size of possible extension queue 1344. Compared 920243 event pairs, 7382 based on Foata normal form. 0/61816 useless extension candidates. Maximal degree in co-relation 90757. Up to 20132 conditions per place. [2025-02-08 05:34:07,382 INFO L140 encePairwiseOnDemand]: 294/300 looper letters, 112 selfloop transitions, 6 changer transitions 0/348 dead transitions. [2025-02-08 05:34:07,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 348 transitions, 969 flow [2025-02-08 05:34:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1504 transitions. [2025-02-08 05:34:07,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8355555555555556 [2025-02-08 05:34:07,385 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 591 flow. Second operand 6 states and 1504 transitions. [2025-02-08 05:34:07,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 348 transitions, 969 flow [2025-02-08 05:34:07,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 348 transitions, 967 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:34:07,390 INFO L231 Difference]: Finished difference. Result has 286 places, 276 transitions, 599 flow [2025-02-08 05:34:07,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=599, PETRI_PLACES=286, PETRI_TRANSITIONS=276} [2025-02-08 05:34:07,391 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 4 predicate places. [2025-02-08 05:34:07,391 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 276 transitions, 599 flow [2025-02-08 05:34:07,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:07,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:07,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:07,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:34:07,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:34:07,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:07,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1174471205, now seen corresponding path program 1 times [2025-02-08 05:34:07,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:07,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321432522] [2025-02-08 05:34:07,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:07,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:07,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:34:07,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:34:07,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:07,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:34:07,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:07,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321432522] [2025-02-08 05:34:07,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321432522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:07,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:07,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:07,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403793162] [2025-02-08 05:34:07,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:07,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:07,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:07,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:07,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 300 [2025-02-08 05:34:07,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 276 transitions, 599 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:34:07,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:07,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 300 [2025-02-08 05:34:07,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand