About the Execution of 2025-gold for Philosophers-COL-001000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r223-smll-177969946300008.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is Philosophers-COL-001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-177969946300008
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.2K Mar 5 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 5 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 10:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 5 10:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 16 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 5 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 5 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 16 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 52K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Philosophers-COL-001000-UpperBounds-00
FORMULA_NAME Philosophers-COL-001000-UpperBounds-01
FORMULA_NAME Philosophers-COL-001000-UpperBounds-02
FORMULA_NAME Philosophers-COL-001000-UpperBounds-03
FORMULA_NAME Philosophers-COL-001000-UpperBounds-04
FORMULA_NAME Philosophers-COL-001000-UpperBounds-05
FORMULA_NAME Philosophers-COL-001000-UpperBounds-06
FORMULA_NAME Philosophers-COL-001000-UpperBounds-07
FORMULA_NAME Philosophers-COL-001000-UpperBounds-08
FORMULA_NAME Philosophers-COL-001000-UpperBounds-09
FORMULA_NAME Philosophers-COL-001000-UpperBounds-10
FORMULA_NAME Philosophers-COL-001000-UpperBounds-11
FORMULA_NAME Philosophers-COL-001000-UpperBounds-12
FORMULA_NAME Philosophers-COL-001000-UpperBounds-13
FORMULA_NAME Philosophers-COL-001000-UpperBounds-14
FORMULA_NAME Philosophers-COL-001000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779786925059
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-001000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-26 09:15:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 09:15:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 09:15:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-26 09:15:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 09:15:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1374 ms
[2026-05-26 09:15:29] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 5000 PT places and 5000.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2026-05-26 09:15:29] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 9 ms.
[2026-05-26 09:15:29] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2026-05-26 09:15:29] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1000, 0, 0] Max Struct:[1000, 1000, 500, 1000]
FORMULA Philosophers-COL-001000-UpperBounds-11 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-001000-UpperBounds-14 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-001000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-26 09:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:15:29] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2026-05-26 09:15:29] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-26 09:15:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-26 09:15:30] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:15:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-26 09:15:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-26 09:15:30] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-26 09:15:30] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2026-05-26 09:15:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:15:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-26 09:15:30] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-26 09:15:30] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-26 09:15:30] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:15:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-26 09:15:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-26 09:15:30] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 09:15:30] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0] Max Struct:[1000, 500, 1000]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 1000) 1000) 1000)]] contains successor/predecessor on variables of sort Philo
[2026-05-26 09:15:30] [INFO ] Unfolded HLPN to a Petri net with 5000 places and 5000 transitions 16000 arcs in 227 ms.
[2026-05-26 09:15:30] [INFO ] Unfolded 3 HLPN properties in 1 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0] Max Struct:[1000, 500, 1000]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[1000, 500, 1000]
// Phase 1: matrix 5000 rows 5000 cols
[2026-05-26 09:15:30] [INFO ] Computed 2000 invariants in 134 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1000, 500, 1000]
RANDOM walk for 10000 steps (2 resets) in 2809 ms. (3 steps per ms)
BEST_FIRST walk for 30003 steps (6 resets) in 2663 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[365, 159, 410] Max Struct:[1000, 500, 1000]
[2026-05-26 09:15:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:15:38] [INFO ] [Real]Absence check using 2000 positive place invariants in 1199 ms returned sat
[2026-05-26 09:15:41] [INFO ] [Real]Absence check using state equation in 2749 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:15:43] [INFO ] [Real]Absence check using 2000 positive place invariants in 1038 ms returned sat
[2026-05-26 09:15:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:15:48] [INFO ] [Real]Absence check using 2000 positive place invariants in 1133 ms returned sat
[2026-05-26 09:15:51] [INFO ] [Real]Absence check using state equation in 2837 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[365, 159, 410] Max Struct:[1000, 500, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[365, 159, 410] Max Struct:[1000, 500, 1000]
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 457 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 5000/5000 places, 5000/5000 transitions.
[2026-05-26 09:15:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[365, 159, 410] Max Struct:[1000, 500, 1000]
RANDOM walk for 220497 steps (0 resets) in 30001 ms. (7 steps per ms)
BEST_FIRST walk for 202010 steps (0 resets) in 15060 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[679, 159, 627] Max Struct:[1000, 500, 1000]
[2026-05-26 09:16:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:16:39] [INFO ] [Real]Absence check using 2000 positive place invariants in 1514 ms returned sat
[2026-05-26 09:16:43] [INFO ] [Real]Absence check using state equation in 3634 ms returned sat
[2026-05-26 09:16:44] [INFO ] Computed and/alt/rep : 3000/4000/3000 causal constraints (skipped 0 transitions) in 370 ms.
[2026-05-26 09:16:53] [INFO ] Added : 84 causal constraints over 17 iterations in 9776 ms. Result :sat
Minimization took 3182 ms.
[2026-05-26 09:16:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:16:59] [INFO ] [Nat]Absence check using 2000 positive place invariants in 1493 ms returned sat
[2026-05-26 09:17:03] [INFO ] [Nat]Absence check using state equation in 3652 ms returned sat
[2026-05-26 09:17:04] [INFO ] Computed and/alt/rep : 3000/4000/3000 causal constraints (skipped 0 transitions) in 518 ms.
[2026-05-26 09:17:16] [INFO ] Added : 87 causal constraints over 18 iterations in 12256 ms. Result :sat
Minimization took 3494 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:17:21] [INFO ] [Real]Absence check using 2000 positive place invariants in 798 ms returned sat
[2026-05-26 09:17:25] [INFO ] [Real]Absence check using state equation in 3656 ms returned sat
[2026-05-26 09:17:25] [INFO ] Computed and/alt/rep : 3000/4000/3000 causal constraints (skipped 0 transitions) in 312 ms.
[2026-05-26 09:17:46] [INFO ] Added : 155 causal constraints over 31 iterations in 20532 ms.(timeout) Result :sat
Minimization took 4082 ms.
[2026-05-26 09:17:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:17:53] [INFO ] [Nat]Absence check using 2000 positive place invariants in 980 ms returned sat
[2026-05-26 09:17:56] [INFO ] [Nat]Absence check using state equation in 3532 ms returned sat
[2026-05-26 09:17:57] [INFO ] Computed and/alt/rep : 3000/4000/3000 causal constraints (skipped 0 transitions) in 471 ms.
[2026-05-26 09:18:17] [INFO ] Added : 160 causal constraints over 32 iterations in 20895 ms.(timeout) Result :sat
Minimization took 3131 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:18:23] [INFO ] [Real]Absence check using 2000 positive place invariants in 1698 ms returned sat
[2026-05-26 09:18:27] [INFO ] [Real]Absence check using state equation in 3591 ms returned sat
[2026-05-26 09:18:28] [INFO ] Computed and/alt/rep : 3000/4000/3000 causal constraints (skipped 0 transitions) in 486 ms.
[2026-05-26 09:18:41] [INFO ] Added : 92 causal constraints over 19 iterations in 14024 ms. Result :sat
Minimization took 2950 ms.
[2026-05-26 09:18:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:18:48] [INFO ] [Nat]Absence check using 2000 positive place invariants in 1555 ms returned sat
[2026-05-26 09:18:51] [INFO ] [Nat]Absence check using state equation in 3812 ms returned sat
[2026-05-26 09:18:52] [INFO ] Computed and/alt/rep : 3000/4000/3000 causal constraints (skipped 0 transitions) in 476 ms.
[2026-05-26 09:19:04] [INFO ] Added : 92 causal constraints over 19 iterations in 12462 ms. Result :sat
Minimization took 2845 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[679, 159, 627] Max Struct:[1000, 500, 1000]
FORMULA Philosophers-COL-001000-UpperBounds-05 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-001000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-001000-UpperBounds-09 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-001000-UpperBounds-13 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-001000-UpperBounds-15 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-001000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000, 385] Max Struct:[1000, 500]
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Free-agglomeration rule (complex) applied 1000 times.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 1000 place count 5000 transition count 4000
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 2000 place count 4000 transition count 4000
Applied a total of 2000 rules in 879 ms. Remains 4000 /5000 variables (removed 1000) and now considering 4000/5000 (removed 1000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 880 ms. Remains : 4000/5000 places, 4000/5000 transitions.
// Phase 1: matrix 4000 rows 4000 cols
[2026-05-26 09:20:35] [INFO ] Computed 2000 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000, 385] Max Struct:[1000, 500]
FORMULA Philosophers-COL-001000-UpperBounds-02 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-UpperBounds-08 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 194809 steps (44 resets) in 30001 ms. (6 steps per ms)
BEST_FIRST walk for 62048 steps (0 resets) in 5062 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[385] Max Struct:[500]
[2026-05-26 09:21:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:21:12] [INFO ] [Real]Absence check using 2000 positive place invariants in 1085 ms returned sat
[2026-05-26 09:21:15] [INFO ] [Real]Absence check using state equation in 2873 ms returned sat
[2026-05-26 09:21:16] [INFO ] Computed and/alt/rep : 2000/3000/2000 causal constraints (skipped 0 transitions) in 308 ms.
[2026-05-26 09:21:36] [INFO ] Added : 180 causal constraints over 36 iterations in 20231 ms.(timeout) Result :sat
Minimization took 1910 ms.
[2026-05-26 09:21:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:21:40] [INFO ] [Nat]Absence check using 2000 positive place invariants in 1123 ms returned sat
[2026-05-26 09:21:43] [INFO ] [Nat]Absence check using state equation in 2865 ms returned sat
[2026-05-26 09:21:44] [INFO ] Computed and/alt/rep : 2000/3000/2000 causal constraints (skipped 0 transitions) in 396 ms.
[2026-05-26 09:22:03] [INFO ] Added : 184 causal constraints over 37 iterations in 19590 ms. Result :sat
Minimization took 1933 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[385] Max Struct:[500]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[490] Max Struct:[500]
Support contains 1000 out of 4000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4000/4000 places, 4000/4000 transitions.
Free-agglomeration rule (complex) applied 1000 times.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 1000 place count 4000 transition count 3000
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 2000 rules applied. Total rules applied 3000 place count 3000 transition count 2000
Applied a total of 3000 rules in 488 ms. Remains 3000 /4000 variables (removed 1000) and now considering 2000/4000 (removed 2000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 3000/4000 places, 2000/4000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2026-05-26 09:22:20] [INFO ] Computed 2000 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[490] Max Struct:[500]
RANDOM walk for 195900 steps (0 resets) in 30001 ms. (6 steps per ms)
BEST_FIRST walk for 53865 steps (0 resets) in 5026 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[490] Max Struct:[500]
[2026-05-26 09:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:22:57] [INFO ] [Real]Absence check using 2000 positive place invariants in 1138 ms returned sat
[2026-05-26 09:22:59] [INFO ] [Real]Absence check using state equation in 1670 ms returned sat
[2026-05-26 09:22:59] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 195 ms.
[2026-05-26 09:23:00] [INFO ] Added : 0 causal constraints over 0 iterations in 604 ms. Result :sat
Minimization took 552 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[490] Max Struct:[500]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[500]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 97 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 194 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2026-05-26 09:23:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 09:23:12] [INFO ] Implicit Places using invariants in 3999 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 842, 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 868, 869, 870, 871, 872, 873, 874, 875, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 918, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 969, 970, 971, 972, 973, 974, 975, 976, 977, 978, 979, 980, 981, 982, 983, 984, 985, 986, 987, 988, 989, 990, 991, 992, 993, 994, 995, 996, 997, 998, 999]
Discarding 1000 places :
Implicit Place search using SMT only with invariants took 4027 ms to find 1000 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 92 ms. Remains 2000 /2000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4318 ms. Remains : 2000/3000 places, 2000/2000 transitions.
// Phase 1: matrix 2000 rows 2000 cols
[2026-05-26 09:23:12] [INFO ] Computed 1000 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[500]
FORMULA Philosophers-COL-001000-UpperBounds-06 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-UpperBounds-10 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-UpperBounds-12 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 383243 steps (1 resets) in 30001 ms. (12 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-26 09:23:42] [INFO ] Flatten gal took : 252 ms
[2026-05-26 09:23:42] [INFO ] Flatten gal took : 160 ms
[2026-05-26 09:23:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17467877704313545480.gal : 62 ms
[2026-05-26 09:23:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18183479854586378499.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17467877704313545480.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18183479854586378499.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 495255 ms.
BK_STOP 1779787423177
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-001000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is Philosophers-COL-001000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-smll-177969946300008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-001000.tgz
mv Philosophers-COL-001000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;