About the Execution of 2024-gold for Philosophers-COL-005000
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266000010.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Philosophers-COL-005000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266000010
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 227K May 29 14:32 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-005000-UpperBounds-00
FORMULA_NAME Philosophers-COL-005000-UpperBounds-01
FORMULA_NAME Philosophers-COL-005000-UpperBounds-02
FORMULA_NAME Philosophers-COL-005000-UpperBounds-03
FORMULA_NAME Philosophers-COL-005000-UpperBounds-04
FORMULA_NAME Philosophers-COL-005000-UpperBounds-05
FORMULA_NAME Philosophers-COL-005000-UpperBounds-06
FORMULA_NAME Philosophers-COL-005000-UpperBounds-07
FORMULA_NAME Philosophers-COL-005000-UpperBounds-08
FORMULA_NAME Philosophers-COL-005000-UpperBounds-09
FORMULA_NAME Philosophers-COL-005000-UpperBounds-10
FORMULA_NAME Philosophers-COL-005000-UpperBounds-11
FORMULA_NAME Philosophers-COL-005000-UpperBounds-12
FORMULA_NAME Philosophers-COL-005000-UpperBounds-13
FORMULA_NAME Philosophers-COL-005000-UpperBounds-14
FORMULA_NAME Philosophers-COL-005000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748889085239
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-005000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 18:31:26] [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]
[2025-06-02 18:31:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:31:26] [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.
[2025-06-02 18:31:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 18:31:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 594 ms
[2025-06-02 18:31:27] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25000 PT places and 25000.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 5
[2025-06-02 18:31:27] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2025-06-02 18:31:27] [INFO ] Skeletonized 5 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2025-06-02 18:31:27] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 5000, 0, 5000, 0] Max Struct:[5000, 5000, 2500, 5000, 5000]
FORMULA Philosophers-COL-005000-UpperBounds-09 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-11 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-14 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-15 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-07 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-02 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-04 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-06 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-01 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 18:31:27] [INFO ] Invariant cache hit.
[2025-06-02 18:31:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 18:31:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 18:31:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 18:31:27] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Minimization took 10 ms.
[2025-06-02 18:31:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 18:31:27] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 18:31:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 18:31:27] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2025-06-02 18:31:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 18:31:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 18:31:27] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 18:31:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 18:31:27] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2025-06-02 18:31:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 18:31:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 18:31:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 18:31:27] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0] Max Struct:[5000, 2500, 5000]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 5000) 5000) 5000)]] contains successor/predecessor on variables of sort Philo
[2025-06-02 18:31:27] [INFO ] Unfolded HLPN to a Petri net with 25000 places and 25000 transitions 80000 arcs in 225 ms.
[2025-06-02 18:31:27] [INFO ] Unfolded 3 HLPN properties in 2 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:[5000, 2500, 5000]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[5000, 2500, 5000]
// Phase 1: matrix 25000 rows 25000 cols
[2025-06-02 18:31:28] [INFO ] Computed 10000 invariants in 171 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[5000, 2500, 5000]
RANDOM walk for 10000 steps (2 resets) in 17110 ms. (0 steps per ms)
BEST_FIRST walk for 30003 steps (0 resets) in 8456 ms. (3 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1143, 421, 1153] Max Struct:[5000, 2500, 5000]
[2025-06-02 18:31:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : Max Seen:[1143, 421, 1153] Max Struct:[5000, 2500, 5000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1143, 421, 1153] Max Struct:[5000, 2500, 5000]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2675 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2692 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2025-06-02 18:32:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1143, 421, 1153] Max Struct:[5000, 2500, 5000]
RANDOM walk for 30606 steps (0 resets) in 30001 ms. (1 steps per ms)
BEST_FIRST walk for 58004 steps (0 resets) in 15610 ms. (3 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2021, 725, 1949] Max Struct:[5000, 2500, 5000]
[2025-06-02 18:32:51] [INFO ] Invariant cache hit.
[2025-06-02 18:33:08] [INFO ] [Real]Absence check using 10000 positive place invariants in 13601 ms returned sat
[2025-06-02 18:33:36] [INFO ] [Real]Absence check using state equation in 28472 ms returned unknown
[2025-06-02 18:33:46] [INFO ] [Real]Absence check using 10000 positive place invariants in 7059 ms returned sat
[2025-06-02 18:34:21] [INFO ] [Real]Absence check using state equation in 35000 ms returned unknown
[2025-06-02 18:34:37] [INFO ] [Real]Absence check using 10000 positive place invariants in 12917 ms returned sat
[2025-06-02 18:35:07] [INFO ] [Real]Absence check using state equation in 29040 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2021, 725, 1949] Max Struct:[5000, 2500, 5000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2021, 725, 1949] Max Struct:[5000, 2500, 5000]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2201 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2201 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2380 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2025-06-02 18:35:11] [INFO ] Invariant cache hit.
[2025-06-02 18:35:37] [INFO ] Implicit Places using invariants in 25502 ms returned []
Implicit Place search using SMT only with invariants took 25504 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2025-06-02 18:35:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30263 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30208 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 99156ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 99363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127310 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2025-06-02 18:37:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2021, 725, 1949] Max Struct:[5000, 2500, 5000]
RANDOM walk for 28698 steps (0 resets) in 30001 ms. (0 steps per ms)
BEST_FIRST walk for 54006 steps (0 resets) in 15714 ms. (3 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2021, 725, 2050] Max Struct:[5000, 2500, 5000]
[2025-06-02 18:38:02] [INFO ] Invariant cache hit.
[2025-06-02 18:38:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 15874 ms returned sat
[2025-06-02 18:38:47] [INFO ] [Real]Absence check using state equation in 25990 ms returned unknown
[2025-06-02 18:38:57] [INFO ] [Real]Absence check using 10000 positive place invariants in 6804 ms returned sat
[2025-06-02 18:39:32] [INFO ] [Real]Absence check using state equation in 34974 ms returned unknown
[2025-06-02 18:39:48] [INFO ] [Real]Absence check using 10000 positive place invariants in 12772 ms returned sat
[2025-06-02 18:40:17] [INFO ] [Real]Absence check using state equation in 29214 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2021, 725, 2050] Max Struct:[5000, 2500, 5000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2021, 725, 2050] Max Struct:[5000, 2500, 5000]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2257 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2257 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1579 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2025-06-02 18:40:21] [INFO ] Invariant cache hit.
[2025-06-02 18:40:48] [INFO ] Implicit Places using invariants in 27394 ms returned []
Implicit Place search using SMT only with invariants took 27395 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2025-06-02 18:40:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30221 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30193 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 101592ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 101740ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130751 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2025-06-02 18:42:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2021, 725, 2050] Max Struct:[5000, 2500, 5000]
RANDOM walk for 29133 steps (0 resets) in 30001 ms. (0 steps per ms)
BEST_FIRST walk for 54006 steps (0 resets) in 15486 ms. (3 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2021, 739, 2050] Max Struct:[5000, 2500, 5000]
[2025-06-02 18:43:16] [INFO ] Invariant cache hit.
[2025-06-02 18:43:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 14829 ms returned sat
[2025-06-02 18:44:01] [INFO ] [Real]Absence check using state equation in 27071 ms returned unknown
[2025-06-02 18:44:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 6627 ms returned sat
[2025-06-02 18:44:46] [INFO ] [Real]Absence check using state equation in 35177 ms returned unknown
[2025-06-02 18:45:02] [INFO ] [Real]Absence check using 10000 positive place invariants in 13085 ms returned sat
[2025-06-02 18:45:31] [INFO ] [Real]Absence check using state equation in 28867 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2021, 739, 2050] Max Struct:[5000, 2500, 5000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2021, 739, 2050] Max Struct:[5000, 2500, 5000]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1630 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1631 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1676 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2025-06-02 18:45:34] [INFO ] Invariant cache hit.
[2025-06-02 18:46:01] [INFO ] Implicit Places using invariants in 26942 ms returned []
Implicit Place search using SMT only with invariants took 26946 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2025-06-02 18:46:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30229 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30209 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 102094ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 102230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130879 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2025-06-02 18:47:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2021, 739, 2050] Max Struct:[5000, 2500, 5000]
RANDOM walk for 28686 steps (0 resets) in 30001 ms. (0 steps per ms)
BEST_FIRST walk for 52006 steps (0 resets) in 15318 ms. (3 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2023, 748, 2050] Max Struct:[5000, 2500, 5000]
[2025-06-02 18:48:29] [INFO ] Invariant cache hit.
[2025-06-02 18:48:47] [INFO ] [Real]Absence check using 10000 positive place invariants in 15169 ms returned sat
[2025-06-02 18:49:14] [INFO ] [Real]Absence check using state equation in 26900 ms returned unknown
[2025-06-02 18:49:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 7162 ms returned sat
[2025-06-02 18:49:59] [INFO ] [Real]Absence check using state equation in 34689 ms returned unknown
[2025-06-02 18:50:16] [INFO ] [Real]Absence check using 10000 positive place invariants in 13819 ms returned sat
[2025-06-02 18:50:44] [INFO ] [Real]Absence check using state equation in 28077 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2023, 748, 2050] Max Struct:[5000, 2500, 5000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2023, 748, 2050] Max Struct:[5000, 2500, 5000]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1466 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1466 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1451 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2025-06-02 18:50:47] [INFO ] Invariant cache hit.
[2025-06-02 18:51:14] [INFO ] Implicit Places using invariants in 27251 ms returned []
Implicit Place search using SMT only with invariants took 27252 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2025-06-02 18:51:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30218 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30209 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 98056ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 98195ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126919 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2025-06-02 18:52:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2023, 748, 2050] Max Struct:[5000, 2500, 5000]
RANDOM walk for 28190 steps (0 resets) in 30001 ms. (0 steps per ms)
BEST_FIRST walk for 51006 steps (0 resets) in 15489 ms. (3 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2023, 748, 2050] Max Struct:[5000, 2500, 5000]
[2025-06-02 18:53:38] [INFO ] Invariant cache hit.
[2025-06-02 18:53:57] [INFO ] [Real]Absence check using 10000 positive place invariants in 15240 ms returned sat
[2025-06-02 18:54:23] [INFO ] [Real]Absence check using state equation in 26491 ms returned unknown
[2025-06-02 18:54:33] [INFO ] [Real]Absence check using 10000 positive place invariants in 6627 ms returned sat
[2025-06-02 18:55:08] [INFO ] [Real]Absence check using state equation in 35253 ms returned unknown
[2025-06-02 18:55:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 12928 ms returned sat
[2025-06-02 18:55:53] [INFO ] [Real]Absence check using state equation in 29011 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2023, 748, 2050] Max Struct:[5000, 2500, 5000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2023, 748, 2050] Max Struct:[5000, 2500, 5000]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1637 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1639 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1583 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2025-06-02 18:55:56] [INFO ] Invariant cache hit.
[2025-06-02 18:56:24] [INFO ] Implicit Places using invariants in 27522 ms returned []
Implicit Place search using SMT only with invariants took 27523 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2025-06-02 18:56:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30211 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30181 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 106182ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 106316ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135453 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2025-06-02 18:58:13] [INFO ] Flatten gal took : 2428 ms
[2025-06-02 18:58:15] [INFO ] Flatten gal took : 1248 ms
[2025-06-02 18:58:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16042211544539626.gal : 329 ms
[2025-06-02 18:58:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13611491835643916973.prop : 89 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16042211544539626.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13611491835643916973.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
RANDOM walk for 32523 steps (8 resets) in 120012 ms. (0 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality13611491835643916973.prop.
BEST_FIRST walk for 40004 steps (0 resets) in 16251 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (0 resets) in 14115 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (0 resets) in 14540 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (0 resets) in 13760 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (0 resets) in 15244 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (0 resets) in 13429 ms. (2 steps per ms) remains 6/6 properties
Detected timeout of ITS tools.
[2025-06-02 18:59:06] [INFO ] Flatten gal took : 682 ms
[2025-06-02 18:59:06] [INFO ] Applying decomposition
[2025-06-02 18:59:07] [INFO ] Flatten gal took : 742 ms
BK_STOP 1748890797813
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-005000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Philosophers-COL-005000, 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 r167-tall-174881266000010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-005000.tgz
mv Philosophers-COL-005000 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 ;