./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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/weaver/chl-array-int-trans.wvr.c -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 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:54,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:54,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:29:54,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:54,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:54,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:54,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:54,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:54,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:54,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:54,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:54,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:54,959 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:54,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:54,960 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:54,960 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:54,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:54,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:54,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:54,961 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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2025-01-09 21:29:55,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:55,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:55,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:55,214 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:55,214 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:55,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-01-09 21:29:56,338 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/230fd7228/1bf7d6a882db40e890a575f26210069e/FLAG444589ee3 [2025-01-09 21:29:56,601 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:56,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-01-09 21:29:56,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/230fd7228/1bf7d6a882db40e890a575f26210069e/FLAG444589ee3 [2025-01-09 21:29:56,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/230fd7228/1bf7d6a882db40e890a575f26210069e [2025-01-09 21:29:56,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:56,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:56,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:56,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:56,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:56,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:56" (1/1) ... [2025-01-09 21:29:56,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e4d15bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:56, skipping insertion in model container [2025-01-09 21:29:56,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:56" (1/1) ... [2025-01-09 21:29:56,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:57,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:57,086 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:57,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:57,138 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:57,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57 WrapperNode [2025-01-09 21:29:57,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:57,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:57,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:57,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:57,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,190 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 472 [2025-01-09 21:29:57,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:57,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:57,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:57,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:57,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:57,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:57,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:57,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:57,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:57,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:57,288 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-01-09 21:29:57,290 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-01-09 21:29:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:29:57,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:29:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:29:57,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:29:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:29:57,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:29:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:29:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:29:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:57,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:29:57,307 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:29:57,386 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:57,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:57,952 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:57,952 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:57,976 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:57,976 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:29:57,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:57 BoogieIcfgContainer [2025-01-09 21:29:57,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:57,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:57,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:57,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:57,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:56" (1/3) ... [2025-01-09 21:29:57,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb1fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:57, skipping insertion in model container [2025-01-09 21:29:57,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (2/3) ... [2025-01-09 21:29:57,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb1fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:57, skipping insertion in model container [2025-01-09 21:29:57,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:57" (3/3) ... [2025-01-09 21:29:57,983 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-01-09 21:29:57,993 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:57,995 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 590 locations, 1 initial locations, 6 loop locations, and 57 error locations. [2025-01-09 21:29:57,995 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:58,229 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:29:58,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 599 places, 619 transitions, 1259 flow [2025-01-09 21:29:58,570 INFO L124 PetriNetUnfolderBase]: 30/616 cut-off events. [2025-01-09 21:29:58,573 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:29:58,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 616 events. 30/616 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1465 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 464. Up to 3 conditions per place. [2025-01-09 21:29:58,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 599 places, 619 transitions, 1259 flow [2025-01-09 21:29:58,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 595 transitions, 1208 flow [2025-01-09 21:29:58,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:58,620 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;@62ad73c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:58,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-01-09 21:29:58,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:58,632 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:29:58,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:58,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:58,633 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-01-09 21:29:58,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:29:58,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash -552519617, now seen corresponding path program 1 times [2025-01-09 21:29:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:58,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260981140] [2025-01-09 21:29:58,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:58,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:29:58,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:29:58,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:58,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:58,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:58,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260981140] [2025-01-09 21:29:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260981140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:58,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:58,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:58,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046187884] [2025-01-09 21:29:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:58,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:58,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:58,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:58,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:58,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 619 [2025-01-09 21:29:58,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 595 transitions, 1208 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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-01-09 21:29:58,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:58,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 619 [2025-01-09 21:29:58,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:59,114 INFO L124 PetriNetUnfolderBase]: 37/1035 cut-off events. [2025-01-09 21:29:59,115 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:29:59,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 1035 events. 37/1035 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4616 event pairs, 12 based on Foata normal form. 31/907 useless extension candidates. Maximal degree in co-relation 832. Up to 39 conditions per place. [2025-01-09 21:29:59,129 INFO L140 encePairwiseOnDemand]: 601/619 looper letters, 14 selfloop transitions, 2 changer transitions 6/579 dead transitions. [2025-01-09 21:29:59,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 579 transitions, 1208 flow [2025-01-09 21:29:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2025-01-09 21:29:59,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9606892837910609 [2025-01-09 21:29:59,151 INFO L175 Difference]: Start difference. First operand has 577 places, 595 transitions, 1208 flow. Second operand 3 states and 1784 transitions. [2025-01-09 21:29:59,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 579 transitions, 1208 flow [2025-01-09 21:29:59,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 579 transitions, 1196 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:29:59,169 INFO L231 Difference]: Finished difference. Result has 572 places, 573 transitions, 1156 flow [2025-01-09 21:29:59,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=572, PETRI_TRANSITIONS=573} [2025-01-09 21:29:59,176 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2025-01-09 21:29:59,177 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 573 transitions, 1156 flow [2025-01-09 21:29:59,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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-01-09 21:29:59,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:59,178 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] [2025-01-09 21:29:59,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:59,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:29:59,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1942969815, now seen corresponding path program 1 times [2025-01-09 21:29:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271307473] [2025-01-09 21:29:59,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:59,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:29:59,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:29:59,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:59,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271307473] [2025-01-09 21:29:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271307473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:59,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:59,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:59,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976119318] [2025-01-09 21:29:59,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:59,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:59,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:59,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:59,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:59,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 619 [2025-01-09 21:29:59,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 573 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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-01-09 21:29:59,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:59,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 619 [2025-01-09 21:29:59,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:59,533 INFO L124 PetriNetUnfolderBase]: 57/1460 cut-off events. [2025-01-09 21:29:59,533 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:29:59,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 1460 events. 57/1460 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8135 event pairs, 20 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 1496. Up to 51 conditions per place. [2025-01-09 21:29:59,557 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2025-01-09 21:29:59,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 572 transitions, 1186 flow [2025-01-09 21:29:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2025-01-09 21:29:59,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9526117393645666 [2025-01-09 21:29:59,590 INFO L175 Difference]: Start difference. First operand has 572 places, 573 transitions, 1156 flow. Second operand 3 states and 1769 transitions. [2025-01-09 21:29:59,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 572 transitions, 1186 flow [2025-01-09 21:29:59,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 572 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:59,598 INFO L231 Difference]: Finished difference. Result has 565 places, 572 transitions, 1154 flow [2025-01-09 21:29:59,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=565, PETRI_TRANSITIONS=572} [2025-01-09 21:29:59,599 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -12 predicate places. [2025-01-09 21:29:59,599 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 572 transitions, 1154 flow [2025-01-09 21:29:59,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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-01-09 21:29:59,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:59,600 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] [2025-01-09 21:29:59,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:59,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:29:59,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:59,602 INFO L85 PathProgramCache]: Analyzing trace with hash -986139628, now seen corresponding path program 1 times [2025-01-09 21:29:59,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:59,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939375787] [2025-01-09 21:29:59,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:59,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:29:59,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:29:59,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:59,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:59,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:59,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939375787] [2025-01-09 21:29:59,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939375787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:59,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:59,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:59,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378972168] [2025-01-09 21:29:59,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:59,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:59,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:59,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:59,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:59,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 619 [2025-01-09 21:29:59,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 572 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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-01-09 21:29:59,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:59,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 619 [2025-01-09 21:29:59,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:59,971 INFO L124 PetriNetUnfolderBase]: 57/1447 cut-off events. [2025-01-09 21:29:59,971 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2025-01-09 21:29:59,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1447 events. 57/1447 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7708 event pairs, 20 based on Foata normal form. 0/1225 useless extension candidates. Maximal degree in co-relation 1467. Up to 51 conditions per place. [2025-01-09 21:29:59,988 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 14 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2025-01-09 21:29:59,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 571 transitions, 1184 flow [2025-01-09 21:29:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2025-01-09 21:29:59,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9526117393645666 [2025-01-09 21:29:59,994 INFO L175 Difference]: Start difference. First operand has 565 places, 572 transitions, 1154 flow. Second operand 3 states and 1769 transitions. [2025-01-09 21:29:59,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 571 transitions, 1184 flow [2025-01-09 21:29:59,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 571 transitions, 1180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:00,001 INFO L231 Difference]: Finished difference. Result has 564 places, 571 transitions, 1152 flow [2025-01-09 21:30:00,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1152, PETRI_PLACES=564, PETRI_TRANSITIONS=571} [2025-01-09 21:30:00,003 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -13 predicate places. [2025-01-09 21:30:00,003 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 571 transitions, 1152 flow [2025-01-09 21:30:00,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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-01-09 21:30:00,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:00,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:00,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:00,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:00,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1427609466, now seen corresponding path program 1 times [2025-01-09 21:30:00,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:00,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166545355] [2025-01-09 21:30:00,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:00,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:30:00,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:30:00,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:00,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:00,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166545355] [2025-01-09 21:30:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166545355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:00,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968980076] [2025-01-09 21:30:00,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:00,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:00,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:00,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:00,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:00,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 619 [2025-01-09 21:30:00,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 571 transitions, 1152 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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-01-09 21:30:00,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:00,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 619 [2025-01-09 21:30:00,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:00,319 INFO L124 PetriNetUnfolderBase]: 69/1462 cut-off events. [2025-01-09 21:30:00,319 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:30:00,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1462 events. 69/1462 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8297 event pairs, 32 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1509. Up to 80 conditions per place. [2025-01-09 21:30:00,338 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 16 selfloop transitions, 1 changer transitions 0/566 dead transitions. [2025-01-09 21:30:00,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 566 transitions, 1176 flow [2025-01-09 21:30:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2025-01-09 21:30:00,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488422186322025 [2025-01-09 21:30:00,341 INFO L175 Difference]: Start difference. First operand has 564 places, 571 transitions, 1152 flow. Second operand 3 states and 1762 transitions. [2025-01-09 21:30:00,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 566 transitions, 1176 flow [2025-01-09 21:30:00,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 566 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:00,350 INFO L231 Difference]: Finished difference. Result has 559 places, 566 transitions, 1140 flow [2025-01-09 21:30:00,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=559, PETRI_TRANSITIONS=566} [2025-01-09 21:30:00,352 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -18 predicate places. [2025-01-09 21:30:00,352 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 566 transitions, 1140 flow [2025-01-09 21:30:00,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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-01-09 21:30:00,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:00,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:00,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:00,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:00,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:00,355 INFO L85 PathProgramCache]: Analyzing trace with hash -326081107, now seen corresponding path program 1 times [2025-01-09 21:30:00,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:00,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653181497] [2025-01-09 21:30:00,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:00,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:00,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:30:00,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:30:00,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:00,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:00,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:00,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653181497] [2025-01-09 21:30:00,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653181497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:00,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:00,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:00,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653483243] [2025-01-09 21:30:00,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:00,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:00,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:00,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:00,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:00,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 619 [2025-01-09 21:30:00,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 566 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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-01-09 21:30:00,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:00,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 619 [2025-01-09 21:30:00,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:00,599 INFO L124 PetriNetUnfolderBase]: 37/1043 cut-off events. [2025-01-09 21:30:00,599 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-01-09 21:30:00,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 1043 events. 37/1043 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4525 event pairs, 12 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1043. Up to 38 conditions per place. [2025-01-09 21:30:00,609 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 13 selfloop transitions, 2 changer transitions 0/565 dead transitions. [2025-01-09 21:30:00,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 565 transitions, 1168 flow [2025-01-09 21:30:00,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2025-01-09 21:30:00,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536887452880991 [2025-01-09 21:30:00,613 INFO L175 Difference]: Start difference. First operand has 559 places, 566 transitions, 1140 flow. Second operand 3 states and 1771 transitions. [2025-01-09 21:30:00,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 565 transitions, 1168 flow [2025-01-09 21:30:00,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 565 transitions, 1167 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:00,618 INFO L231 Difference]: Finished difference. Result has 559 places, 565 transitions, 1141 flow [2025-01-09 21:30:00,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1141, PETRI_PLACES=559, PETRI_TRANSITIONS=565} [2025-01-09 21:30:00,620 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -18 predicate places. [2025-01-09 21:30:00,620 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 565 transitions, 1141 flow [2025-01-09 21:30:00,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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-01-09 21:30:00,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:00,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:00,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:00,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:00,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:00,622 INFO L85 PathProgramCache]: Analyzing trace with hash -177534328, now seen corresponding path program 1 times [2025-01-09 21:30:00,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:00,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223708262] [2025-01-09 21:30:00,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:00,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:30:00,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:30:00,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:00,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:01,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:01,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223708262] [2025-01-09 21:30:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223708262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:01,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:01,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049192290] [2025-01-09 21:30:01,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:01,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:01,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:01,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:01,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:01,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 506 out of 619 [2025-01-09 21:30:01,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 565 transitions, 1141 flow. Second operand has 6 states, 6 states have (on average 507.5) internal successors, (3045), 6 states have internal predecessors, (3045), 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-01-09 21:30:01,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:01,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 506 of 619 [2025-01-09 21:30:01,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:08,123 INFO L124 PetriNetUnfolderBase]: 12108/56240 cut-off events. [2025-01-09 21:30:08,123 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2025-01-09 21:30:08,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73723 conditions, 56240 events. 12108/56240 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 785813 event pairs, 10080 based on Foata normal form. 0/49040 useless extension candidates. Maximal degree in co-relation 73674. Up to 17156 conditions per place. [2025-01-09 21:30:08,593 INFO L140 encePairwiseOnDemand]: 601/619 looper letters, 78 selfloop transitions, 15 changer transitions 0/562 dead transitions. [2025-01-09 21:30:08,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1321 flow [2025-01-09 21:30:08,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3132 transitions. [2025-01-09 21:30:08,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8432956381260097 [2025-01-09 21:30:08,599 INFO L175 Difference]: Start difference. First operand has 559 places, 565 transitions, 1141 flow. Second operand 6 states and 3132 transitions. [2025-01-09 21:30:08,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1321 flow [2025-01-09 21:30:08,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 562 transitions, 1317 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:08,605 INFO L231 Difference]: Finished difference. Result has 559 places, 562 transitions, 1161 flow [2025-01-09 21:30:08,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1161, PETRI_PLACES=559, PETRI_TRANSITIONS=562} [2025-01-09 21:30:08,608 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -18 predicate places. [2025-01-09 21:30:08,608 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 562 transitions, 1161 flow [2025-01-09 21:30:08,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 507.5) internal successors, (3045), 6 states have internal predecessors, (3045), 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-01-09 21:30:08,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:08,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:08,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:08,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:08,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1083893247, now seen corresponding path program 1 times [2025-01-09 21:30:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:08,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826737835] [2025-01-09 21:30:08,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:08,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:30:08,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:30:08,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:08,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:08,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:08,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826737835] [2025-01-09 21:30:08,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826737835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:08,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:08,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:08,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724505271] [2025-01-09 21:30:08,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:08,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:08,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:08,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:08,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:08,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 619 [2025-01-09 21:30:08,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 562 transitions, 1161 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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-01-09 21:30:08,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:08,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 619 [2025-01-09 21:30:08,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:08,904 INFO L124 PetriNetUnfolderBase]: 137/2474 cut-off events. [2025-01-09 21:30:08,904 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:30:08,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 2474 events. 137/2474 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 18341 event pairs, 64 based on Foata normal form. 0/2120 useless extension candidates. Maximal degree in co-relation 2618. Up to 141 conditions per place. [2025-01-09 21:30:08,939 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 16 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2025-01-09 21:30:08,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 557 transitions, 1185 flow [2025-01-09 21:30:08,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2025-01-09 21:30:08,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488422186322025 [2025-01-09 21:30:08,943 INFO L175 Difference]: Start difference. First operand has 559 places, 562 transitions, 1161 flow. Second operand 3 states and 1762 transitions. [2025-01-09 21:30:08,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 557 transitions, 1185 flow [2025-01-09 21:30:08,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 557 transitions, 1155 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:08,950 INFO L231 Difference]: Finished difference. Result has 551 places, 557 transitions, 1123 flow [2025-01-09 21:30:08,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=551, PETRI_TRANSITIONS=557} [2025-01-09 21:30:08,951 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -26 predicate places. [2025-01-09 21:30:08,952 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 557 transitions, 1123 flow [2025-01-09 21:30:08,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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-01-09 21:30:08,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:08,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:08,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:08,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash 826762947, now seen corresponding path program 1 times [2025-01-09 21:30:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:08,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482052415] [2025-01-09 21:30:08,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:08,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:08,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:30:08,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:30:08,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:08,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:09,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:09,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482052415] [2025-01-09 21:30:09,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482052415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:09,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:09,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:09,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747920723] [2025-01-09 21:30:09,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:09,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:09,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:09,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:09,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:09,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 619 [2025-01-09 21:30:09,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 557 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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-01-09 21:30:09,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:09,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 619 [2025-01-09 21:30:09,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:09,247 INFO L124 PetriNetUnfolderBase]: 63/1714 cut-off events. [2025-01-09 21:30:09,248 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-01-09 21:30:09,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 1714 events. 63/1714 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 9438 event pairs, 20 based on Foata normal form. 0/1476 useless extension candidates. Maximal degree in co-relation 1733. Up to 50 conditions per place. [2025-01-09 21:30:09,258 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 13 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2025-01-09 21:30:09,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 556 transitions, 1151 flow [2025-01-09 21:30:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2025-01-09 21:30:09,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536887452880991 [2025-01-09 21:30:09,260 INFO L175 Difference]: Start difference. First operand has 551 places, 557 transitions, 1123 flow. Second operand 3 states and 1771 transitions. [2025-01-09 21:30:09,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 556 transitions, 1151 flow [2025-01-09 21:30:09,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 556 transitions, 1150 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:09,266 INFO L231 Difference]: Finished difference. Result has 551 places, 556 transitions, 1124 flow [2025-01-09 21:30:09,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=551, PETRI_TRANSITIONS=556} [2025-01-09 21:30:09,268 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -26 predicate places. [2025-01-09 21:30:09,268 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 556 transitions, 1124 flow [2025-01-09 21:30:09,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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-01-09 21:30:09,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:09,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:09,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:09,270 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:09,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash -530719267, now seen corresponding path program 1 times [2025-01-09 21:30:09,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:09,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73146362] [2025-01-09 21:30:09,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:09,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:30:09,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:30:09,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:09,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:09,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:09,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73146362] [2025-01-09 21:30:09,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73146362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:09,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:09,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:09,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242831932] [2025-01-09 21:30:09,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:09,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:09,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:09,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:09,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 619 [2025-01-09 21:30:09,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 556 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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-01-09 21:30:09,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:09,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 619 [2025-01-09 21:30:09,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:09,588 INFO L124 PetriNetUnfolderBase]: 137/2434 cut-off events. [2025-01-09 21:30:09,589 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2025-01-09 21:30:09,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 2434 events. 137/2434 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17625 event pairs, 64 based on Foata normal form. 0/2104 useless extension candidates. Maximal degree in co-relation 2540. Up to 141 conditions per place. [2025-01-09 21:30:09,624 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 16 selfloop transitions, 1 changer transitions 0/551 dead transitions. [2025-01-09 21:30:09,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 551 transitions, 1148 flow [2025-01-09 21:30:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2025-01-09 21:30:09,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488422186322025 [2025-01-09 21:30:09,628 INFO L175 Difference]: Start difference. First operand has 551 places, 556 transitions, 1124 flow. Second operand 3 states and 1762 transitions. [2025-01-09 21:30:09,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 551 transitions, 1148 flow [2025-01-09 21:30:09,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 551 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:09,634 INFO L231 Difference]: Finished difference. Result has 546 places, 551 transitions, 1112 flow [2025-01-09 21:30:09,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1112, PETRI_PLACES=546, PETRI_TRANSITIONS=551} [2025-01-09 21:30:09,636 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2025-01-09 21:30:09,636 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 551 transitions, 1112 flow [2025-01-09 21:30:09,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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-01-09 21:30:09,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:09,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:09,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:09,638 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:09,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash 444686428, now seen corresponding path program 1 times [2025-01-09 21:30:09,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:09,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775004568] [2025-01-09 21:30:09,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:09,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:09,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:30:09,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:30:09,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:09,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:09,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:09,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775004568] [2025-01-09 21:30:09,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775004568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:09,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:09,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:09,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238669425] [2025-01-09 21:30:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:09,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:09,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:09,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:09,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:09,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 619 [2025-01-09 21:30:09,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 551 transitions, 1112 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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-01-09 21:30:09,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:09,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 619 [2025-01-09 21:30:09,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:09,784 INFO L124 PetriNetUnfolderBase]: 39/802 cut-off events. [2025-01-09 21:30:09,785 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-01-09 21:30:09,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 802 events. 39/802 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2960 event pairs, 20 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 814. Up to 50 conditions per place. [2025-01-09 21:30:09,794 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 13 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-01-09 21:30:09,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 550 transitions, 1140 flow [2025-01-09 21:30:09,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2025-01-09 21:30:09,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536887452880991 [2025-01-09 21:30:09,797 INFO L175 Difference]: Start difference. First operand has 546 places, 551 transitions, 1112 flow. Second operand 3 states and 1771 transitions. [2025-01-09 21:30:09,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 550 transitions, 1140 flow [2025-01-09 21:30:09,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 550 transitions, 1139 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:09,802 INFO L231 Difference]: Finished difference. Result has 546 places, 550 transitions, 1113 flow [2025-01-09 21:30:09,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1113, PETRI_PLACES=546, PETRI_TRANSITIONS=550} [2025-01-09 21:30:09,803 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2025-01-09 21:30:09,803 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 550 transitions, 1113 flow [2025-01-09 21:30:09,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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-01-09 21:30:09,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:09,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:09,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:09,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:09,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 531514954, now seen corresponding path program 1 times [2025-01-09 21:30:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:09,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740060987] [2025-01-09 21:30:09,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:09,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:30:09,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:30:09,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:09,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:09,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:09,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740060987] [2025-01-09 21:30:09,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740060987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:09,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:09,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13539797] [2025-01-09 21:30:09,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:09,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:09,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:09,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:09,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-01-09 21:30:09,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 550 transitions, 1113 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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-01-09 21:30:09,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:09,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-01-09 21:30:09,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:09,945 INFO L124 PetriNetUnfolderBase]: 35/982 cut-off events. [2025-01-09 21:30:09,945 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:30:09,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 982 events. 35/982 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4292 event pairs, 6 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 986. Up to 23 conditions per place. [2025-01-09 21:30:09,955 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 12 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2025-01-09 21:30:09,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 551 transitions, 1145 flow [2025-01-09 21:30:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-01-09 21:30:09,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-01-09 21:30:09,959 INFO L175 Difference]: Start difference. First operand has 546 places, 550 transitions, 1113 flow. Second operand 3 states and 1782 transitions. [2025-01-09 21:30:09,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 551 transitions, 1145 flow [2025-01-09 21:30:09,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 551 transitions, 1141 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:09,964 INFO L231 Difference]: Finished difference. Result has 545 places, 549 transitions, 1111 flow [2025-01-09 21:30:09,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1111, PETRI_PLACES=545, PETRI_TRANSITIONS=549} [2025-01-09 21:30:09,965 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -32 predicate places. [2025-01-09 21:30:09,965 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 549 transitions, 1111 flow [2025-01-09 21:30:09,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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-01-09 21:30:09,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:09,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:09,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:09,967 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:09,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1266204625, now seen corresponding path program 1 times [2025-01-09 21:30:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462129385] [2025-01-09 21:30:09,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:09,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:30:09,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:30:09,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:09,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:10,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-01-09 21:30:10,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462129385] [2025-01-09 21:30:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462129385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:10,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:10,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:10,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104498418] [2025-01-09 21:30:10,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:10,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:10,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:10,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:10,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-01-09 21:30:10,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 549 transitions, 1111 flow. Second operand has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 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-01-09 21:30:10,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:10,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-01-09 21:30:10,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:10,124 INFO L124 PetriNetUnfolderBase]: 32/868 cut-off events. [2025-01-09 21:30:10,125 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-01-09 21:30:10,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 868 events. 32/868 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3357 event pairs, 6 based on Foata normal form. 1/776 useless extension candidates. Maximal degree in co-relation 867. Up to 23 conditions per place. [2025-01-09 21:30:10,137 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-01-09 21:30:10,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 550 transitions, 1143 flow [2025-01-09 21:30:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-01-09 21:30:10,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-01-09 21:30:10,140 INFO L175 Difference]: Start difference. First operand has 545 places, 549 transitions, 1111 flow. Second operand 3 states and 1782 transitions. [2025-01-09 21:30:10,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 550 transitions, 1143 flow [2025-01-09 21:30:10,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 550 transitions, 1139 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:10,145 INFO L231 Difference]: Finished difference. Result has 544 places, 548 transitions, 1109 flow [2025-01-09 21:30:10,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=544, PETRI_TRANSITIONS=548} [2025-01-09 21:30:10,147 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2025-01-09 21:30:10,148 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 548 transitions, 1109 flow [2025-01-09 21:30:10,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 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-01-09 21:30:10,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:10,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:10,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:10,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash -476909315, now seen corresponding path program 1 times [2025-01-09 21:30:10,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:10,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060586140] [2025-01-09 21:30:10,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:10,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:30:10,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:30:10,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:10,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:10,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:10,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060586140] [2025-01-09 21:30:10,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060586140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:10,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:10,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:10,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305471994] [2025-01-09 21:30:10,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:10,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:10,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:10,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:10,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:10,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 619 [2025-01-09 21:30:10,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 548 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 589.6666666666666) internal successors, (1769), 3 states have internal predecessors, (1769), 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-01-09 21:30:10,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:10,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 619 [2025-01-09 21:30:10,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:10,298 INFO L124 PetriNetUnfolderBase]: 41/983 cut-off events. [2025-01-09 21:30:10,298 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2025-01-09 21:30:10,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 983 events. 41/983 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4227 event pairs, 12 based on Foata normal form. 1/872 useless extension candidates. Maximal degree in co-relation 1014. Up to 39 conditions per place. [2025-01-09 21:30:10,306 INFO L140 encePairwiseOnDemand]: 615/619 looper letters, 14 selfloop transitions, 3 changer transitions 0/551 dead transitions. [2025-01-09 21:30:10,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 551 transitions, 1151 flow [2025-01-09 21:30:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-01-09 21:30:10,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-01-09 21:30:10,310 INFO L175 Difference]: Start difference. First operand has 544 places, 548 transitions, 1109 flow. Second operand 3 states and 1782 transitions. [2025-01-09 21:30:10,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 551 transitions, 1151 flow [2025-01-09 21:30:10,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 551 transitions, 1147 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:10,318 INFO L231 Difference]: Finished difference. Result has 546 places, 549 transitions, 1123 flow [2025-01-09 21:30:10,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=546, PETRI_TRANSITIONS=549} [2025-01-09 21:30:10,319 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2025-01-09 21:30:10,319 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 549 transitions, 1123 flow [2025-01-09 21:30:10,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.6666666666666) internal successors, (1769), 3 states have internal predecessors, (1769), 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-01-09 21:30:10,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:10,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:10,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:10,321 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:10,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:10,321 INFO L85 PathProgramCache]: Analyzing trace with hash -654014583, now seen corresponding path program 1 times [2025-01-09 21:30:10,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:10,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278496138] [2025-01-09 21:30:10,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:10,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:10,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 21:30:10,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 21:30:10,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:10,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:10,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:10,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278496138] [2025-01-09 21:30:10,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278496138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:10,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:10,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:10,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575343514] [2025-01-09 21:30:10,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:10,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:10,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:10,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:10,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:10,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-01-09 21:30:10,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 549 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 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-01-09 21:30:10,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:10,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-01-09 21:30:10,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:10,477 INFO L124 PetriNetUnfolderBase]: 29/758 cut-off events. [2025-01-09 21:30:10,477 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2025-01-09 21:30:10,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 758 events. 29/758 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2522 event pairs, 6 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 758. Up to 23 conditions per place. [2025-01-09 21:30:10,483 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-01-09 21:30:10,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 550 transitions, 1155 flow [2025-01-09 21:30:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-01-09 21:30:10,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-01-09 21:30:10,486 INFO L175 Difference]: Start difference. First operand has 546 places, 549 transitions, 1123 flow. Second operand 3 states and 1782 transitions. [2025-01-09 21:30:10,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 550 transitions, 1155 flow [2025-01-09 21:30:10,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 550 transitions, 1149 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:10,492 INFO L231 Difference]: Finished difference. Result has 545 places, 548 transitions, 1119 flow [2025-01-09 21:30:10,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1119, PETRI_PLACES=545, PETRI_TRANSITIONS=548} [2025-01-09 21:30:10,494 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -32 predicate places. [2025-01-09 21:30:10,494 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 548 transitions, 1119 flow [2025-01-09 21:30:10,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 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-01-09 21:30:10,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:10,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:10,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:10,495 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:10,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1782653657, now seen corresponding path program 1 times [2025-01-09 21:30:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:10,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533091645] [2025-01-09 21:30:10,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:10,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:10,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 21:30:10,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 21:30:10,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:10,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533091645] [2025-01-09 21:30:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533091645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:10,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944505370] [2025-01-09 21:30:10,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:10,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:10,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:10,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:10,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 619 [2025-01-09 21:30:10,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 548 transitions, 1119 flow. Second operand has 3 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 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-01-09 21:30:10,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:10,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 619 [2025-01-09 21:30:10,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:10,728 INFO L124 PetriNetUnfolderBase]: 86/1557 cut-off events. [2025-01-09 21:30:10,728 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2025-01-09 21:30:10,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 1557 events. 86/1557 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8975 event pairs, 12 based on Foata normal form. 0/1385 useless extension candidates. Maximal degree in co-relation 1658. Up to 99 conditions per place. [2025-01-09 21:30:10,750 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 20 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2025-01-09 21:30:10,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 551 transitions, 1174 flow [2025-01-09 21:30:10,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1775 transitions. [2025-01-09 21:30:10,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558427571351642 [2025-01-09 21:30:10,753 INFO L175 Difference]: Start difference. First operand has 545 places, 548 transitions, 1119 flow. Second operand 3 states and 1775 transitions. [2025-01-09 21:30:10,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 551 transitions, 1174 flow [2025-01-09 21:30:10,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 551 transitions, 1170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:10,759 INFO L231 Difference]: Finished difference. Result has 542 places, 546 transitions, 1121 flow [2025-01-09 21:30:10,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=542, PETRI_TRANSITIONS=546} [2025-01-09 21:30:10,761 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -35 predicate places. [2025-01-09 21:30:10,761 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 546 transitions, 1121 flow [2025-01-09 21:30:10,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 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-01-09 21:30:10,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:10,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:10,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:10,762 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:10,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1219180983, now seen corresponding path program 1 times [2025-01-09 21:30:10,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:10,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366564498] [2025-01-09 21:30:10,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:10,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:10,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 21:30:10,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 21:30:10,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:10,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:10,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:10,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366564498] [2025-01-09 21:30:10,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366564498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:10,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:10,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:10,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550477503] [2025-01-09 21:30:10,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:10,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:10,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:10,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:10,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:10,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 619 [2025-01-09 21:30:10,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 546 transitions, 1121 flow. Second operand has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 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-01-09 21:30:10,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:10,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 619 [2025-01-09 21:30:10,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:10,972 INFO L124 PetriNetUnfolderBase]: 65/1229 cut-off events. [2025-01-09 21:30:10,972 INFO L125 PetriNetUnfolderBase]: For 22/85 co-relation queries the response was YES. [2025-01-09 21:30:10,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1229 events. 65/1229 cut-off events. For 22/85 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6362 event pairs, 18 based on Foata normal form. 2/1092 useless extension candidates. Maximal degree in co-relation 1298. Up to 57 conditions per place. [2025-01-09 21:30:10,994 INFO L140 encePairwiseOnDemand]: 615/619 looper letters, 14 selfloop transitions, 3 changer transitions 0/549 dead transitions. [2025-01-09 21:30:10,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 549 transitions, 1163 flow [2025-01-09 21:30:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-01-09 21:30:10,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-01-09 21:30:10,997 INFO L175 Difference]: Start difference. First operand has 542 places, 546 transitions, 1121 flow. Second operand 3 states and 1782 transitions. [2025-01-09 21:30:10,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 549 transitions, 1163 flow [2025-01-09 21:30:11,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 549 transitions, 1163 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:11,003 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1139 flow [2025-01-09 21:30:11,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2025-01-09 21:30:11,004 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2025-01-09 21:30:11,005 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1139 flow [2025-01-09 21:30:11,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 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-01-09 21:30:11,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:11,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:11,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:11,006 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:11,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash -740853728, now seen corresponding path program 1 times [2025-01-09 21:30:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593559164] [2025-01-09 21:30:11,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:11,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 21:30:11,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 21:30:11,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:11,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:11,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:11,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593559164] [2025-01-09 21:30:11,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593559164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:11,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:11,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:11,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027971456] [2025-01-09 21:30:11,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:11,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:11,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:11,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:11,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 619 [2025-01-09 21:30:11,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 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-01-09 21:30:11,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:11,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 619 [2025-01-09 21:30:11,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:11,360 INFO L124 PetriNetUnfolderBase]: 157/2691 cut-off events. [2025-01-09 21:30:11,361 INFO L125 PetriNetUnfolderBase]: For 27/41 co-relation queries the response was YES. [2025-01-09 21:30:11,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3027 conditions, 2691 events. 157/2691 cut-off events. For 27/41 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 19479 event pairs, 31 based on Foata normal form. 1/2408 useless extension candidates. Maximal degree in co-relation 2975. Up to 161 conditions per place. [2025-01-09 21:30:11,414 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 20 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-01-09 21:30:11,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 550 transitions, 1194 flow [2025-01-09 21:30:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1775 transitions. [2025-01-09 21:30:11,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558427571351642 [2025-01-09 21:30:11,418 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1139 flow. Second operand 3 states and 1775 transitions. [2025-01-09 21:30:11,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 550 transitions, 1194 flow [2025-01-09 21:30:11,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 550 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:11,425 INFO L231 Difference]: Finished difference. Result has 543 places, 545 transitions, 1139 flow [2025-01-09 21:30:11,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=543, PETRI_TRANSITIONS=545} [2025-01-09 21:30:11,426 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -34 predicate places. [2025-01-09 21:30:11,426 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 545 transitions, 1139 flow [2025-01-09 21:30:11,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 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-01-09 21:30:11,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:11,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:11,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:30:11,431 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:11,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash 827254397, now seen corresponding path program 1 times [2025-01-09 21:30:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:11,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148007794] [2025-01-09 21:30:11,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:11,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 21:30:11,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 21:30:11,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:11,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148007794] [2025-01-09 21:30:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148007794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:11,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:11,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374031458] [2025-01-09 21:30:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:11,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:11,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:11,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:12,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-01-09 21:30:12,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 545 transitions, 1139 flow. Second operand has 8 states, 8 states have (on average 561.125) internal successors, (4489), 8 states have internal predecessors, (4489), 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-01-09 21:30:12,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:12,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-01-09 21:30:12,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:12,518 INFO L124 PetriNetUnfolderBase]: 124/1863 cut-off events. [2025-01-09 21:30:12,518 INFO L125 PetriNetUnfolderBase]: For 10/60 co-relation queries the response was YES. [2025-01-09 21:30:12,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 1863 events. 124/1863 cut-off events. For 10/60 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 11037 event pairs, 45 based on Foata normal form. 7/1718 useless extension candidates. Maximal degree in co-relation 2268. Up to 186 conditions per place. [2025-01-09 21:30:12,551 INFO L140 encePairwiseOnDemand]: 605/619 looper letters, 69 selfloop transitions, 15 changer transitions 0/583 dead transitions. [2025-01-09 21:30:12,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 583 transitions, 1399 flow [2025-01-09 21:30:12,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6211 transitions. [2025-01-09 21:30:12,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9121750624173888 [2025-01-09 21:30:12,561 INFO L175 Difference]: Start difference. First operand has 543 places, 545 transitions, 1139 flow. Second operand 11 states and 6211 transitions. [2025-01-09 21:30:12,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 583 transitions, 1399 flow [2025-01-09 21:30:12,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 583 transitions, 1399 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:12,570 INFO L231 Difference]: Finished difference. Result has 558 places, 553 transitions, 1215 flow [2025-01-09 21:30:12,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1215, PETRI_PLACES=558, PETRI_TRANSITIONS=553} [2025-01-09 21:30:12,571 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -19 predicate places. [2025-01-09 21:30:12,571 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 553 transitions, 1215 flow [2025-01-09 21:30:12,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.125) internal successors, (4489), 8 states have internal predecessors, (4489), 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-01-09 21:30:12,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:12,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:12,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:12,572 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:12,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2058603940, now seen corresponding path program 1 times [2025-01-09 21:30:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:12,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424666475] [2025-01-09 21:30:12,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:12,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:12,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 21:30:12,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 21:30:12,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:12,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:12,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:12,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424666475] [2025-01-09 21:30:12,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424666475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:12,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:12,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:12,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344301880] [2025-01-09 21:30:12,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:12,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:12,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:12,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:12,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:13,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-01-09 21:30:13,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 553 transitions, 1215 flow. Second operand has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 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-01-09 21:30:13,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:13,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-01-09 21:30:13,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:13,789 INFO L124 PetriNetUnfolderBase]: 276/3727 cut-off events. [2025-01-09 21:30:13,790 INFO L125 PetriNetUnfolderBase]: For 128/248 co-relation queries the response was YES. [2025-01-09 21:30:13,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 3727 events. 276/3727 cut-off events. For 128/248 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 31518 event pairs, 98 based on Foata normal form. 8/3364 useless extension candidates. Maximal degree in co-relation 4519. Up to 314 conditions per place. [2025-01-09 21:30:13,841 INFO L140 encePairwiseOnDemand]: 605/619 looper letters, 65 selfloop transitions, 15 changer transitions 0/582 dead transitions. [2025-01-09 21:30:13,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 582 transitions, 1449 flow [2025-01-09 21:30:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6202 transitions. [2025-01-09 21:30:13,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910853282420326 [2025-01-09 21:30:13,848 INFO L175 Difference]: Start difference. First operand has 558 places, 553 transitions, 1215 flow. Second operand 11 states and 6202 transitions. [2025-01-09 21:30:13,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 582 transitions, 1449 flow [2025-01-09 21:30:13,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 582 transitions, 1445 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:13,855 INFO L231 Difference]: Finished difference. Result has 572 places, 561 transitions, 1287 flow [2025-01-09 21:30:13,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1287, PETRI_PLACES=572, PETRI_TRANSITIONS=561} [2025-01-09 21:30:13,856 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2025-01-09 21:30:13,856 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 561 transitions, 1287 flow [2025-01-09 21:30:13,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 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-01-09 21:30:13,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:13,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:13,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:13,858 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:13,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1534202408, now seen corresponding path program 1 times [2025-01-09 21:30:13,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:13,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984200269] [2025-01-09 21:30:13,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:13,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 21:30:13,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 21:30:13,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:13,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:13,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:13,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984200269] [2025-01-09 21:30:13,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984200269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:13,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:13,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:13,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569680363] [2025-01-09 21:30:13,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:13,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:13,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:13,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:13,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:13,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 619 [2025-01-09 21:30:13,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 561 transitions, 1287 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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-01-09 21:30:13,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:13,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 619 [2025-01-09 21:30:13,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:14,280 INFO L124 PetriNetUnfolderBase]: 355/3156 cut-off events. [2025-01-09 21:30:14,280 INFO L125 PetriNetUnfolderBase]: For 259/330 co-relation queries the response was YES. [2025-01-09 21:30:14,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4032 conditions, 3156 events. 355/3156 cut-off events. For 259/330 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 25348 event pairs, 144 based on Foata normal form. 0/2796 useless extension candidates. Maximal degree in co-relation 3964. Up to 419 conditions per place. [2025-01-09 21:30:14,320 INFO L140 encePairwiseOnDemand]: 615/619 looper letters, 14 selfloop transitions, 3 changer transitions 0/564 dead transitions. [2025-01-09 21:30:14,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 564 transitions, 1329 flow [2025-01-09 21:30:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-01-09 21:30:14,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-01-09 21:30:14,323 INFO L175 Difference]: Start difference. First operand has 572 places, 561 transitions, 1287 flow. Second operand 3 states and 1782 transitions. [2025-01-09 21:30:14,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 564 transitions, 1329 flow [2025-01-09 21:30:14,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 564 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:14,329 INFO L231 Difference]: Finished difference. Result has 575 places, 562 transitions, 1301 flow [2025-01-09 21:30:14,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1301, PETRI_PLACES=575, PETRI_TRANSITIONS=562} [2025-01-09 21:30:14,330 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -2 predicate places. [2025-01-09 21:30:14,330 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 562 transitions, 1301 flow [2025-01-09 21:30:14,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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-01-09 21:30:14,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:14,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:14,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:14,331 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:14,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:14,332 INFO L85 PathProgramCache]: Analyzing trace with hash -553699140, now seen corresponding path program 1 times [2025-01-09 21:30:14,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:14,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780394454] [2025-01-09 21:30:14,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:14,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 21:30:14,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 21:30:14,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:14,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:14,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:14,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780394454] [2025-01-09 21:30:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780394454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:14,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:14,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963583329] [2025-01-09 21:30:14,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:14,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:14,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:14,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:14,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:14,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-01-09 21:30:14,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 562 transitions, 1301 flow. Second operand has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 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-01-09 21:30:14,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:14,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-01-09 21:30:14,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:15,433 INFO L124 PetriNetUnfolderBase]: 296/3293 cut-off events. [2025-01-09 21:30:15,433 INFO L125 PetriNetUnfolderBase]: For 310/368 co-relation queries the response was YES. [2025-01-09 21:30:15,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 3293 events. 296/3293 cut-off events. For 310/368 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 25357 event pairs, 111 based on Foata normal form. 7/3006 useless extension candidates. Maximal degree in co-relation 4289. Up to 362 conditions per place. [2025-01-09 21:30:15,480 INFO L140 encePairwiseOnDemand]: 603/619 looper letters, 78 selfloop transitions, 18 changer transitions 0/602 dead transitions. [2025-01-09 21:30:15,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 602 transitions, 1625 flow [2025-01-09 21:30:15,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:30:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:30:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6771 transitions. [2025-01-09 21:30:15,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9115508885298869 [2025-01-09 21:30:15,489 INFO L175 Difference]: Start difference. First operand has 575 places, 562 transitions, 1301 flow. Second operand 12 states and 6771 transitions. [2025-01-09 21:30:15,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 602 transitions, 1625 flow [2025-01-09 21:30:15,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 602 transitions, 1615 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:15,509 INFO L231 Difference]: Finished difference. Result has 588 places, 566 transitions, 1367 flow [2025-01-09 21:30:15,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1367, PETRI_PLACES=588, PETRI_TRANSITIONS=566} [2025-01-09 21:30:15,513 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 11 predicate places. [2025-01-09 21:30:15,514 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 566 transitions, 1367 flow [2025-01-09 21:30:15,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 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-01-09 21:30:15,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:15,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:15,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:30:15,519 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:15,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:15,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1714836203, now seen corresponding path program 1 times [2025-01-09 21:30:15,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:15,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845920603] [2025-01-09 21:30:15,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:15,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:15,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 21:30:15,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 21:30:15,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:15,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:30:15,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:15,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845920603] [2025-01-09 21:30:15,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845920603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:15,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:15,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:15,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037677290] [2025-01-09 21:30:15,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:15,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:15,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:15,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:16,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-01-09 21:30:16,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 566 transitions, 1367 flow. Second operand has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 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-01-09 21:30:16,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:16,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-01-09 21:30:16,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:16,806 INFO L124 PetriNetUnfolderBase]: 154/2297 cut-off events. [2025-01-09 21:30:16,806 INFO L125 PetriNetUnfolderBase]: For 143/195 co-relation queries the response was YES. [2025-01-09 21:30:16,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 2297 events. 154/2297 cut-off events. For 143/195 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 14319 event pairs, 55 based on Foata normal form. 2/2151 useless extension candidates. Maximal degree in co-relation 3096. Up to 234 conditions per place. [2025-01-09 21:30:16,832 INFO L140 encePairwiseOnDemand]: 604/619 looper letters, 71 selfloop transitions, 18 changer transitions 0/596 dead transitions. [2025-01-09 21:30:16,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 596 transitions, 1645 flow [2025-01-09 21:30:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6204 transitions. [2025-01-09 21:30:16,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9111470113085622 [2025-01-09 21:30:16,840 INFO L175 Difference]: Start difference. First operand has 588 places, 566 transitions, 1367 flow. Second operand 11 states and 6204 transitions. [2025-01-09 21:30:16,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 596 transitions, 1645 flow [2025-01-09 21:30:16,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 596 transitions, 1628 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:16,847 INFO L231 Difference]: Finished difference. Result has 595 places, 572 transitions, 1445 flow [2025-01-09 21:30:16,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1445, PETRI_PLACES=595, PETRI_TRANSITIONS=572} [2025-01-09 21:30:16,848 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 18 predicate places. [2025-01-09 21:30:16,848 INFO L471 AbstractCegarLoop]: Abstraction has has 595 places, 572 transitions, 1445 flow [2025-01-09 21:30:16,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 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-01-09 21:30:16,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:16,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:16,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:30:16,850 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:16,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1156355002, now seen corresponding path program 1 times [2025-01-09 21:30:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:16,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853852553] [2025-01-09 21:30:16,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:16,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:16,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 21:30:16,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 21:30:16,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:16,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:30:16,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:16,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853852553] [2025-01-09 21:30:16,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853852553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:16,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:16,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:16,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923909809] [2025-01-09 21:30:16,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:16,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:16,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:16,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:16,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:17,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-01-09 21:30:17,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 572 transitions, 1445 flow. Second operand has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 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-01-09 21:30:17,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:17,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-01-09 21:30:17,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:18,036 INFO L124 PetriNetUnfolderBase]: 341/4498 cut-off events. [2025-01-09 21:30:18,036 INFO L125 PetriNetUnfolderBase]: For 533/691 co-relation queries the response was YES. [2025-01-09 21:30:18,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6233 conditions, 4498 events. 341/4498 cut-off events. For 533/691 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 39334 event pairs, 110 based on Foata normal form. 4/4158 useless extension candidates. Maximal degree in co-relation 6149. Up to 301 conditions per place. [2025-01-09 21:30:18,075 INFO L140 encePairwiseOnDemand]: 603/619 looper letters, 65 selfloop transitions, 22 changer transitions 0/600 dead transitions. [2025-01-09 21:30:18,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 600 transitions, 1717 flow [2025-01-09 21:30:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:30:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:30:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6755 transitions. [2025-01-09 21:30:18,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9093968766828218 [2025-01-09 21:30:18,079 INFO L175 Difference]: Start difference. First operand has 595 places, 572 transitions, 1445 flow. Second operand 12 states and 6755 transitions. [2025-01-09 21:30:18,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 600 transitions, 1717 flow [2025-01-09 21:30:18,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 600 transitions, 1696 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-09 21:30:18,087 INFO L231 Difference]: Finished difference. Result has 605 places, 584 transitions, 1556 flow [2025-01-09 21:30:18,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1556, PETRI_PLACES=605, PETRI_TRANSITIONS=584} [2025-01-09 21:30:18,088 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 28 predicate places. [2025-01-09 21:30:18,088 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 584 transitions, 1556 flow [2025-01-09 21:30:18,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 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-01-09 21:30:18,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:18,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:18,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:30:18,090 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:18,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:18,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1431100244, now seen corresponding path program 1 times [2025-01-09 21:30:18,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:18,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971641074] [2025-01-09 21:30:18,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:18,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 21:30:18,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 21:30:18,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:30:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971641074] [2025-01-09 21:30:18,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971641074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:18,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287034287] [2025-01-09 21:30:18,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:18,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:18,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:18,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-01-09 21:30:18,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 584 transitions, 1556 flow. Second operand has 8 states, 8 states have (on average 561.5) internal successors, (4492), 8 states have internal predecessors, (4492), 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-01-09 21:30:18,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-01-09 21:30:18,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:19,084 INFO L124 PetriNetUnfolderBase]: 335/3802 cut-off events. [2025-01-09 21:30:19,084 INFO L125 PetriNetUnfolderBase]: For 759/799 co-relation queries the response was YES. [2025-01-09 21:30:19,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 3802 events. 335/3802 cut-off events. For 759/799 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 30643 event pairs, 104 based on Foata normal form. 8/3545 useless extension candidates. Maximal degree in co-relation 5445. Up to 370 conditions per place. [2025-01-09 21:30:19,132 INFO L140 encePairwiseOnDemand]: 603/619 looper letters, 65 selfloop transitions, 24 changer transitions 0/608 dead transitions. [2025-01-09 21:30:19,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 608 transitions, 1835 flow [2025-01-09 21:30:19,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:30:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:30:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6755 transitions. [2025-01-09 21:30:19,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9093968766828218 [2025-01-09 21:30:19,136 INFO L175 Difference]: Start difference. First operand has 605 places, 584 transitions, 1556 flow. Second operand 12 states and 6755 transitions. [2025-01-09 21:30:19,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 608 transitions, 1835 flow [2025-01-09 21:30:19,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 608 transitions, 1835 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:19,146 INFO L231 Difference]: Finished difference. Result has 620 places, 592 transitions, 1687 flow [2025-01-09 21:30:19,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1687, PETRI_PLACES=620, PETRI_TRANSITIONS=592} [2025-01-09 21:30:19,147 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 43 predicate places. [2025-01-09 21:30:19,147 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 592 transitions, 1687 flow [2025-01-09 21:30:19,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.5) internal successors, (4492), 8 states have internal predecessors, (4492), 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-01-09 21:30:19,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:19,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:19,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:30:19,148 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:19,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1285104377, now seen corresponding path program 1 times [2025-01-09 21:30:19,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:19,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324656381] [2025-01-09 21:30:19,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:19,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:19,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 21:30:19,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 21:30:19,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:19,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:19,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:19,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324656381] [2025-01-09 21:30:19,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324656381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:19,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:19,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:19,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009373146] [2025-01-09 21:30:19,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:19,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:19,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:19,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:19,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:20,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-01-09 21:30:20,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 592 transitions, 1687 flow. Second operand has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 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-01-09 21:30:20,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:20,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-01-09 21:30:20,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:20,628 INFO L124 PetriNetUnfolderBase]: 183/3420 cut-off events. [2025-01-09 21:30:20,628 INFO L125 PetriNetUnfolderBase]: For 705/729 co-relation queries the response was YES. [2025-01-09 21:30:20,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5019 conditions, 3420 events. 183/3420 cut-off events. For 705/729 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 24490 event pairs, 23 based on Foata normal form. 4/3236 useless extension candidates. Maximal degree in co-relation 4920. Up to 177 conditions per place. [2025-01-09 21:30:20,668 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 41 selfloop transitions, 5 changer transitions 0/601 dead transitions. [2025-01-09 21:30:20,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 601 transitions, 1808 flow [2025-01-09 21:30:20,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3453 transitions. [2025-01-09 21:30:20,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9297253634894992 [2025-01-09 21:30:20,674 INFO L175 Difference]: Start difference. First operand has 620 places, 592 transitions, 1687 flow. Second operand 6 states and 3453 transitions. [2025-01-09 21:30:20,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 601 transitions, 1808 flow [2025-01-09 21:30:20,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 601 transitions, 1791 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:20,686 INFO L231 Difference]: Finished difference. Result has 617 places, 590 transitions, 1676 flow [2025-01-09 21:30:20,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1676, PETRI_PLACES=617, PETRI_TRANSITIONS=590} [2025-01-09 21:30:20,687 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 40 predicate places. [2025-01-09 21:30:20,687 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 590 transitions, 1676 flow [2025-01-09 21:30:20,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 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-01-09 21:30:20,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:20,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:20,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:30:20,688 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:20,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:20,689 INFO L85 PathProgramCache]: Analyzing trace with hash 582299856, now seen corresponding path program 1 times [2025-01-09 21:30:20,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:20,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812527896] [2025-01-09 21:30:20,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:20,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 21:30:20,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 21:30:20,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:20,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:21,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:21,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812527896] [2025-01-09 21:30:21,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812527896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:21,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:21,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:21,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757710253] [2025-01-09 21:30:21,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:21,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:21,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:21,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:21,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:21,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-01-09 21:30:21,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 590 transitions, 1676 flow. Second operand has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 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-01-09 21:30:21,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:21,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-01-09 21:30:21,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:22,623 INFO L124 PetriNetUnfolderBase]: 189/3708 cut-off events. [2025-01-09 21:30:22,624 INFO L125 PetriNetUnfolderBase]: For 839/899 co-relation queries the response was YES. [2025-01-09 21:30:22,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 3708 events. 189/3708 cut-off events. For 839/899 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27396 event pairs, 28 based on Foata normal form. 4/3471 useless extension candidates. Maximal degree in co-relation 5213. Up to 195 conditions per place. [2025-01-09 21:30:22,687 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 40 selfloop transitions, 5 changer transitions 0/598 dead transitions. [2025-01-09 21:30:22,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 598 transitions, 1792 flow [2025-01-09 21:30:22,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3452 transitions. [2025-01-09 21:30:22,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929456112008616 [2025-01-09 21:30:22,691 INFO L175 Difference]: Start difference. First operand has 617 places, 590 transitions, 1676 flow. Second operand 6 states and 3452 transitions. [2025-01-09 21:30:22,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 598 transitions, 1792 flow [2025-01-09 21:30:22,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 598 transitions, 1782 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:22,704 INFO L231 Difference]: Finished difference. Result has 615 places, 588 transitions, 1672 flow [2025-01-09 21:30:22,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1672, PETRI_PLACES=615, PETRI_TRANSITIONS=588} [2025-01-09 21:30:22,705 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 38 predicate places. [2025-01-09 21:30:22,705 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 588 transitions, 1672 flow [2025-01-09 21:30:22,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 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-01-09 21:30:22,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:22,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:22,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:30:22,706 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:22,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:22,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1244462642, now seen corresponding path program 1 times [2025-01-09 21:30:22,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:22,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091863269] [2025-01-09 21:30:22,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:22,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:30:22,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:30:22,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:22,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091863269] [2025-01-09 21:30:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091863269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:22,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:22,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:22,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693594708] [2025-01-09 21:30:22,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:22,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:22,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:22,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:22,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 619 [2025-01-09 21:30:22,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 588 transitions, 1672 flow. Second operand has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 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-01-09 21:30:22,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:22,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 619 [2025-01-09 21:30:22,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,067 INFO L124 PetriNetUnfolderBase]: 361/6114 cut-off events. [2025-01-09 21:30:24,067 INFO L125 PetriNetUnfolderBase]: For 849/874 co-relation queries the response was YES. [2025-01-09 21:30:24,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7990 conditions, 6114 events. 361/6114 cut-off events. For 849/874 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 53244 event pairs, 58 based on Foata normal form. 0/5669 useless extension candidates. Maximal degree in co-relation 7891. Up to 385 conditions per place. [2025-01-09 21:30:24,159 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 19 selfloop transitions, 2 changer transitions 0/590 dead transitions. [2025-01-09 21:30:24,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 590 transitions, 1722 flow [2025-01-09 21:30:24,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1774 transitions. [2025-01-09 21:30:24,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9553042541733979 [2025-01-09 21:30:24,161 INFO L175 Difference]: Start difference. First operand has 615 places, 588 transitions, 1672 flow. Second operand 3 states and 1774 transitions. [2025-01-09 21:30:24,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 590 transitions, 1722 flow [2025-01-09 21:30:24,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 590 transitions, 1712 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:24,174 INFO L231 Difference]: Finished difference. Result has 609 places, 586 transitions, 1668 flow [2025-01-09 21:30:24,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1668, PETRI_PLACES=609, PETRI_TRANSITIONS=586} [2025-01-09 21:30:24,175 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 32 predicate places. [2025-01-09 21:30:24,175 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 586 transitions, 1668 flow [2025-01-09 21:30:24,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 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-01-09 21:30:24,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:24,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:30:24,176 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:24,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1455222189, now seen corresponding path program 1 times [2025-01-09 21:30:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396676350] [2025-01-09 21:30:24,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:30:24,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:30:24,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:24,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:24,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396676350] [2025-01-09 21:30:24,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396676350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:24,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546168137] [2025-01-09 21:30:24,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:24,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:24,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:25,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-01-09 21:30:25,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 586 transitions, 1668 flow. Second operand has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 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-01-09 21:30:25,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-01-09 21:30:25,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1714] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][332], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 717#true, Black: 649#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), 830#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 783#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 777#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 658#true, Black: 769#(<= ~n3~0 0), Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a2~0| 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 790#true, 458#L105true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 746#(<= ~n2~0 0), 764#true, Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 826#true]) [2025-01-09 21:30:25,705 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-01-09 21:30:25,705 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:25,705 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-01-09 21:30:25,705 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:25,728 INFO L124 PetriNetUnfolderBase]: 200/3858 cut-off events. [2025-01-09 21:30:25,728 INFO L125 PetriNetUnfolderBase]: For 716/733 co-relation queries the response was YES. [2025-01-09 21:30:25,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5517 conditions, 3858 events. 200/3858 cut-off events. For 716/733 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 28701 event pairs, 28 based on Foata normal form. 0/3664 useless extension candidates. Maximal degree in co-relation 5417. Up to 185 conditions per place. [2025-01-09 21:30:25,776 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 41 selfloop transitions, 5 changer transitions 0/595 dead transitions. [2025-01-09 21:30:25,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 595 transitions, 1789 flow [2025-01-09 21:30:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3453 transitions. [2025-01-09 21:30:25,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9297253634894992 [2025-01-09 21:30:25,779 INFO L175 Difference]: Start difference. First operand has 609 places, 586 transitions, 1668 flow. Second operand 6 states and 3453 transitions. [2025-01-09 21:30:25,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 595 transitions, 1789 flow [2025-01-09 21:30:25,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 595 transitions, 1789 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:25,789 INFO L231 Difference]: Finished difference. Result has 612 places, 584 transitions, 1674 flow [2025-01-09 21:30:25,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1674, PETRI_PLACES=612, PETRI_TRANSITIONS=584} [2025-01-09 21:30:25,789 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 35 predicate places. [2025-01-09 21:30:25,789 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 584 transitions, 1674 flow [2025-01-09 21:30:25,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 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-01-09 21:30:25,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:25,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:30:25,791 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:25,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash -83678542, now seen corresponding path program 1 times [2025-01-09 21:30:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944646522] [2025-01-09 21:30:25,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 21:30:25,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 21:30:25,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:26,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:26,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944646522] [2025-01-09 21:30:26,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944646522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:26,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:26,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:26,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754256454] [2025-01-09 21:30:26,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:26,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:26,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:26,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:26,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:26,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-01-09 21:30:26,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 584 transitions, 1674 flow. Second operand has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 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-01-09 21:30:26,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:26,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-01-09 21:30:26,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:27,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1713] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][478], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 288#L79-3true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 312#L104true, 717#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, 830#true, Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 770#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 783#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 777#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 658#true, 838#(= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0), Black: 769#(<= ~n3~0 0), Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 795#(<= ~n3~0 0), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 764#true, Black: 746#(<= ~n2~0 0), Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 826#true]) [2025-01-09 21:30:27,095 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-01-09 21:30:27,095 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-01-09 21:30:27,095 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-01-09 21:30:27,095 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-01-09 21:30:27,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1713] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][482], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 839#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), 312#L104true, 717#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, 830#true, Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 770#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 783#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 777#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 658#true, Black: 769#(<= ~n3~0 0), Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 795#(<= ~n3~0 0), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 199#L79-4true, 764#true, Black: 746#(<= ~n2~0 0), Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 826#true]) [2025-01-09 21:30:27,103 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-01-09 21:30:27,103 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2025-01-09 21:30:27,103 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-01-09 21:30:27,103 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-01-09 21:30:27,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1713] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][487], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 312#L104true, 717#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, 830#true, Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 770#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 840#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 783#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 777#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 658#true, Black: 769#(<= ~n3~0 0), Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 795#(<= ~n3~0 0), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 160#L79-5true, 764#true, Black: 746#(<= ~n2~0 0), Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 826#true]) [2025-01-09 21:30:27,109 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-01-09 21:30:27,109 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-01-09 21:30:27,109 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-01-09 21:30:27,109 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-01-09 21:30:27,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1713] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][491], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 312#L104true, 717#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, 830#true, Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 770#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 783#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 777#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 658#true, Black: 769#(<= ~n3~0 0), Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), 841#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 148#L79-6true, 631#(= |#race~n3~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 795#(<= ~n3~0 0), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 764#true, Black: 746#(<= ~n2~0 0), Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 826#true]) [2025-01-09 21:30:27,114 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2025-01-09 21:30:27,114 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-01-09 21:30:27,114 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-01-09 21:30:27,114 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-01-09 21:30:27,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1713] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][491], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 312#L104true, 717#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, 830#true, Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 770#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 783#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 777#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 658#true, Black: 769#(<= ~n3~0 0), Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 122#L79-7true, 651#(= |#race~a1~0| 0), 841#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 795#(<= ~n3~0 0), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 764#true, Black: 746#(<= ~n2~0 0), Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 826#true]) [2025-01-09 21:30:27,118 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-01-09 21:30:27,119 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-01-09 21:30:27,119 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-01-09 21:30:27,119 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-01-09 21:30:27,298 INFO L124 PetriNetUnfolderBase]: 433/5029 cut-off events. [2025-01-09 21:30:27,299 INFO L125 PetriNetUnfolderBase]: For 1469/1508 co-relation queries the response was YES. [2025-01-09 21:30:27,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7494 conditions, 5029 events. 433/5029 cut-off events. For 1469/1508 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 43355 event pairs, 49 based on Foata normal form. 4/4726 useless extension candidates. Maximal degree in co-relation 7393. Up to 316 conditions per place. [2025-01-09 21:30:27,369 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 39 selfloop transitions, 5 changer transitions 0/591 dead transitions. [2025-01-09 21:30:27,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 591 transitions, 1785 flow [2025-01-09 21:30:27,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3451 transitions. [2025-01-09 21:30:27,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291868605277329 [2025-01-09 21:30:27,371 INFO L175 Difference]: Start difference. First operand has 612 places, 584 transitions, 1674 flow. Second operand 6 states and 3451 transitions. [2025-01-09 21:30:27,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 591 transitions, 1785 flow [2025-01-09 21:30:27,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 591 transitions, 1775 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:27,382 INFO L231 Difference]: Finished difference. Result has 610 places, 582 transitions, 1670 flow [2025-01-09 21:30:27,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1670, PETRI_PLACES=610, PETRI_TRANSITIONS=582} [2025-01-09 21:30:27,384 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 33 predicate places. [2025-01-09 21:30:27,384 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 582 transitions, 1670 flow [2025-01-09 21:30:27,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 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-01-09 21:30:27,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:27,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:27,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:30:27,385 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:27,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:27,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1780421110, now seen corresponding path program 1 times [2025-01-09 21:30:27,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:27,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497911691] [2025-01-09 21:30:27,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:27,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:27,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:30:27,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:30:27,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:27,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:27,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:27,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497911691] [2025-01-09 21:30:27,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497911691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:27,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:27,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:27,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510468799] [2025-01-09 21:30:27,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:27,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:27,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:27,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:28,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-01-09 21:30:28,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 582 transitions, 1670 flow. Second operand has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 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-01-09 21:30:28,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:28,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-01-09 21:30:28,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:28,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1714] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][332], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 717#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, 842#true, Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 770#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 783#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 777#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 658#true, Black: 769#(<= ~n3~0 0), Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 795#(<= ~n3~0 0), 660#(= |#race~a2~0| 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 790#true, 458#L105true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 836#true, Black: 746#(<= ~n2~0 0), 764#true, Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 826#true]) [2025-01-09 21:30:28,649 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-01-09 21:30:28,649 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-01-09 21:30:28,649 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:28,649 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:28,683 INFO L124 PetriNetUnfolderBase]: 204/4117 cut-off events. [2025-01-09 21:30:28,683 INFO L125 PetriNetUnfolderBase]: For 857/971 co-relation queries the response was YES. [2025-01-09 21:30:28,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5859 conditions, 4117 events. 204/4117 cut-off events. For 857/971 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 32154 event pairs, 30 based on Foata normal form. 11/3924 useless extension candidates. Maximal degree in co-relation 5758. Up to 194 conditions per place. [2025-01-09 21:30:28,735 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 40 selfloop transitions, 5 changer transitions 0/590 dead transitions. [2025-01-09 21:30:28,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 590 transitions, 1786 flow [2025-01-09 21:30:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:28,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3452 transitions. [2025-01-09 21:30:28,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929456112008616 [2025-01-09 21:30:28,737 INFO L175 Difference]: Start difference. First operand has 610 places, 582 transitions, 1670 flow. Second operand 6 states and 3452 transitions. [2025-01-09 21:30:28,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 590 transitions, 1786 flow [2025-01-09 21:30:28,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 590 transitions, 1776 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:28,746 INFO L231 Difference]: Finished difference. Result has 608 places, 580 transitions, 1666 flow [2025-01-09 21:30:28,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1666, PETRI_PLACES=608, PETRI_TRANSITIONS=580} [2025-01-09 21:30:28,747 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 31 predicate places. [2025-01-09 21:30:28,747 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 580 transitions, 1666 flow [2025-01-09 21:30:28,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 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-01-09 21:30:28,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:28,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:28,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:30:28,747 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:28,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:28,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1171651368, now seen corresponding path program 1 times [2025-01-09 21:30:28,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:28,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679531497] [2025-01-09 21:30:28,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:28,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:28,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 21:30:28,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 21:30:28,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:28,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:28,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:28,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679531497] [2025-01-09 21:30:28,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679531497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:28,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:28,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:28,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181237978] [2025-01-09 21:30:28,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:28,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:28,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:28,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:28,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:28,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 619 [2025-01-09 21:30:28,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 580 transitions, 1666 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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-01-09 21:30:28,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:28,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 619 [2025-01-09 21:30:28,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:29,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1714] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][332], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 717#true, Black: 649#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), 842#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 783#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 777#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 769#(<= ~n3~0 0), Black: 658#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 848#true, 790#true, 458#L105true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 746#(<= ~n2~0 0), 764#true, Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 826#true]) [2025-01-09 21:30:29,283 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-01-09 21:30:29,283 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-01-09 21:30:29,283 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:29,283 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:29,345 INFO L124 PetriNetUnfolderBase]: 160/4200 cut-off events. [2025-01-09 21:30:29,345 INFO L125 PetriNetUnfolderBase]: For 849/873 co-relation queries the response was YES. [2025-01-09 21:30:29,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5854 conditions, 4200 events. 160/4200 cut-off events. For 849/873 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 30994 event pairs, 27 based on Foata normal form. 0/4030 useless extension candidates. Maximal degree in co-relation 5754. Up to 132 conditions per place. [2025-01-09 21:30:29,402 INFO L140 encePairwiseOnDemand]: 617/619 looper letters, 9 selfloop transitions, 1 changer transitions 0/579 dead transitions. [2025-01-09 21:30:29,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 579 transitions, 1684 flow [2025-01-09 21:30:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2025-01-09 21:30:29,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9606892837910609 [2025-01-09 21:30:29,404 INFO L175 Difference]: Start difference. First operand has 608 places, 580 transitions, 1666 flow. Second operand 3 states and 1784 transitions. [2025-01-09 21:30:29,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 579 transitions, 1684 flow [2025-01-09 21:30:29,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 579 transitions, 1674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:29,414 INFO L231 Difference]: Finished difference. Result has 604 places, 579 transitions, 1656 flow [2025-01-09 21:30:29,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1656, PETRI_PLACES=604, PETRI_TRANSITIONS=579} [2025-01-09 21:30:29,415 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 27 predicate places. [2025-01-09 21:30:29,415 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 579 transitions, 1656 flow [2025-01-09 21:30:29,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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-01-09 21:30:29,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:29,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:29,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:30:29,416 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:29,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:29,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1378464600, now seen corresponding path program 1 times [2025-01-09 21:30:29,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:29,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538292961] [2025-01-09 21:30:29,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:29,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 21:30:29,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 21:30:29,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:29,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:29,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:29,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538292961] [2025-01-09 21:30:29,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538292961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:29,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:29,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620038917] [2025-01-09 21:30:29,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:29,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:29,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:29,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:29,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:30,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-01-09 21:30:30,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 579 transitions, 1656 flow. Second operand has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 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-01-09 21:30:30,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:30,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-01-09 21:30:30,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:30,898 INFO L124 PetriNetUnfolderBase]: 270/4234 cut-off events. [2025-01-09 21:30:30,899 INFO L125 PetriNetUnfolderBase]: For 1180/1208 co-relation queries the response was YES. [2025-01-09 21:30:30,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6232 conditions, 4234 events. 270/4234 cut-off events. For 1180/1208 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 34025 event pairs, 38 based on Foata normal form. 0/4081 useless extension candidates. Maximal degree in co-relation 6131. Up to 214 conditions per place. [2025-01-09 21:30:30,950 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 39 selfloop transitions, 5 changer transitions 0/586 dead transitions. [2025-01-09 21:30:30,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 586 transitions, 1767 flow [2025-01-09 21:30:30,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3451 transitions. [2025-01-09 21:30:30,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291868605277329 [2025-01-09 21:30:30,953 INFO L175 Difference]: Start difference. First operand has 604 places, 579 transitions, 1656 flow. Second operand 6 states and 3451 transitions. [2025-01-09 21:30:30,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 586 transitions, 1767 flow [2025-01-09 21:30:30,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 586 transitions, 1766 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:30,962 INFO L231 Difference]: Finished difference. Result has 606 places, 577 transitions, 1661 flow [2025-01-09 21:30:30,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1661, PETRI_PLACES=606, PETRI_TRANSITIONS=577} [2025-01-09 21:30:30,963 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 29 predicate places. [2025-01-09 21:30:30,963 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 577 transitions, 1661 flow [2025-01-09 21:30:30,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 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-01-09 21:30:30,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:30,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:30:30,964 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:30,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash -38100320, now seen corresponding path program 1 times [2025-01-09 21:30:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971410839] [2025-01-09 21:30:30,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:30,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:30,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 21:30:30,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 21:30:30,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:30,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971410839] [2025-01-09 21:30:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971410839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:30,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:30,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694274964] [2025-01-09 21:30:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:30,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:30,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:30,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:30,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 619 [2025-01-09 21:30:31,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 577 transitions, 1661 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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-01-09 21:30:31,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 619 [2025-01-09 21:30:31,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1714] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][332], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 851#true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 717#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 783#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 777#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 769#(<= ~n3~0 0), Black: 658#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 795#(<= ~n3~0 0), 660#(= |#race~a2~0| 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 790#true, 458#L105true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 764#true, Black: 746#(<= ~n2~0 0), Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 826#true, 857#true]) [2025-01-09 21:30:31,479 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-01-09 21:30:31,480 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:31,480 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-01-09 21:30:31,480 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:31,532 INFO L124 PetriNetUnfolderBase]: 122/3730 cut-off events. [2025-01-09 21:30:31,532 INFO L125 PetriNetUnfolderBase]: For 724/791 co-relation queries the response was YES. [2025-01-09 21:30:31,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5206 conditions, 3730 events. 122/3730 cut-off events. For 724/791 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 27057 event pairs, 30 based on Foata normal form. 0/3613 useless extension candidates. Maximal degree in co-relation 5106. Up to 129 conditions per place. [2025-01-09 21:30:31,585 INFO L140 encePairwiseOnDemand]: 617/619 looper letters, 9 selfloop transitions, 1 changer transitions 0/576 dead transitions. [2025-01-09 21:30:31,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 576 transitions, 1679 flow [2025-01-09 21:30:31,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2025-01-09 21:30:31,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9606892837910609 [2025-01-09 21:30:31,587 INFO L175 Difference]: Start difference. First operand has 606 places, 577 transitions, 1661 flow. Second operand 3 states and 1784 transitions. [2025-01-09 21:30:31,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 576 transitions, 1679 flow [2025-01-09 21:30:31,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 576 transitions, 1669 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:31,596 INFO L231 Difference]: Finished difference. Result has 602 places, 576 transitions, 1651 flow [2025-01-09 21:30:31,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=602, PETRI_TRANSITIONS=576} [2025-01-09 21:30:31,597 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 25 predicate places. [2025-01-09 21:30:31,597 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 576 transitions, 1651 flow [2025-01-09 21:30:31,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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-01-09 21:30:31,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:31,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:30:31,598 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:31,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,599 INFO L85 PathProgramCache]: Analyzing trace with hash -669430831, now seen corresponding path program 1 times [2025-01-09 21:30:31,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561027225] [2025-01-09 21:30:31,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 21:30:31,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 21:30:31,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:31,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561027225] [2025-01-09 21:30:31,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561027225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:31,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126096662] [2025-01-09 21:30:31,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 619 [2025-01-09 21:30:31,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 576 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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-01-09 21:30:31,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 619 [2025-01-09 21:30:31,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,077 INFO L124 PetriNetUnfolderBase]: 133/3239 cut-off events. [2025-01-09 21:30:32,077 INFO L125 PetriNetUnfolderBase]: For 588/627 co-relation queries the response was YES. [2025-01-09 21:30:32,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4490 conditions, 3239 events. 133/3239 cut-off events. For 588/627 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 22257 event pairs, 39 based on Foata normal form. 30/3165 useless extension candidates. Maximal degree in co-relation 4390. Up to 154 conditions per place. [2025-01-09 21:30:32,116 INFO L140 encePairwiseOnDemand]: 617/619 looper letters, 7 selfloop transitions, 0 changer transitions 19/575 dead transitions. [2025-01-09 21:30:32,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 575 transitions, 1667 flow [2025-01-09 21:30:32,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2025-01-09 21:30:32,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9601507808292946 [2025-01-09 21:30:32,118 INFO L175 Difference]: Start difference. First operand has 602 places, 576 transitions, 1651 flow. Second operand 3 states and 1783 transitions. [2025-01-09 21:30:32,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 575 transitions, 1667 flow [2025-01-09 21:30:32,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 575 transitions, 1666 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:32,126 INFO L231 Difference]: Finished difference. Result has 602 places, 556 transitions, 1545 flow [2025-01-09 21:30:32,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1648, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1545, PETRI_PLACES=602, PETRI_TRANSITIONS=556} [2025-01-09 21:30:32,127 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 25 predicate places. [2025-01-09 21:30:32,127 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 556 transitions, 1545 flow [2025-01-09 21:30:32,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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-01-09 21:30:32,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:32,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:30:32,127 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:32,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash -147639595, now seen corresponding path program 1 times [2025-01-09 21:30:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288131636] [2025-01-09 21:30:32,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-01-09 21:30:32,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-01-09 21:30:32,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:32,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288131636] [2025-01-09 21:30:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288131636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822934751] [2025-01-09 21:30:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-01-09 21:30:32,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 556 transitions, 1545 flow. Second operand has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 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-01-09 21:30:32,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-01-09 21:30:32,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,676 INFO L124 PetriNetUnfolderBase]: 155/3721 cut-off events. [2025-01-09 21:30:32,676 INFO L125 PetriNetUnfolderBase]: For 649/659 co-relation queries the response was YES. [2025-01-09 21:30:32,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5155 conditions, 3721 events. 155/3721 cut-off events. For 649/659 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 25027 event pairs, 25 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 5119. Up to 107 conditions per place. [2025-01-09 21:30:32,724 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 10 selfloop transitions, 2 changer transitions 14/557 dead transitions. [2025-01-09 21:30:32,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 557 transitions, 1573 flow [2025-01-09 21:30:32,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2025-01-09 21:30:32,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585352719439957 [2025-01-09 21:30:32,725 INFO L175 Difference]: Start difference. First operand has 602 places, 556 transitions, 1545 flow. Second operand 3 states and 1780 transitions. [2025-01-09 21:30:32,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 557 transitions, 1573 flow [2025-01-09 21:30:32,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 557 transitions, 1567 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:32,735 INFO L231 Difference]: Finished difference. Result has 589 places, 541 transitions, 1438 flow [2025-01-09 21:30:32,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=589, PETRI_TRANSITIONS=541} [2025-01-09 21:30:32,736 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 12 predicate places. [2025-01-09 21:30:32,736 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 541 transitions, 1438 flow [2025-01-09 21:30:32,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 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-01-09 21:30:32,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:32,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:30:32,736 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:32,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,737 INFO L85 PathProgramCache]: Analyzing trace with hash -184031905, now seen corresponding path program 1 times [2025-01-09 21:30:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212650110] [2025-01-09 21:30:32,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 21:30:32,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 21:30:32,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:32,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212650110] [2025-01-09 21:30:32,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212650110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431519566] [2025-01-09 21:30:32,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-01-09 21:30:32,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 541 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 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-01-09 21:30:32,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-01-09 21:30:32,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:33,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1402] L51-7-->L51-8: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][353], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 47#L102-4true, 131#L79true, 717#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 770#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 783#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 777#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 769#(<= ~n3~0 0), Black: 658#true, 866#true, 860#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a2~0| 0), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 364#L65true, 863#true, 790#true, 474#L51-8true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 746#(<= ~n2~0 0), 764#true, Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 826#true]) [2025-01-09 21:30:33,183 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-01-09 21:30:33,183 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-01-09 21:30:33,183 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-01-09 21:30:33,183 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-01-09 21:30:33,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1713] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][350], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 131#L79true, 312#L104true, 717#true, Black: 649#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 770#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 783#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 777#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 658#true, Black: 769#(<= ~n3~0 0), 866#true, 860#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), 631#(= |#race~n3~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 667#(<= ~n1~0 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 863#true, 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 746#(<= ~n2~0 0), 764#true, Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 826#true]) [2025-01-09 21:30:33,218 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2025-01-09 21:30:33,218 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-01-09 21:30:33,218 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2025-01-09 21:30:33,218 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2025-01-09 21:30:33,224 INFO L124 PetriNetUnfolderBase]: 139/2925 cut-off events. [2025-01-09 21:30:33,224 INFO L125 PetriNetUnfolderBase]: For 389/412 co-relation queries the response was YES. [2025-01-09 21:30:33,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3915 conditions, 2925 events. 139/2925 cut-off events. For 389/412 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 18713 event pairs, 27 based on Foata normal form. 0/2837 useless extension candidates. Maximal degree in co-relation 3878. Up to 90 conditions per place. [2025-01-09 21:30:33,266 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 10 selfloop transitions, 2 changer transitions 11/542 dead transitions. [2025-01-09 21:30:33,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 542 transitions, 1466 flow [2025-01-09 21:30:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2025-01-09 21:30:33,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585352719439957 [2025-01-09 21:30:33,268 INFO L175 Difference]: Start difference. First operand has 589 places, 541 transitions, 1438 flow. Second operand 3 states and 1780 transitions. [2025-01-09 21:30:33,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 542 transitions, 1466 flow [2025-01-09 21:30:33,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 542 transitions, 1402 flow, removed 9 selfloop flow, removed 17 redundant places. [2025-01-09 21:30:33,275 INFO L231 Difference]: Finished difference. Result has 566 places, 529 transitions, 1304 flow [2025-01-09 21:30:33,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=566, PETRI_TRANSITIONS=529} [2025-01-09 21:30:33,276 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -11 predicate places. [2025-01-09 21:30:33,276 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 529 transitions, 1304 flow [2025-01-09 21:30:33,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 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-01-09 21:30:33,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:33,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:33,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:30:33,277 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-01-09 21:30:33,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:33,278 INFO L85 PathProgramCache]: Analyzing trace with hash 201854832, now seen corresponding path program 1 times [2025-01-09 21:30:33,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:33,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066742329] [2025-01-09 21:30:33,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:33,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:33,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 21:30:33,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 21:30:33,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:33,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 21:30:33,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:33,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066742329] [2025-01-09 21:30:33,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066742329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:33,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:33,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:33,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530935525] [2025-01-09 21:30:33,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:33,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:33,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:33,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:33,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:33,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-01-09 21:30:33,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 529 transitions, 1304 flow. Second operand has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 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-01-09 21:30:33,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:33,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-01-09 21:30:33,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:33,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1402] L51-7-->L51-8: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][325], [Black: 692#(<= ~n2~0 0), Black: 693#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 869#true, Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 131#L79true, 47#L102-4true, 717#true, Black: 649#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 775#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 658#true, 866#true, 860#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a2~0| 0), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 364#L65true, 790#true, 474#L51-8true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 764#true, Black: 746#(<= ~n2~0 0), Black: 760#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 828#(= |#race~a3~0| 0), Black: 826#true]) [2025-01-09 21:30:33,552 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-01-09 21:30:33,552 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-01-09 21:30:33,552 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-01-09 21:30:33,552 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-01-09 21:30:33,569 INFO L124 PetriNetUnfolderBase]: 121/1832 cut-off events. [2025-01-09 21:30:33,569 INFO L125 PetriNetUnfolderBase]: For 165/182 co-relation queries the response was YES. [2025-01-09 21:30:33,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2390 conditions, 1832 events. 121/1832 cut-off events. For 165/182 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10710 event pairs, 24 based on Foata normal form. 0/1769 useless extension candidates. Maximal degree in co-relation 2360. Up to 83 conditions per place. [2025-01-09 21:30:33,591 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 0 selfloop transitions, 0 changer transitions 530/530 dead transitions. [2025-01-09 21:30:33,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 530 transitions, 1332 flow [2025-01-09 21:30:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2025-01-09 21:30:33,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585352719439957 [2025-01-09 21:30:33,593 INFO L175 Difference]: Start difference. First operand has 566 places, 529 transitions, 1304 flow. Second operand 3 states and 1780 transitions. [2025-01-09 21:30:33,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 530 transitions, 1332 flow [2025-01-09 21:30:33,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 530 transitions, 1284 flow, removed 9 selfloop flow, removed 15 redundant places. [2025-01-09 21:30:33,598 INFO L231 Difference]: Finished difference. Result has 545 places, 0 transitions, 0 flow [2025-01-09 21:30:33,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=545, PETRI_TRANSITIONS=0} [2025-01-09 21:30:33,599 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -32 predicate places. [2025-01-09 21:30:33,599 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 0 transitions, 0 flow [2025-01-09 21:30:33,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 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-01-09 21:30:33,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (101 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (100 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (99 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (98 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (97 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (96 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (95 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (94 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (93 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (92 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (91 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (90 of 102 remaining) [2025-01-09 21:30:33,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (89 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (88 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (87 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (86 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (85 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (84 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (83 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (82 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (81 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (80 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (79 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (78 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (77 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (76 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (75 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (74 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (73 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (72 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (71 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (70 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (69 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (68 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (67 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (66 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (65 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (64 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (63 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (62 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (61 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (60 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (59 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (58 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (57 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (56 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (55 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (54 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (53 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (52 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (51 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (50 of 102 remaining) [2025-01-09 21:30:33,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (49 of 102 remaining) [2025-01-09 21:30:33,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (48 of 102 remaining) [2025-01-09 21:30:33,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (47 of 102 remaining) [2025-01-09 21:30:33,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (46 of 102 remaining) [2025-01-09 21:30:33,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 102 remaining) [2025-01-09 21:30:33,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 102 remaining) [2025-01-09 21:30:33,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 102 remaining) [2025-01-09 21:30:33,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 102 remaining) [2025-01-09 21:30:33,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 102 remaining) [2025-01-09 21:30:33,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 102 remaining) [2025-01-09 21:30:33,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (39 of 102 remaining) [2025-01-09 21:30:33,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (36 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (32 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (31 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (30 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (28 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (25 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (24 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 102 remaining) [2025-01-09 21:30:33,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (16 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (15 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (14 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (8 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (4 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (3 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (2 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (1 of 102 remaining) [2025-01-09 21:30:33,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (0 of 102 remaining) [2025-01-09 21:30:33,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:30:33,608 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-09 21:30:33,616 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:33,617 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:33,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:33 BasicIcfg [2025-01-09 21:30:33,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:33,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:33,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:33,623 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:33,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:57" (3/4) ... [2025-01-09 21:30:33,625 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:33,627 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:33,627 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:33,627 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:30:33,633 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-01-09 21:30:33,634 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:33,634 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:33,634 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:33,699 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:33,699 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:33,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:33,700 INFO L158 Benchmark]: Toolchain (without parser) took 36787.38ms. Allocated memory was 167.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 122.8MB in the beginning and 1.1GB in the end (delta: -946.8MB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2025-01-09 21:30:33,701 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:33,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.20ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 109.0MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:33,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.54ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 104.9MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:33,701 INFO L158 Benchmark]: Boogie Preprocessor took 53.65ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 101.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:33,701 INFO L158 Benchmark]: RCFGBuilder took 724.73ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 57.7MB in the end (delta: 44.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 21:30:33,702 INFO L158 Benchmark]: TraceAbstraction took 35643.86ms. Allocated memory was 167.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 57.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2025-01-09 21:30:33,702 INFO L158 Benchmark]: Witness Printer took 76.90ms. Allocated memory is still 3.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:33,703 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.20ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 109.0MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.54ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 104.9MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.65ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 101.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 724.73ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 57.7MB in the end (delta: 44.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 35643.86ms. Allocated memory was 167.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 57.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 76.90ms. Allocated memory is still 3.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 923 locations, 102 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.3s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6605 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4270 mSDsluCounter, 6896 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6494 mSDsCounter, 1287 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10079 IncrementalHoareTripleChecker+Invalid, 11366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1287 mSolverCounterUnsat, 402 mSDtfsCounter, 10079 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1687occurred in iteration=24, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 6289 NumberOfCodeBlocks, 6289 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6252 ConstructedInterpolants, 0 QuantifiedInterpolants, 8572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 29/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 57 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:33,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE