./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.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 fa0ecdfec37b7bd940900ff854c772fdadeb6c6111223868a85a6141c0a777e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:44:33,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:44:34,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:44:34,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:44:34,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:44:34,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:44:34,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:44:34,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:44:34,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:44:34,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:44:34,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:44:34,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:44:34,029 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:44:34,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:44:34,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:44:34,030 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:44:34,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:44:34,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:44:34,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:44:34,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:44:34,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:44:34,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:44:34,031 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:44:34,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:44:34,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:44:34,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:44:34,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:44:34,031 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:44:34,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:44:34,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:44:34,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:44:34,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:44:34,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:44:34,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:44:34,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:44:34,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:44:34,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:44:34,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:44:34,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:44:34,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:44:34,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:44:34,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:44:34,033 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 -> fa0ecdfec37b7bd940900ff854c772fdadeb6c6111223868a85a6141c0a777e6 [2025-02-08 05:44:34,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:44:34,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:44:34,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:44:34,322 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:44:34,322 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:44:34,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i [2025-02-08 05:44:35,678 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f62bec830/e329b5f9134f453d8fb4252b95d841ff/FLAGdcf809d1d [2025-02-08 05:44:36,060 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:44:36,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i [2025-02-08 05:44:36,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f62bec830/e329b5f9134f453d8fb4252b95d841ff/FLAGdcf809d1d [2025-02-08 05:44:36,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f62bec830/e329b5f9134f453d8fb4252b95d841ff [2025-02-08 05:44:36,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:44:36,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:44:36,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:44:36,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:44:36,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:44:36,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5ee1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36, skipping insertion in model container [2025-02-08 05:44:36,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:44:36,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:44:36,571 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:44:36,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:44:36,663 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:44:36,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36 WrapperNode [2025-02-08 05:44:36,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:44:36,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:44:36,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:44:36,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:44:36,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,699 INFO L138 Inliner]: procedures = 158, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2025-02-08 05:44:36,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:44:36,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:44:36,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:44:36,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:44:36,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:44:36,730 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:44:36,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:44:36,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:44:36,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (1/1) ... [2025-02-08 05:44:36,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:44:36,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:44:36,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:44:36,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:44:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:44:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:44:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:44:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:44:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:44:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:44:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:44:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-08 05:44:36,788 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-08 05:44:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:44:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:44:36,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:44:36,790 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:44:36,917 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:44:36,919 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:44:37,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~#tids~0#1.base, main_~#tids~0#1.offset; [2025-02-08 05:44:37,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: SUMMARY for call ULTIMATE.dealloc(main_~#tids~0#1.base, main_~#tids~0#1.offset); srcloc: null [2025-02-08 05:44:37,177 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:44:37,177 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:44:37,200 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:44:37,200 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:44:37,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:44:37 BoogieIcfgContainer [2025-02-08 05:44:37,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:44:37,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:44:37,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:44:37,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:44:37,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:44:36" (1/3) ... [2025-02-08 05:44:37,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b10fa29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:44:37, skipping insertion in model container [2025-02-08 05:44:37,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:44:36" (2/3) ... [2025-02-08 05:44:37,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b10fa29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:44:37, skipping insertion in model container [2025-02-08 05:44:37,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:44:37" (3/3) ... [2025-02-08 05:44:37,215 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-3.i [2025-02-08 05:44:37,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:44:37,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const-race-3.i that has 2 procedures, 90 locations, 1 initial locations, 2 loop locations, and 5 error locations. [2025-02-08 05:44:37,235 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:44:37,314 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:44:37,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 109 transitions, 232 flow [2025-02-08 05:44:37,447 INFO L124 PetriNetUnfolderBase]: 2/219 cut-off events. [2025-02-08 05:44:37,449 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:44:37,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 219 events. 2/219 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 601 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 61. Up to 5 conditions per place. [2025-02-08 05:44:37,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 109 transitions, 232 flow [2025-02-08 05:44:37,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 108 transitions, 229 flow [2025-02-08 05:44:37,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:44:37,480 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;@72ac0b61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:44:37,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 05:44:37,497 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:44:37,497 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-02-08 05:44:37,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:44:37,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:37,500 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] [2025-02-08 05:44:37,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:44:37,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:37,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1645090184, now seen corresponding path program 1 times [2025-02-08 05:44:37,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:37,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504123495] [2025-02-08 05:44:37,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:37,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:37,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:44:37,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:44:37,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:37,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:38,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:38,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504123495] [2025-02-08 05:44:38,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504123495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:38,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:38,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:38,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563660389] [2025-02-08 05:44:38,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:38,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:38,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:38,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:38,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 109 [2025-02-08 05:44:38,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 108 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:38,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:38,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 109 [2025-02-08 05:44:38,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:38,852 INFO L124 PetriNetUnfolderBase]: 138/786 cut-off events. [2025-02-08 05:44:38,852 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-08 05:44:38,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 786 events. 138/786 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4913 event pairs, 87 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 826. Up to 276 conditions per place. [2025-02-08 05:44:38,862 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-02-08 05:44:38,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 319 flow [2025-02-08 05:44:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-02-08 05:44:38,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7752293577981652 [2025-02-08 05:44:38,880 INFO L175 Difference]: Start difference. First operand has 112 places, 108 transitions, 229 flow. Second operand 6 states and 507 transitions. [2025-02-08 05:44:38,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 319 flow [2025-02-08 05:44:38,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:38,890 INFO L231 Difference]: Finished difference. Result has 114 places, 107 transitions, 233 flow [2025-02-08 05:44:38,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=114, PETRI_TRANSITIONS=107} [2025-02-08 05:44:38,897 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2025-02-08 05:44:38,897 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 107 transitions, 233 flow [2025-02-08 05:44:38,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:38,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:38,898 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] [2025-02-08 05:44:38,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:44:38,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:44:38,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash -713166456, now seen corresponding path program 1 times [2025-02-08 05:44:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:38,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297982661] [2025-02-08 05:44:38,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:38,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:44:38,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:44:38,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:38,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:38,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:38,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297982661] [2025-02-08 05:44:38,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297982661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:38,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:38,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:44:38,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689993986] [2025-02-08 05:44:38,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:38,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:44:38,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:38,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:44:38,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:44:39,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2025-02-08 05:44:39,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 107 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:39,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:39,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2025-02-08 05:44:39,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:39,132 INFO L124 PetriNetUnfolderBase]: 33/416 cut-off events. [2025-02-08 05:44:39,132 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:44:39,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 416 events. 33/416 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1814 event pairs, 9 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 459. Up to 43 conditions per place. [2025-02-08 05:44:39,138 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 17 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2025-02-08 05:44:39,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 287 flow [2025-02-08 05:44:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:44:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:44:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2025-02-08 05:44:39,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9128440366972477 [2025-02-08 05:44:39,144 INFO L175 Difference]: Start difference. First operand has 114 places, 107 transitions, 233 flow. Second operand 4 states and 398 transitions. [2025-02-08 05:44:39,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 287 flow [2025-02-08 05:44:39,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:39,148 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 235 flow [2025-02-08 05:44:39,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2025-02-08 05:44:39,149 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 1 predicate places. [2025-02-08 05:44:39,149 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 235 flow [2025-02-08 05:44:39,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:39,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:39,149 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] [2025-02-08 05:44:39,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:44:39,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:44:39,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:39,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1716438683, now seen corresponding path program 1 times [2025-02-08 05:44:39,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:39,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993311527] [2025-02-08 05:44:39,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:39,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:39,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:44:39,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:44:39,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:39,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:39,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:39,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993311527] [2025-02-08 05:44:39,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993311527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:39,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:39,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:39,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468649754] [2025-02-08 05:44:39,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:39,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:39,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:39,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:39,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:39,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 109 [2025-02-08 05:44:39,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:39,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:39,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 109 [2025-02-08 05:44:39,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:39,352 INFO L124 PetriNetUnfolderBase]: 112/709 cut-off events. [2025-02-08 05:44:39,352 INFO L125 PetriNetUnfolderBase]: For 38/48 co-relation queries the response was YES. [2025-02-08 05:44:39,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 709 events. 112/709 cut-off events. For 38/48 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4290 event pairs, 59 based on Foata normal form. 1/628 useless extension candidates. Maximal degree in co-relation 910. Up to 182 conditions per place. [2025-02-08 05:44:39,359 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 18 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-02-08 05:44:39,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 299 flow [2025-02-08 05:44:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2025-02-08 05:44:39,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357798165137615 [2025-02-08 05:44:39,361 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 235 flow. Second operand 3 states and 306 transitions. [2025-02-08 05:44:39,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 299 flow [2025-02-08 05:44:39,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 115 transitions, 291 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:44:39,367 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 265 flow [2025-02-08 05:44:39,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2025-02-08 05:44:39,368 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2025-02-08 05:44:39,368 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 265 flow [2025-02-08 05:44:39,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:39,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:39,369 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] [2025-02-08 05:44:39,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:44:39,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:44:39,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash 41242153, now seen corresponding path program 1 times [2025-02-08 05:44:39,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:39,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244056808] [2025-02-08 05:44:39,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:39,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:39,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:44:39,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:44:39,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:39,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:39,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:44:39,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:44:39,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:44:39,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:39,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:39,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:44:39,442 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:44:39,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-08 05:44:39,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-08 05:44:39,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-08 05:44:39,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-08 05:44:39,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-02-08 05:44:39,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-02-08 05:44:39,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-02-08 05:44:39,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-08 05:44:39,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-08 05:44:39,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:44:39,447 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:44:39,449 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:44:39,450 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:44:39,486 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:44:39,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 145 transitions, 322 flow [2025-02-08 05:44:39,544 INFO L124 PetriNetUnfolderBase]: 7/386 cut-off events. [2025-02-08 05:44:39,544 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:44:39,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 386 events. 7/386 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1329 event pairs, 1 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 409. Up to 12 conditions per place. [2025-02-08 05:44:39,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 145 transitions, 322 flow [2025-02-08 05:44:39,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 126 transitions, 274 flow [2025-02-08 05:44:39,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:44:39,551 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;@72ac0b61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:44:39,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 05:44:39,555 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:44:39,556 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-02-08 05:44:39,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:44:39,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:39,557 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] [2025-02-08 05:44:39,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:44:39,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1636903672, now seen corresponding path program 1 times [2025-02-08 05:44:39,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:39,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447889950] [2025-02-08 05:44:39,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:39,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:44:39,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:44:39,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:39,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:39,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447889950] [2025-02-08 05:44:39,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447889950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:39,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:39,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:39,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118546909] [2025-02-08 05:44:39,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:39,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:39,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:39,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:39,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:40,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 145 [2025-02-08 05:44:40,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:40,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:40,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 145 [2025-02-08 05:44:40,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:40,565 INFO L124 PetriNetUnfolderBase]: 879/3345 cut-off events. [2025-02-08 05:44:40,566 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-02-08 05:44:40,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4952 conditions, 3345 events. 879/3345 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 29283 event pairs, 505 based on Foata normal form. 0/3021 useless extension candidates. Maximal degree in co-relation 1438. Up to 1365 conditions per place. [2025-02-08 05:44:40,602 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 45 selfloop transitions, 5 changer transitions 0/141 dead transitions. [2025-02-08 05:44:40,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 141 transitions, 404 flow [2025-02-08 05:44:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2025-02-08 05:44:40,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7896551724137931 [2025-02-08 05:44:40,606 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 274 flow. Second operand 6 states and 687 transitions. [2025-02-08 05:44:40,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 141 transitions, 404 flow [2025-02-08 05:44:40,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 141 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:40,613 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 278 flow [2025-02-08 05:44:40,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2025-02-08 05:44:40,617 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 2 predicate places. [2025-02-08 05:44:40,617 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 278 flow [2025-02-08 05:44:40,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:40,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:40,617 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] [2025-02-08 05:44:40,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:44:40,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:44:40,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:40,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2050571896, now seen corresponding path program 1 times [2025-02-08 05:44:40,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:40,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371420738] [2025-02-08 05:44:40,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:40,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:40,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:44:40,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:44:40,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:40,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:40,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371420738] [2025-02-08 05:44:40,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371420738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:40,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:44:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764990248] [2025-02-08 05:44:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:40,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:44:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:40,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:44:40,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:44:40,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 145 [2025-02-08 05:44:40,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 125 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:40,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:40,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 145 [2025-02-08 05:44:40,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:40,960 INFO L124 PetriNetUnfolderBase]: 253/1589 cut-off events. [2025-02-08 05:44:40,961 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-02-08 05:44:40,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 1589 events. 253/1589 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11691 event pairs, 101 based on Foata normal form. 1/1437 useless extension candidates. Maximal degree in co-relation 1094. Up to 267 conditions per place. [2025-02-08 05:44:40,971 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 24 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-02-08 05:44:40,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 134 transitions, 352 flow [2025-02-08 05:44:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:44:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:44:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2025-02-08 05:44:40,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8913793103448275 [2025-02-08 05:44:40,974 INFO L175 Difference]: Start difference. First operand has 133 places, 125 transitions, 278 flow. Second operand 4 states and 517 transitions. [2025-02-08 05:44:40,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 134 transitions, 352 flow [2025-02-08 05:44:40,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 342 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:40,977 INFO L231 Difference]: Finished difference. Result has 132 places, 126 transitions, 284 flow [2025-02-08 05:44:40,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=132, PETRI_TRANSITIONS=126} [2025-02-08 05:44:40,978 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2025-02-08 05:44:40,979 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 126 transitions, 284 flow [2025-02-08 05:44:40,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:40,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:40,979 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] [2025-02-08 05:44:40,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:44:40,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:44:40,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1353831179, now seen corresponding path program 1 times [2025-02-08 05:44:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:40,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662514403] [2025-02-08 05:44:40,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:40,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:44:40,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:44:40,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:40,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:41,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:41,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662514403] [2025-02-08 05:44:41,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662514403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:41,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:41,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:41,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631794559] [2025-02-08 05:44:41,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:41,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:41,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:41,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:41,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:41,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-02-08 05:44:41,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 126 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:41,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:41,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-02-08 05:44:41,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:41,496 INFO L124 PetriNetUnfolderBase]: 1070/3962 cut-off events. [2025-02-08 05:44:41,496 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-02-08 05:44:41,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5831 conditions, 3962 events. 1070/3962 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 37189 event pairs, 701 based on Foata normal form. 0/3518 useless extension candidates. Maximal degree in co-relation 5709. Up to 1393 conditions per place. [2025-02-08 05:44:41,527 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 27 selfloop transitions, 6 changer transitions 0/139 dead transitions. [2025-02-08 05:44:41,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 139 transitions, 386 flow [2025-02-08 05:44:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2025-02-08 05:44:41,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9057471264367816 [2025-02-08 05:44:41,530 INFO L175 Difference]: Start difference. First operand has 132 places, 126 transitions, 284 flow. Second operand 3 states and 394 transitions. [2025-02-08 05:44:41,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 139 transitions, 386 flow [2025-02-08 05:44:41,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:41,534 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 324 flow [2025-02-08 05:44:41,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2025-02-08 05:44:41,535 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 3 predicate places. [2025-02-08 05:44:41,535 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 324 flow [2025-02-08 05:44:41,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:41,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:41,535 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] [2025-02-08 05:44:41,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:44:41,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:44:41,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:41,536 INFO L85 PathProgramCache]: Analyzing trace with hash -841691447, now seen corresponding path program 1 times [2025-02-08 05:44:41,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:41,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12633637] [2025-02-08 05:44:41,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:41,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:41,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:44:41,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:44:41,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:41,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:44:41,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:41,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12633637] [2025-02-08 05:44:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12633637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:41,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:41,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:44:41,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086360017] [2025-02-08 05:44:41,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:41,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:41,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:41,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:41,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:41,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-02-08 05:44:41,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:41,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:41,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-02-08 05:44:41,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:42,215 INFO L124 PetriNetUnfolderBase]: 640/3440 cut-off events. [2025-02-08 05:44:42,215 INFO L125 PetriNetUnfolderBase]: For 292/304 co-relation queries the response was YES. [2025-02-08 05:44:42,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4874 conditions, 3440 events. 640/3440 cut-off events. For 292/304 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 31105 event pairs, 147 based on Foata normal form. 3/2997 useless extension candidates. Maximal degree in co-relation 2772. Up to 401 conditions per place. [2025-02-08 05:44:42,244 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 33 selfloop transitions, 7 changer transitions 0/149 dead transitions. [2025-02-08 05:44:42,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 440 flow [2025-02-08 05:44:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:44:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 05:44:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2025-02-08 05:44:42,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8679802955665025 [2025-02-08 05:44:42,247 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 324 flow. Second operand 7 states and 881 transitions. [2025-02-08 05:44:42,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 440 flow [2025-02-08 05:44:42,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 149 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:42,252 INFO L231 Difference]: Finished difference. Result has 141 places, 133 transitions, 342 flow [2025-02-08 05:44:42,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=141, PETRI_TRANSITIONS=133} [2025-02-08 05:44:42,253 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 10 predicate places. [2025-02-08 05:44:42,254 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 342 flow [2025-02-08 05:44:42,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:42,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:42,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] [2025-02-08 05:44:42,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:44:42,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:44:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1207533609, now seen corresponding path program 1 times [2025-02-08 05:44:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221614093] [2025-02-08 05:44:42,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:42,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:44:42,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:44:42,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:42,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:44:42,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:42,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221614093] [2025-02-08 05:44:42,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221614093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:42,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:42,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:42,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929916149] [2025-02-08 05:44:42,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:42,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:42,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:42,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:42,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:42,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2025-02-08 05:44:42,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 133 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:42,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:42,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2025-02-08 05:44:42,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:43,067 INFO L124 PetriNetUnfolderBase]: 1661/6017 cut-off events. [2025-02-08 05:44:43,068 INFO L125 PetriNetUnfolderBase]: For 1158/1202 co-relation queries the response was YES. [2025-02-08 05:44:43,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9998 conditions, 6017 events. 1661/6017 cut-off events. For 1158/1202 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 60432 event pairs, 951 based on Foata normal form. 2/5317 useless extension candidates. Maximal degree in co-relation 9889. Up to 2039 conditions per place. [2025-02-08 05:44:43,124 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 28 selfloop transitions, 9 changer transitions 0/147 dead transitions. [2025-02-08 05:44:43,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 147 transitions, 459 flow [2025-02-08 05:44:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2025-02-08 05:44:43,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903448275862069 [2025-02-08 05:44:43,126 INFO L175 Difference]: Start difference. First operand has 141 places, 133 transitions, 342 flow. Second operand 3 states and 393 transitions. [2025-02-08 05:44:43,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 147 transitions, 459 flow [2025-02-08 05:44:43,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 147 transitions, 449 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 05:44:43,135 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 408 flow [2025-02-08 05:44:43,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2025-02-08 05:44:43,136 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 11 predicate places. [2025-02-08 05:44:43,136 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 408 flow [2025-02-08 05:44:43,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:43,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:43,136 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:44:43,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:44:43,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:44:43,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:43,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1147937191, now seen corresponding path program 1 times [2025-02-08 05:44:43,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:43,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712919616] [2025-02-08 05:44:43,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:43,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:44:43,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:44:43,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:43,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:43,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:44:43,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:44:43,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:44:43,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:43,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:43,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:44:43,187 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:44:43,188 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 05:44:43,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-02-08 05:44:43,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-02-08 05:44:43,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-02-08 05:44:43,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-02-08 05:44:43,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-02-08 05:44:43,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-02-08 05:44:43,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-02-08 05:44:43,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-02-08 05:44:43,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-02-08 05:44:43,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-02-08 05:44:43,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:44:43,189 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:44:43,190 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:44:43,190 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:44:43,231 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-02-08 05:44:43,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 181 transitions, 416 flow [2025-02-08 05:44:43,297 INFO L124 PetriNetUnfolderBase]: 20/657 cut-off events. [2025-02-08 05:44:43,298 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-08 05:44:43,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 657 events. 20/657 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2743 event pairs, 6 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 706. Up to 32 conditions per place. [2025-02-08 05:44:43,301 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 181 transitions, 416 flow [2025-02-08 05:44:43,303 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 144 transitions, 321 flow [2025-02-08 05:44:43,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:44:43,304 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;@72ac0b61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:44:43,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 05:44:43,310 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:44:43,310 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-02-08 05:44:43,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:44:43,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:43,310 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] [2025-02-08 05:44:43,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:44:43,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash -197839460, now seen corresponding path program 1 times [2025-02-08 05:44:43,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:43,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008106610] [2025-02-08 05:44:43,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:43,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:43,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:44:43,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:44:43,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:43,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:43,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:43,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008106610] [2025-02-08 05:44:43,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008106610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:43,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:43,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:43,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163690714] [2025-02-08 05:44:43,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:43,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:43,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:43,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:43,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:43,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 181 [2025-02-08 05:44:43,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 144 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:43,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:43,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 181 [2025-02-08 05:44:43,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:45,117 INFO L124 PetriNetUnfolderBase]: 4640/13687 cut-off events. [2025-02-08 05:44:45,118 INFO L125 PetriNetUnfolderBase]: For 903/903 co-relation queries the response was YES. [2025-02-08 05:44:45,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21098 conditions, 13687 events. 4640/13687 cut-off events. For 903/903 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 142616 event pairs, 2591 based on Foata normal form. 0/12582 useless extension candidates. Maximal degree in co-relation 4944. Up to 6402 conditions per place. [2025-02-08 05:44:45,218 INFO L140 encePairwiseOnDemand]: 175/181 looper letters, 57 selfloop transitions, 5 changer transitions 0/167 dead transitions. [2025-02-08 05:44:45,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 167 transitions, 491 flow [2025-02-08 05:44:45,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 867 transitions. [2025-02-08 05:44:45,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7983425414364641 [2025-02-08 05:44:45,224 INFO L175 Difference]: Start difference. First operand has 150 places, 144 transitions, 321 flow. Second operand 6 states and 867 transitions. [2025-02-08 05:44:45,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 167 transitions, 491 flow [2025-02-08 05:44:45,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 167 transitions, 487 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:45,229 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 325 flow [2025-02-08 05:44:45,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2025-02-08 05:44:45,231 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 2 predicate places. [2025-02-08 05:44:45,231 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 325 flow [2025-02-08 05:44:45,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:45,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:45,232 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] [2025-02-08 05:44:45,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:44:45,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:44:45,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:45,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1201933320, now seen corresponding path program 1 times [2025-02-08 05:44:45,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:45,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489466059] [2025-02-08 05:44:45,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:45,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:45,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:44:45,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:44:45,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:45,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:45,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:45,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489466059] [2025-02-08 05:44:45,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489466059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:45,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:45,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:44:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877556778] [2025-02-08 05:44:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:45,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:44:45,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:45,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:44:45,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:44:45,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2025-02-08 05:44:45,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:45,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:45,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2025-02-08 05:44:45,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:46,074 INFO L124 PetriNetUnfolderBase]: 1406/6341 cut-off events. [2025-02-08 05:44:46,074 INFO L125 PetriNetUnfolderBase]: For 782/782 co-relation queries the response was YES. [2025-02-08 05:44:46,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8798 conditions, 6341 events. 1406/6341 cut-off events. For 782/782 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 62331 event pairs, 529 based on Foata normal form. 1/5734 useless extension candidates. Maximal degree in co-relation 2746. Up to 1304 conditions per place. [2025-02-08 05:44:46,114 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 30 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2025-02-08 05:44:46,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 415 flow [2025-02-08 05:44:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:44:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:44:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2025-02-08 05:44:46,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8770718232044199 [2025-02-08 05:44:46,117 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 325 flow. Second operand 4 states and 635 transitions. [2025-02-08 05:44:46,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 154 transitions, 415 flow [2025-02-08 05:44:46,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 154 transitions, 405 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:46,120 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 331 flow [2025-02-08 05:44:46,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2025-02-08 05:44:46,121 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 1 predicate places. [2025-02-08 05:44:46,122 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 331 flow [2025-02-08 05:44:46,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:46,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:46,122 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] [2025-02-08 05:44:46,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:44:46,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:44:46,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2136798385, now seen corresponding path program 1 times [2025-02-08 05:44:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:46,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273553] [2025-02-08 05:44:46,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:46,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:44:46,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:44:46,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:46,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:46,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:46,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273553] [2025-02-08 05:44:46,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:46,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:46,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:46,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926326543] [2025-02-08 05:44:46,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:46,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:46,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:46,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:46,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:46,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-02-08 05:44:46,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:46,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:46,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-02-08 05:44:46,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:48,369 INFO L124 PetriNetUnfolderBase]: 7632/23898 cut-off events. [2025-02-08 05:44:48,369 INFO L125 PetriNetUnfolderBase]: For 2848/2936 co-relation queries the response was YES. [2025-02-08 05:44:48,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35893 conditions, 23898 events. 7632/23898 cut-off events. For 2848/2936 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 284620 event pairs, 4688 based on Foata normal form. 3/21137 useless extension candidates. Maximal degree in co-relation 35344. Up to 8983 conditions per place. [2025-02-08 05:44:48,546 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 36 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2025-02-08 05:44:48,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 162 transitions, 473 flow [2025-02-08 05:44:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2025-02-08 05:44:48,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8876611418047882 [2025-02-08 05:44:48,729 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 331 flow. Second operand 3 states and 482 transitions. [2025-02-08 05:44:48,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 162 transitions, 473 flow [2025-02-08 05:44:48,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 162 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:48,740 INFO L231 Difference]: Finished difference. Result has 153 places, 150 transitions, 379 flow [2025-02-08 05:44:48,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=153, PETRI_TRANSITIONS=150} [2025-02-08 05:44:48,741 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 3 predicate places. [2025-02-08 05:44:48,741 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 150 transitions, 379 flow [2025-02-08 05:44:48,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:48,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:48,742 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] [2025-02-08 05:44:48,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:44:48,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:44:48,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:48,742 INFO L85 PathProgramCache]: Analyzing trace with hash 18707661, now seen corresponding path program 1 times [2025-02-08 05:44:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:48,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673694888] [2025-02-08 05:44:48,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:48,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:48,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:44:48,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:44:48,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:48,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:44:48,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:48,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673694888] [2025-02-08 05:44:48,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673694888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:48,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:48,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:44:48,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137635135] [2025-02-08 05:44:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:48,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:48,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:48,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:48,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:48,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 181 [2025-02-08 05:44:48,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 150 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:48,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:48,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 181 [2025-02-08 05:44:48,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:50,662 INFO L124 PetriNetUnfolderBase]: 4543/18575 cut-off events. [2025-02-08 05:44:50,662 INFO L125 PetriNetUnfolderBase]: For 1933/2089 co-relation queries the response was YES. [2025-02-08 05:44:50,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27207 conditions, 18575 events. 4543/18575 cut-off events. For 1933/2089 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 225770 event pairs, 1506 based on Foata normal form. 3/15943 useless extension candidates. Maximal degree in co-relation 7600. Up to 2942 conditions per place. [2025-02-08 05:44:50,825 INFO L140 encePairwiseOnDemand]: 174/181 looper letters, 41 selfloop transitions, 7 changer transitions 0/172 dead transitions. [2025-02-08 05:44:50,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 172 transitions, 521 flow [2025-02-08 05:44:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:44:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 05:44:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1085 transitions. [2025-02-08 05:44:50,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.856353591160221 [2025-02-08 05:44:50,829 INFO L175 Difference]: Start difference. First operand has 153 places, 150 transitions, 379 flow. Second operand 7 states and 1085 transitions. [2025-02-08 05:44:50,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 172 transitions, 521 flow [2025-02-08 05:44:50,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 172 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:50,847 INFO L231 Difference]: Finished difference. Result has 160 places, 153 transitions, 401 flow [2025-02-08 05:44:50,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=160, PETRI_TRANSITIONS=153} [2025-02-08 05:44:50,848 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 10 predicate places. [2025-02-08 05:44:50,848 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 153 transitions, 401 flow [2025-02-08 05:44:50,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:50,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:50,849 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] [2025-02-08 05:44:50,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:44:50,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:44:50,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash -870043351, now seen corresponding path program 1 times [2025-02-08 05:44:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:50,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915925254] [2025-02-08 05:44:50,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:50,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:44:50,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:44:50,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:50,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:44:50,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:50,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915925254] [2025-02-08 05:44:50,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915925254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:50,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:50,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23987452] [2025-02-08 05:44:50,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:50,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:50,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:50,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:50,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:50,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-02-08 05:44:50,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 153 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:50,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:50,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-02-08 05:44:50,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:53,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L699-3-->L699-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][161], [72#threadENTRYtrue, 6#L685-2true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 149#L685-2true, Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 183#true, 182#true, 116#L699-1true, 180#true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2025-02-08 05:44:53,824 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2025-02-08 05:44:53,824 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-02-08 05:44:53,824 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-08 05:44:53,824 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-02-08 05:44:53,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L699-3-->L699-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][161], [6#L685-2true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 149#L685-2true, Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 183#true, 182#true, 116#L699-1true, 180#true, 48#L684true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2025-02-08 05:44:53,825 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-02-08 05:44:53,825 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-08 05:44:53,825 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-02-08 05:44:53,825 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-02-08 05:44:54,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L699-3-->L699-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][161], [111#L686true, 6#L685-2true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 149#L685-2true, Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 183#true, 182#true, 116#L699-1true, 180#true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2025-02-08 05:44:54,330 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-02-08 05:44:54,330 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-02-08 05:44:54,330 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-02-08 05:44:54,330 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-02-08 05:44:54,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L699-3-->L699-1: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][161], [47#L685-1true, 6#L685-2true, 210#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), Black: 201#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 149#L685-2true, Black: 205#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 116#L699-1true, 183#true, 182#true, 180#true, Black: 211#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 223#true, Black: 219#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 217#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~post7#1| 0))]) [2025-02-08 05:44:54,331 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2025-02-08 05:44:54,331 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-02-08 05:44:54,331 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-02-08 05:44:54,331 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2025-02-08 05:44:54,740 INFO L124 PetriNetUnfolderBase]: 13096/40137 cut-off events. [2025-02-08 05:44:54,740 INFO L125 PetriNetUnfolderBase]: For 9397/10150 co-relation queries the response was YES. [2025-02-08 05:44:54,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67560 conditions, 40137 events. 13096/40137 cut-off events. For 9397/10150 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 514809 event pairs, 6801 based on Foata normal form. 29/35212 useless extension candidates. Maximal degree in co-relation 66468. Up to 14649 conditions per place. [2025-02-08 05:44:55,056 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 38 selfloop transitions, 11 changer transitions 0/173 dead transitions. [2025-02-08 05:44:55,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 173 transitions, 568 flow [2025-02-08 05:44:55,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2025-02-08 05:44:55,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8858195211786372 [2025-02-08 05:44:55,059 INFO L175 Difference]: Start difference. First operand has 160 places, 153 transitions, 401 flow. Second operand 3 states and 481 transitions. [2025-02-08 05:44:55,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 173 transitions, 568 flow [2025-02-08 05:44:55,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 173 transitions, 558 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 05:44:55,085 INFO L231 Difference]: Finished difference. Result has 161 places, 162 transitions, 487 flow [2025-02-08 05:44:55,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=161, PETRI_TRANSITIONS=162} [2025-02-08 05:44:55,086 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 11 predicate places. [2025-02-08 05:44:55,086 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 162 transitions, 487 flow [2025-02-08 05:44:55,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:55,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:55,086 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-02-08 05:44:55,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:44:55,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:44:55,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:55,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1787432761, now seen corresponding path program 1 times [2025-02-08 05:44:55,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:55,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946803622] [2025-02-08 05:44:55,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:55,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:55,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:44:55,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:44:55,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:55,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:44:55,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:55,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946803622] [2025-02-08 05:44:55,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946803622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:55,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:55,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:44:55,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365070235] [2025-02-08 05:44:55,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:55,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:44:55,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:55,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:44:55,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:44:55,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 181 [2025-02-08 05:44:55,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 162 transitions, 487 flow. Second operand has 8 states, 8 states have (on average 149.625) internal successors, (1197), 8 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:55,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:55,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 181 [2025-02-08 05:44:55,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:58,180 INFO L124 PetriNetUnfolderBase]: 7011/27275 cut-off events. [2025-02-08 05:44:58,181 INFO L125 PetriNetUnfolderBase]: For 6400/14512 co-relation queries the response was YES. [2025-02-08 05:44:58,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44729 conditions, 27275 events. 7011/27275 cut-off events. For 6400/14512 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 351683 event pairs, 1470 based on Foata normal form. 31/23360 useless extension candidates. Maximal degree in co-relation 23973. Up to 3883 conditions per place. [2025-02-08 05:44:58,360 INFO L140 encePairwiseOnDemand]: 174/181 looper letters, 53 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2025-02-08 05:44:58,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 196 transitions, 685 flow [2025-02-08 05:44:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:44:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:44:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1544 transitions. [2025-02-08 05:44:58,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530386740331491 [2025-02-08 05:44:58,364 INFO L175 Difference]: Start difference. First operand has 161 places, 162 transitions, 487 flow. Second operand 10 states and 1544 transitions. [2025-02-08 05:44:58,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 196 transitions, 685 flow [2025-02-08 05:44:58,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 196 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:58,389 INFO L231 Difference]: Finished difference. Result has 171 places, 164 transitions, 505 flow [2025-02-08 05:44:58,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=505, PETRI_PLACES=171, PETRI_TRANSITIONS=164} [2025-02-08 05:44:58,390 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 21 predicate places. [2025-02-08 05:44:58,390 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 164 transitions, 505 flow [2025-02-08 05:44:58,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 149.625) internal successors, (1197), 8 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:58,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:58,391 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] [2025-02-08 05:44:58,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:44:58,391 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:44:58,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1848084301, now seen corresponding path program 1 times [2025-02-08 05:44:58,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:58,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033530944] [2025-02-08 05:44:58,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:58,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:58,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:44:58,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:44:58,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:58,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:44:58,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:58,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033530944] [2025-02-08 05:44:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033530944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:58,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:58,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:44:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960420087] [2025-02-08 05:44:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:58,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:58,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:58,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:58,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:58,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 181 [2025-02-08 05:44:58,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 164 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:58,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:58,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 181 [2025-02-08 05:44:58,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:59,048 INFO L124 PetriNetUnfolderBase]: 577/5856 cut-off events. [2025-02-08 05:44:59,048 INFO L125 PetriNetUnfolderBase]: For 1023/1269 co-relation queries the response was YES. [2025-02-08 05:44:59,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8283 conditions, 5856 events. 577/5856 cut-off events. For 1023/1269 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 63718 event pairs, 252 based on Foata normal form. 164/5330 useless extension candidates. Maximal degree in co-relation 4006. Up to 528 conditions per place. [2025-02-08 05:44:59,069 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 16 selfloop transitions, 8 changer transitions 0/162 dead transitions. [2025-02-08 05:44:59,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 162 transitions, 536 flow [2025-02-08 05:44:59,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-02-08 05:44:59,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134438305709024 [2025-02-08 05:44:59,070 INFO L175 Difference]: Start difference. First operand has 171 places, 164 transitions, 505 flow. Second operand 3 states and 496 transitions. [2025-02-08 05:44:59,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 162 transitions, 536 flow [2025-02-08 05:44:59,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 162 transitions, 510 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 05:44:59,079 INFO L231 Difference]: Finished difference. Result has 167 places, 155 transitions, 441 flow [2025-02-08 05:44:59,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=167, PETRI_TRANSITIONS=155} [2025-02-08 05:44:59,079 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 17 predicate places. [2025-02-08 05:44:59,080 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 155 transitions, 441 flow [2025-02-08 05:44:59,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:59,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:59,080 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:44:59,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:44:59,080 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:44:59,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:59,081 INFO L85 PathProgramCache]: Analyzing trace with hash 993265534, now seen corresponding path program 1 times [2025-02-08 05:44:59,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:59,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307062242] [2025-02-08 05:44:59,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:59,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:59,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:44:59,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:44:59,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:59,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:44:59,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:59,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307062242] [2025-02-08 05:44:59,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307062242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:59,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:59,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:59,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756972336] [2025-02-08 05:44:59,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:59,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:59,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:59,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:59,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:59,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 181 [2025-02-08 05:44:59,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 155 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:59,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:59,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 181 [2025-02-08 05:44:59,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:59,652 INFO L124 PetriNetUnfolderBase]: 1009/6373 cut-off events. [2025-02-08 05:44:59,653 INFO L125 PetriNetUnfolderBase]: For 2996/2996 co-relation queries the response was YES. [2025-02-08 05:44:59,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10918 conditions, 6373 events. 1009/6373 cut-off events. For 2996/2996 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 70573 event pairs, 785 based on Foata normal form. 0/5746 useless extension candidates. Maximal degree in co-relation 10619. Up to 1702 conditions per place. [2025-02-08 05:44:59,686 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 30 selfloop transitions, 4 changer transitions 0/162 dead transitions. [2025-02-08 05:44:59,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 535 flow [2025-02-08 05:44:59,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-02-08 05:44:59,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8674033149171271 [2025-02-08 05:44:59,688 INFO L175 Difference]: Start difference. First operand has 167 places, 155 transitions, 441 flow. Second operand 3 states and 471 transitions. [2025-02-08 05:44:59,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 535 flow [2025-02-08 05:44:59,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:44:59,694 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 467 flow [2025-02-08 05:44:59,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2025-02-08 05:44:59,694 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 20 predicate places. [2025-02-08 05:44:59,695 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 467 flow [2025-02-08 05:44:59,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:44:59,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:59,695 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:44:59,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:44:59,695 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:44:59,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:59,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1503198764, now seen corresponding path program 1 times [2025-02-08 05:44:59,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:59,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651816099] [2025-02-08 05:44:59,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:59,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:59,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:44:59,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:44:59,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:59,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:59,716 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:44:59,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:44:59,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:44:59,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:59,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:59,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:44:59,753 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:44:59,754 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 05:44:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-02-08 05:44:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-02-08 05:44:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-02-08 05:44:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-02-08 05:44:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 13 remaining) [2025-02-08 05:44:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-02-08 05:44:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-02-08 05:44:59,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-02-08 05:44:59,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-02-08 05:44:59,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-02-08 05:44:59,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-02-08 05:44:59,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-02-08 05:44:59,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:44:59,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:44:59,756 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:44:59,757 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:44:59,801 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-02-08 05:44:59,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 217 transitions, 514 flow [2025-02-08 05:44:59,930 INFO L124 PetriNetUnfolderBase]: 53/1140 cut-off events. [2025-02-08 05:44:59,930 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-02-08 05:44:59,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 1140 events. 53/1140 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5820 event pairs, 23 based on Foata normal form. 0/1020 useless extension candidates. Maximal degree in co-relation 1244. Up to 80 conditions per place. [2025-02-08 05:44:59,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 217 transitions, 514 flow [2025-02-08 05:44:59,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 162 transitions, 370 flow [2025-02-08 05:44:59,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:44:59,945 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;@72ac0b61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:44:59,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-08 05:44:59,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:44:59,949 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-02-08 05:44:59,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:44:59,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:59,949 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] [2025-02-08 05:44:59,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:44:59,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:59,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1440615012, now seen corresponding path program 1 times [2025-02-08 05:44:59,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:59,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003947670] [2025-02-08 05:44:59,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:59,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:44:59,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:44:59,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:59,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:45:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:45:00,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:45:00,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003947670] [2025-02-08 05:45:00,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003947670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:45:00,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:45:00,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:45:00,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035219298] [2025-02-08 05:45:00,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:45:00,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:45:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:45:00,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:45:00,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:45:00,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 217 [2025-02-08 05:45:00,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 162 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:45:00,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:45:00,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 217 [2025-02-08 05:45:00,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:45:06,453 INFO L124 PetriNetUnfolderBase]: 22557/56260 cut-off events. [2025-02-08 05:45:06,453 INFO L125 PetriNetUnfolderBase]: For 4409/4409 co-relation queries the response was YES. [2025-02-08 05:45:06,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89470 conditions, 56260 events. 22557/56260 cut-off events. For 4409/4409 co-relation queries the response was YES. Maximal size of possible extension queue 1517. Compared 671868 event pairs, 4473 based on Foata normal form. 0/51761 useless extension candidates. Maximal degree in co-relation 21203. Up to 29151 conditions per place. [2025-02-08 05:45:06,840 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 69 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2025-02-08 05:45:06,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 193 transitions, 580 flow [2025-02-08 05:45:06,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:45:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:45:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1047 transitions. [2025-02-08 05:45:06,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.804147465437788 [2025-02-08 05:45:06,843 INFO L175 Difference]: Start difference. First operand has 169 places, 162 transitions, 370 flow. Second operand 6 states and 1047 transitions. [2025-02-08 05:45:06,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 193 transitions, 580 flow [2025-02-08 05:45:06,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 193 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:45:06,851 INFO L231 Difference]: Finished difference. Result has 171 places, 161 transitions, 374 flow [2025-02-08 05:45:06,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=171, PETRI_TRANSITIONS=161} [2025-02-08 05:45:06,852 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 2 predicate places. [2025-02-08 05:45:06,852 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 161 transitions, 374 flow [2025-02-08 05:45:06,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:45:06,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:45:06,853 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] [2025-02-08 05:45:06,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:45:06,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:45:06,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:45:06,854 INFO L85 PathProgramCache]: Analyzing trace with hash 454414600, now seen corresponding path program 1 times [2025-02-08 05:45:06,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:45:06,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821869844] [2025-02-08 05:45:06,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:45:06,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:45:06,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:45:06,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:45:06,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:45:06,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:45:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:45:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:45:06,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821869844] [2025-02-08 05:45:06,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821869844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:45:06,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:45:06,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:45:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796493289] [2025-02-08 05:45:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:45:06,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:45:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:45:06,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:45:06,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:45:06,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 217 [2025-02-08 05:45:06,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 161 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:45:06,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:45:06,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 217 [2025-02-08 05:45:06,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:45:09,780 INFO L124 PetriNetUnfolderBase]: 6974/24532 cut-off events. [2025-02-08 05:45:09,780 INFO L125 PetriNetUnfolderBase]: For 4016/4016 co-relation queries the response was YES. [2025-02-08 05:45:09,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35624 conditions, 24532 events. 6974/24532 cut-off events. For 4016/4016 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 287650 event pairs, 3483 based on Foata normal form. 1/22342 useless extension candidates. Maximal degree in co-relation 19152. Up to 5916 conditions per place. [2025-02-08 05:45:09,934 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 36 selfloop transitions, 4 changer transitions 0/174 dead transitions. [2025-02-08 05:45:09,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 174 transitions, 480 flow [2025-02-08 05:45:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:45:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:45:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 753 transitions. [2025-02-08 05:45:09,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8675115207373272 [2025-02-08 05:45:09,936 INFO L175 Difference]: Start difference. First operand has 171 places, 161 transitions, 374 flow. Second operand 4 states and 753 transitions. [2025-02-08 05:45:09,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 174 transitions, 480 flow [2025-02-08 05:45:09,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 174 transitions, 470 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:45:09,940 INFO L231 Difference]: Finished difference. Result has 170 places, 162 transitions, 380 flow [2025-02-08 05:45:09,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=170, PETRI_TRANSITIONS=162} [2025-02-08 05:45:09,941 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 1 predicate places. [2025-02-08 05:45:09,941 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 162 transitions, 380 flow [2025-02-08 05:45:09,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:45:09,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:45:09,941 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] [2025-02-08 05:45:09,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:45:09,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:45:09,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:45:09,942 INFO L85 PathProgramCache]: Analyzing trace with hash 882556615, now seen corresponding path program 1 times [2025-02-08 05:45:09,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:45:09,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525381909] [2025-02-08 05:45:09,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:45:09,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:45:09,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:45:09,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:45:09,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:45:09,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:45:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:45:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:45:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525381909] [2025-02-08 05:45:09,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525381909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:45:09,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:45:09,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:45:09,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519516566] [2025-02-08 05:45:09,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:45:09,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:45:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:45:09,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:45:09,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:45:10,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 217 [2025-02-08 05:45:10,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 162 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:45:10,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:45:10,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 217 [2025-02-08 05:45:10,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand