./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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_08-cond_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 b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:24:46,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:24:46,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:24:46,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:24:46,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:24:46,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:24:46,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:24:46,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:24:46,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:24:46,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:24:46,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:24:46,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:24:46,801 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:24:46,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:24:46,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:24:46,801 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:24:46,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:24:46,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:24:46,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:24:46,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:24:46,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:24:46,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:24:46,802 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:24:46,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:24:46,802 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:24:46,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:24:46,802 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:24:46,802 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:24:46,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:24:46,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:24:46,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:24:46,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:24:46,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:24:46,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:24:46,803 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:24:46,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:24:46,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:24:46,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:24:46,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:24:46,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:24:46,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:24:46,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:24:46,804 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 -> b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 [2025-02-06 09:24:46,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:24:46,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:24:46,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:24:46,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:24:46,969 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:24:46,970 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_08-cond_racefree.i [2025-02-06 09:24:48,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a320efdaf/1c04486ab0c248bc907de294f9093b2e/FLAG94e6fa243 [2025-02-06 09:24:48,372 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:24:48,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2025-02-06 09:24:48,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a320efdaf/1c04486ab0c248bc907de294f9093b2e/FLAG94e6fa243 [2025-02-06 09:24:48,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a320efdaf/1c04486ab0c248bc907de294f9093b2e [2025-02-06 09:24:48,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:24:48,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:24:48,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:24:48,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:24:48,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:24:48,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:48,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149051e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48, skipping insertion in model container [2025-02-06 09:24:48,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:48,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:24:48,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:24:48,906 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:24:48,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:24:48,981 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:24:48,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48 WrapperNode [2025-02-06 09:24:48,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:24:48,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:24:48,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:24:48,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:24:48,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:48,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:49,012 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 150 [2025-02-06 09:24:49,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:24:49,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:24:49,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:24:49,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:24:49,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:49,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:49,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:49,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:49,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:49,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:49,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:49,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:49,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:24:49,029 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:24:49,029 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:24:49,029 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:24:49,030 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (1/1) ... [2025-02-06 09:24:49,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:24:49,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:24:49,063 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-06 09:24:49,066 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-06 09:24:49,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:24:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:24:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:24:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:24:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:24:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:24:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:24:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:24:49,082 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:24:49,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:24:49,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:24:49,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:24:49,084 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:24:49,190 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:24:49,191 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:24:49,368 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:24:49,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:24:49,399 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:24:49,400 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:24:49,419 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:24:49,419 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:24:49,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:24:49 BoogieIcfgContainer [2025-02-06 09:24:49,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:24:49,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:24:49,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:24:49,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:24:49,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:24:48" (1/3) ... [2025-02-06 09:24:49,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b2df4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:24:49, skipping insertion in model container [2025-02-06 09:24:49,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:48" (2/3) ... [2025-02-06 09:24:49,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b2df4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:24:49, skipping insertion in model container [2025-02-06 09:24:49,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:24:49" (3/3) ... [2025-02-06 09:24:49,425 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2025-02-06 09:24:49,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:24:49,435 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_08-cond_racefree.i that has 2 procedures, 198 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-02-06 09:24:49,435 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:24:49,476 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:24:49,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 212 transitions, 431 flow [2025-02-06 09:24:49,562 INFO L124 PetriNetUnfolderBase]: 21/280 cut-off events. [2025-02-06 09:24:49,564 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:24:49,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 280 events. 21/280 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 709 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 154. Up to 6 conditions per place. [2025-02-06 09:24:49,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 212 transitions, 431 flow [2025-02-06 09:24:49,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 212 transitions, 431 flow [2025-02-06 09:24:49,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:24:49,598 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;@53a47972, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:24:49,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-06 09:24:49,623 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:24:49,624 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2025-02-06 09:24:49,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:24:49,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:49,624 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] [2025-02-06 09:24:49,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:24:49,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:49,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1846907495, now seen corresponding path program 1 times [2025-02-06 09:24:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:49,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561850863] [2025-02-06 09:24:49,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:49,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 09:24:49,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 09:24:49,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:49,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:50,457 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-06 09:24:50,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:50,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561850863] [2025-02-06 09:24:50,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561850863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:50,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:50,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365360134] [2025-02-06 09:24:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:50,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:24:50,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:50,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:24:50,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:24:50,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 212 [2025-02-06 09:24:50,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 212 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 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-06 09:24:50,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:50,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 212 [2025-02-06 09:24:50,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:50,784 INFO L124 PetriNetUnfolderBase]: 135/947 cut-off events. [2025-02-06 09:24:50,784 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-02-06 09:24:50,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 947 events. 135/947 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5616 event pairs, 60 based on Foata normal form. 130/971 useless extension candidates. Maximal degree in co-relation 1040. Up to 198 conditions per place. [2025-02-06 09:24:50,790 INFO L140 encePairwiseOnDemand]: 196/212 looper letters, 48 selfloop transitions, 5 changer transitions 0/223 dead transitions. [2025-02-06 09:24:50,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 223 transitions, 559 flow [2025-02-06 09:24:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:24:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:24:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1114 transitions. [2025-02-06 09:24:50,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8757861635220126 [2025-02-06 09:24:50,802 INFO L175 Difference]: Start difference. First operand has 201 places, 212 transitions, 431 flow. Second operand 6 states and 1114 transitions. [2025-02-06 09:24:50,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 223 transitions, 559 flow [2025-02-06 09:24:50,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 223 transitions, 559 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:24:50,809 INFO L231 Difference]: Finished difference. Result has 203 places, 199 transitions, 415 flow [2025-02-06 09:24:50,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=415, PETRI_PLACES=203, PETRI_TRANSITIONS=199} [2025-02-06 09:24:50,814 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, 2 predicate places. [2025-02-06 09:24:50,814 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 199 transitions, 415 flow [2025-02-06 09:24:50,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 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-06 09:24:50,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:50,815 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] [2025-02-06 09:24:50,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:24:50,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:24:50,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1373750703, now seen corresponding path program 1 times [2025-02-06 09:24:50,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:50,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410913562] [2025-02-06 09:24:50,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:50,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:50,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 09:24:50,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 09:24:50,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:50,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:50,905 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-06 09:24:50,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:50,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410913562] [2025-02-06 09:24:50,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410913562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:50,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:50,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:24:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187923873] [2025-02-06 09:24:50,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:50,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:50,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:50,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:50,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:50,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 212 [2025-02-06 09:24:50,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 199 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 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-06 09:24:50,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:50,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 212 [2025-02-06 09:24:50,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:51,006 INFO L124 PetriNetUnfolderBase]: 57/618 cut-off events. [2025-02-06 09:24:51,006 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 09:24:51,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 618 events. 57/618 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2737 event pairs, 25 based on Foata normal form. 1/552 useless extension candidates. Maximal degree in co-relation 612. Up to 96 conditions per place. [2025-02-06 09:24:51,009 INFO L140 encePairwiseOnDemand]: 209/212 looper letters, 22 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2025-02-06 09:24:51,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 205 transitions, 475 flow [2025-02-06 09:24:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2025-02-06 09:24:51,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9025157232704403 [2025-02-06 09:24:51,010 INFO L175 Difference]: Start difference. First operand has 203 places, 199 transitions, 415 flow. Second operand 3 states and 574 transitions. [2025-02-06 09:24:51,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 205 transitions, 475 flow [2025-02-06 09:24:51,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 205 transitions, 465 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:24:51,014 INFO L231 Difference]: Finished difference. Result has 201 places, 199 transitions, 413 flow [2025-02-06 09:24:51,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=201, PETRI_TRANSITIONS=199} [2025-02-06 09:24:51,014 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, 0 predicate places. [2025-02-06 09:24:51,015 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 199 transitions, 413 flow [2025-02-06 09:24:51,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 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-06 09:24:51,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:51,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:51,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:24:51,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:24:51,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:51,016 INFO L85 PathProgramCache]: Analyzing trace with hash -366105985, now seen corresponding path program 1 times [2025-02-06 09:24:51,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:51,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537418334] [2025-02-06 09:24:51,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:51,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:51,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 09:24:51,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 09:24:51,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:51,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:51,077 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-06 09:24:51,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:51,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537418334] [2025-02-06 09:24:51,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537418334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:51,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:51,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:24:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070063703] [2025-02-06 09:24:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:51,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:51,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:51,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:51,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 212 [2025-02-06 09:24:51,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 199 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-06 09:24:51,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:51,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 212 [2025-02-06 09:24:51,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:51,238 INFO L124 PetriNetUnfolderBase]: 134/946 cut-off events. [2025-02-06 09:24:51,238 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:24:51,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 946 events. 134/946 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5421 event pairs, 33 based on Foata normal form. 0/850 useless extension candidates. Maximal degree in co-relation 1099. Up to 130 conditions per place. [2025-02-06 09:24:51,242 INFO L140 encePairwiseOnDemand]: 203/212 looper letters, 30 selfloop transitions, 6 changer transitions 0/212 dead transitions. [2025-02-06 09:24:51,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 212 transitions, 514 flow [2025-02-06 09:24:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2025-02-06 09:24:51,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9009433962264151 [2025-02-06 09:24:51,246 INFO L175 Difference]: Start difference. First operand has 201 places, 199 transitions, 413 flow. Second operand 3 states and 573 transitions. [2025-02-06 09:24:51,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 212 transitions, 514 flow [2025-02-06 09:24:51,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 212 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:24:51,251 INFO L231 Difference]: Finished difference. Result has 201 places, 201 transitions, 447 flow [2025-02-06 09:24:51,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=201, PETRI_TRANSITIONS=201} [2025-02-06 09:24:51,253 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, 0 predicate places. [2025-02-06 09:24:51,254 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 201 transitions, 447 flow [2025-02-06 09:24:51,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-06 09:24:51,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:51,254 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, 1, 1, 1, 1] [2025-02-06 09:24:51,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:24:51,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:24:51,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash -135625749, now seen corresponding path program 1 times [2025-02-06 09:24:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:51,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80474602] [2025-02-06 09:24:51,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:51,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:51,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 09:24:51,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 09:24:51,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:51,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:24:51,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:24:51,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 09:24:51,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 09:24:51,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:51,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:24:51,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:24:51,352 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:24:51,353 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-02-06 09:24:51,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-02-06 09:24:51,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-02-06 09:24:51,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-02-06 09:24:51,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-02-06 09:24:51,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-02-06 09:24:51,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-02-06 09:24:51,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-02-06 09:24:51,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-02-06 09:24:51,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-02-06 09:24:51,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-02-06 09:24:51,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-02-06 09:24:51,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:24:51,355 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:24:51,356 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:24:51,357 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:24:51,374 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:24:51,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 263 transitions, 542 flow [2025-02-06 09:24:51,420 INFO L124 PetriNetUnfolderBase]: 36/426 cut-off events. [2025-02-06 09:24:51,420 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:24:51,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 426 events. 36/426 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1343 event pairs, 0 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 282. Up to 9 conditions per place. [2025-02-06 09:24:51,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 263 transitions, 542 flow [2025-02-06 09:24:51,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 263 transitions, 542 flow [2025-02-06 09:24:51,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:24:51,426 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;@53a47972, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:24:51,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 09:24:51,433 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:24:51,433 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2025-02-06 09:24:51,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:24:51,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:51,433 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] [2025-02-06 09:24:51,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:51,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash -583992217, now seen corresponding path program 1 times [2025-02-06 09:24:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:51,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689935511] [2025-02-06 09:24:51,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:51,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:51,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 09:24:51,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 09:24:51,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:51,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:51,744 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-06 09:24:51,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:51,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689935511] [2025-02-06 09:24:51,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689935511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:51,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:51,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:51,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406211370] [2025-02-06 09:24:51,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:51,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:24:51,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:51,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:24:51,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:24:51,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 263 [2025-02-06 09:24:51,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 263 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 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-06 09:24:51,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:51,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 263 [2025-02-06 09:24:51,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:52,606 INFO L124 PetriNetUnfolderBase]: 1710/6295 cut-off events. [2025-02-06 09:24:52,607 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-02-06 09:24:52,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9010 conditions, 6295 events. 1710/6295 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 60990 event pairs, 168 based on Foata normal form. 1789/7457 useless extension candidates. Maximal degree in co-relation 1161. Up to 1840 conditions per place. [2025-02-06 09:24:52,703 INFO L140 encePairwiseOnDemand]: 241/263 looper letters, 80 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2025-02-06 09:24:52,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 292 transitions, 770 flow [2025-02-06 09:24:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:24:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:24:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2025-02-06 09:24:52,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8859315589353612 [2025-02-06 09:24:52,707 INFO L175 Difference]: Start difference. First operand has 247 places, 263 transitions, 542 flow. Second operand 6 states and 1398 transitions. [2025-02-06 09:24:52,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 292 transitions, 770 flow [2025-02-06 09:24:52,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 292 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:24:52,714 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 514 flow [2025-02-06 09:24:52,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2025-02-06 09:24:52,715 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-02-06 09:24:52,715 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 514 flow [2025-02-06 09:24:52,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 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-06 09:24:52,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:52,718 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] [2025-02-06 09:24:52,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:24:52,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:52,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1431735416, now seen corresponding path program 1 times [2025-02-06 09:24:52,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:52,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475715874] [2025-02-06 09:24:52,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:52,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:52,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 09:24:52,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 09:24:52,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:52,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:52,776 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-06 09:24:52,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:52,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475715874] [2025-02-06 09:24:52,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475715874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:52,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:52,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:24:52,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963272918] [2025-02-06 09:24:52,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:52,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:52,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:52,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:52,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:52,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 263 [2025-02-06 09:24:52,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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-06 09:24:52,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:52,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 263 [2025-02-06 09:24:52,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:53,232 INFO L124 PetriNetUnfolderBase]: 964/4719 cut-off events. [2025-02-06 09:24:53,232 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2025-02-06 09:24:53,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6299 conditions, 4719 events. 964/4719 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 43932 event pairs, 616 based on Foata normal form. 1/4298 useless extension candidates. Maximal degree in co-relation 3845. Up to 1431 conditions per place. [2025-02-06 09:24:53,253 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 31 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2025-02-06 09:24:53,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 251 transitions, 596 flow [2025-02-06 09:24:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-02-06 09:24:53,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8795944233206591 [2025-02-06 09:24:53,256 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 514 flow. Second operand 3 states and 694 transitions. [2025-02-06 09:24:53,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 251 transitions, 596 flow [2025-02-06 09:24:53,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 251 transitions, 584 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:24:53,259 INFO L231 Difference]: Finished difference. Result has 247 places, 245 transitions, 516 flow [2025-02-06 09:24:53,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=247, PETRI_TRANSITIONS=245} [2025-02-06 09:24:53,260 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 0 predicate places. [2025-02-06 09:24:53,260 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 245 transitions, 516 flow [2025-02-06 09:24:53,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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-06 09:24:53,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:53,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:53,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:24:53,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:53,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:53,262 INFO L85 PathProgramCache]: Analyzing trace with hash 301510606, now seen corresponding path program 1 times [2025-02-06 09:24:53,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:53,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097351080] [2025-02-06 09:24:53,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:53,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 09:24:53,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 09:24:53,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:53,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:53,305 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-06 09:24:53,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097351080] [2025-02-06 09:24:53,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097351080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:53,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:53,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:24:53,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382369254] [2025-02-06 09:24:53,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:53,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:53,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:53,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:53,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:53,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 263 [2025-02-06 09:24:53,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 245 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-06 09:24:53,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:53,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 263 [2025-02-06 09:24:53,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:54,708 INFO L124 PetriNetUnfolderBase]: 4720/15709 cut-off events. [2025-02-06 09:24:54,709 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2025-02-06 09:24:54,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23016 conditions, 15709 events. 4720/15709 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 175494 event pairs, 1586 based on Foata normal form. 0/13897 useless extension candidates. Maximal degree in co-relation 22905. Up to 3665 conditions per place. [2025-02-06 09:24:54,772 INFO L140 encePairwiseOnDemand]: 244/263 looper letters, 58 selfloop transitions, 14 changer transitions 0/278 dead transitions. [2025-02-06 09:24:54,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 278 transitions, 737 flow [2025-02-06 09:24:54,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2025-02-06 09:24:54,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8846641318124208 [2025-02-06 09:24:54,775 INFO L175 Difference]: Start difference. First operand has 247 places, 245 transitions, 516 flow. Second operand 3 states and 698 transitions. [2025-02-06 09:24:54,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 278 transitions, 737 flow [2025-02-06 09:24:54,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 278 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:24:54,781 INFO L231 Difference]: Finished difference. Result has 250 places, 259 transitions, 636 flow [2025-02-06 09:24:54,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=250, PETRI_TRANSITIONS=259} [2025-02-06 09:24:54,781 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 3 predicate places. [2025-02-06 09:24:54,783 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 259 transitions, 636 flow [2025-02-06 09:24:54,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-06 09:24:54,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:54,783 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] [2025-02-06 09:24:54,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:24:54,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:54,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:54,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1851305913, now seen corresponding path program 1 times [2025-02-06 09:24:54,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:54,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261795949] [2025-02-06 09:24:54,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:54,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:54,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 09:24:54,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 09:24:54,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:54,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:54,832 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-06 09:24:54,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:54,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261795949] [2025-02-06 09:24:54,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261795949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:54,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:54,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:24:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523983313] [2025-02-06 09:24:54,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:54,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:54,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:54,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:54,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:54,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 263 [2025-02-06 09:24:54,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 259 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:54,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:54,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 263 [2025-02-06 09:24:54,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:56,430 INFO L124 PetriNetUnfolderBase]: 4872/18188 cut-off events. [2025-02-06 09:24:56,430 INFO L125 PetriNetUnfolderBase]: For 4543/4728 co-relation queries the response was YES. [2025-02-06 09:24:56,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29687 conditions, 18188 events. 4872/18188 cut-off events. For 4543/4728 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 217319 event pairs, 2424 based on Foata normal form. 47/16407 useless extension candidates. Maximal degree in co-relation 28163. Up to 6154 conditions per place. [2025-02-06 09:24:56,509 INFO L140 encePairwiseOnDemand]: 254/263 looper letters, 52 selfloop transitions, 14 changer transitions 0/283 dead transitions. [2025-02-06 09:24:56,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 283 transitions, 854 flow [2025-02-06 09:24:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2025-02-06 09:24:56,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8770595690747782 [2025-02-06 09:24:56,511 INFO L175 Difference]: Start difference. First operand has 250 places, 259 transitions, 636 flow. Second operand 3 states and 692 transitions. [2025-02-06 09:24:56,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 283 transitions, 854 flow [2025-02-06 09:24:56,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 283 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:24:56,519 INFO L231 Difference]: Finished difference. Result has 252 places, 271 transitions, 734 flow [2025-02-06 09:24:56,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=252, PETRI_TRANSITIONS=271} [2025-02-06 09:24:56,520 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 5 predicate places. [2025-02-06 09:24:56,520 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 271 transitions, 734 flow [2025-02-06 09:24:56,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:24:56,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:56,521 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, 1] [2025-02-06 09:24:56,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:24:56,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:56,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:56,521 INFO L85 PathProgramCache]: Analyzing trace with hash -692117707, now seen corresponding path program 1 times [2025-02-06 09:24:56,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:56,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884732745] [2025-02-06 09:24:56,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:56,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 09:24:56,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 09:24:56,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:56,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:56,604 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-06 09:24:56,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:56,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884732745] [2025-02-06 09:24:56,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884732745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:56,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146897571] [2025-02-06 09:24:56,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:56,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:24:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:56,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:24:56,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:24:56,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 263 [2025-02-06 09:24:56,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 271 transitions, 734 flow. Second operand has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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-06 09:24:56,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:56,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 263 [2025-02-06 09:24:56,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:58,097 INFO L124 PetriNetUnfolderBase]: 3182/19555 cut-off events. [2025-02-06 09:24:58,097 INFO L125 PetriNetUnfolderBase]: For 1465/3188 co-relation queries the response was YES. [2025-02-06 09:24:58,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26683 conditions, 19555 events. 3182/19555 cut-off events. For 1465/3188 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 255551 event pairs, 419 based on Foata normal form. 14/17106 useless extension candidates. Maximal degree in co-relation 12185. Up to 3493 conditions per place. [2025-02-06 09:24:58,269 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 56 selfloop transitions, 5 changer transitions 0/303 dead transitions. [2025-02-06 09:24:58,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 303 transitions, 920 flow [2025-02-06 09:24:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:24:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:24:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1370 transitions. [2025-02-06 09:24:58,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8681875792141952 [2025-02-06 09:24:58,273 INFO L175 Difference]: Start difference. First operand has 252 places, 271 transitions, 734 flow. Second operand 6 states and 1370 transitions. [2025-02-06 09:24:58,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 303 transitions, 920 flow [2025-02-06 09:24:58,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 303 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:24:58,283 INFO L231 Difference]: Finished difference. Result has 258 places, 273 transitions, 732 flow [2025-02-06 09:24:58,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=732, PETRI_PLACES=258, PETRI_TRANSITIONS=273} [2025-02-06 09:24:58,286 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 11 predicate places. [2025-02-06 09:24:58,286 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 273 transitions, 732 flow [2025-02-06 09:24:58,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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-06 09:24:58,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:58,287 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, 1, 1, 1, 1] [2025-02-06 09:24:58,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:24:58,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:58,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash -51716715, now seen corresponding path program 1 times [2025-02-06 09:24:58,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:58,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630114517] [2025-02-06 09:24:58,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:58,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 09:24:58,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 09:24:58,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:58,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:24:58,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:24:58,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 09:24:58,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 09:24:58,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:58,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:24:58,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:24:58,355 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:24:58,355 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-06 09:24:58,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-02-06 09:24:58,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-02-06 09:24:58,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-02-06 09:24:58,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-02-06 09:24:58,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-02-06 09:24:58,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-02-06 09:24:58,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-02-06 09:24:58,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-02-06 09:24:58,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-02-06 09:24:58,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-02-06 09:24:58,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-02-06 09:24:58,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-02-06 09:24:58,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-02-06 09:24:58,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-02-06 09:24:58,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-02-06 09:24:58,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:24:58,357 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 09:24:58,360 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:24:58,360 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:24:58,400 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:24:58,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 293 places, 314 transitions, 655 flow [2025-02-06 09:24:58,490 INFO L124 PetriNetUnfolderBase]: 54/615 cut-off events. [2025-02-06 09:24:58,491 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 09:24:58,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 615 events. 54/615 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2235 event pairs, 1 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 434. Up to 12 conditions per place. [2025-02-06 09:24:58,494 INFO L82 GeneralOperation]: Start removeDead. Operand has 293 places, 314 transitions, 655 flow [2025-02-06 09:24:58,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 293 places, 314 transitions, 655 flow [2025-02-06 09:24:58,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:24:58,498 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;@53a47972, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:24:58,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-02-06 09:24:58,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:24:58,504 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2025-02-06 09:24:58,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:24:58,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:58,504 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] [2025-02-06 09:24:58,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-06 09:24:58,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:58,505 INFO L85 PathProgramCache]: Analyzing trace with hash 922998887, now seen corresponding path program 1 times [2025-02-06 09:24:58,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:58,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775700360] [2025-02-06 09:24:58,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:58,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:58,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 09:24:58,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 09:24:58,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:58,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:58,791 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-06 09:24:58,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:58,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775700360] [2025-02-06 09:24:58,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775700360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:58,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:58,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:58,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48414749] [2025-02-06 09:24:58,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:58,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:24:58,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:58,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:24:58,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:24:58,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 314 [2025-02-06 09:24:58,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 314 transitions, 655 flow. Second operand has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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-06 09:24:58,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:58,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 314 [2025-02-06 09:24:58,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:04,187 INFO L124 PetriNetUnfolderBase]: 18812/53889 cut-off events. [2025-02-06 09:25:04,187 INFO L125 PetriNetUnfolderBase]: For 1255/1255 co-relation queries the response was YES. [2025-02-06 09:25:04,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80302 conditions, 53889 events. 18812/53889 cut-off events. For 1255/1255 co-relation queries the response was YES. Maximal size of possible extension queue 1285. Compared 678913 event pairs, 2086 based on Foata normal form. 19366/68419 useless extension candidates. Maximal degree in co-relation 9223. Up to 18109 conditions per place. [2025-02-06 09:25:04,493 INFO L140 encePairwiseOnDemand]: 286/314 looper letters, 112 selfloop transitions, 5 changer transitions 0/361 dead transitions. [2025-02-06 09:25:04,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 361 transitions, 983 flow [2025-02-06 09:25:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2025-02-06 09:25:04,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8927813163481954 [2025-02-06 09:25:04,497 INFO L175 Difference]: Start difference. First operand has 293 places, 314 transitions, 655 flow. Second operand 6 states and 1682 transitions. [2025-02-06 09:25:04,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 361 transitions, 983 flow [2025-02-06 09:25:04,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 361 transitions, 983 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:04,501 INFO L231 Difference]: Finished difference. Result has 295 places, 289 transitions, 615 flow [2025-02-06 09:25:04,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=295, PETRI_TRANSITIONS=289} [2025-02-06 09:25:04,502 INFO L279 CegarLoopForPetriNet]: 293 programPoint places, 2 predicate places. [2025-02-06 09:25:04,502 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 289 transitions, 615 flow [2025-02-06 09:25:04,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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-06 09:25:04,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:04,503 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] [2025-02-06 09:25:04,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:25:04,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-06 09:25:04,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:04,503 INFO L85 PathProgramCache]: Analyzing trace with hash 910881394, now seen corresponding path program 1 times [2025-02-06 09:25:04,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:04,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055447470] [2025-02-06 09:25:04,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:04,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:04,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 09:25:04,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 09:25:04,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:04,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:04,542 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-06 09:25:04,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:04,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055447470] [2025-02-06 09:25:04,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055447470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:04,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:04,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722509654] [2025-02-06 09:25:04,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:04,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:04,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:04,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:04,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 314 [2025-02-06 09:25:04,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 289 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 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-06 09:25:04,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:04,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 314 [2025-02-06 09:25:04,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:08,354 INFO L124 PetriNetUnfolderBase]: 10320/38305 cut-off events. [2025-02-06 09:25:08,355 INFO L125 PetriNetUnfolderBase]: For 1819/1819 co-relation queries the response was YES. [2025-02-06 09:25:08,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53423 conditions, 38305 events. 10320/38305 cut-off events. For 1819/1819 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 498106 event pairs, 8298 based on Foata normal form. 1/34628 useless extension candidates. Maximal degree in co-relation 38924. Up to 14093 conditions per place. [2025-02-06 09:25:08,566 INFO L140 encePairwiseOnDemand]: 311/314 looper letters, 39 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2025-02-06 09:25:08,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 296 transitions, 713 flow [2025-02-06 09:25:08,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2025-02-06 09:25:08,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8630573248407644 [2025-02-06 09:25:08,568 INFO L175 Difference]: Start difference. First operand has 295 places, 289 transitions, 615 flow. Second operand 3 states and 813 transitions. [2025-02-06 09:25:08,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 296 transitions, 713 flow [2025-02-06 09:25:08,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 296 transitions, 701 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:25:08,572 INFO L231 Difference]: Finished difference. Result has 293 places, 290 transitions, 617 flow [2025-02-06 09:25:08,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=293, PETRI_TRANSITIONS=290} [2025-02-06 09:25:08,574 INFO L279 CegarLoopForPetriNet]: 293 programPoint places, 0 predicate places. [2025-02-06 09:25:08,574 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 290 transitions, 617 flow [2025-02-06 09:25:08,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 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-06 09:25:08,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:08,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:08,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:25:08,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-06 09:25:08,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2137643425, now seen corresponding path program 1 times [2025-02-06 09:25:08,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:08,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767627884] [2025-02-06 09:25:08,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:08,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:08,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 09:25:08,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 09:25:08,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:08,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:08,609 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-06 09:25:08,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:08,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767627884] [2025-02-06 09:25:08,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767627884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:08,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:08,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:08,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691179002] [2025-02-06 09:25:08,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:08,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:08,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:08,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:08,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:08,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 314 [2025-02-06 09:25:08,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 290 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 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-06 09:25:08,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:08,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 314 [2025-02-06 09:25:08,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand