Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812900606.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 itstools
Input is Peterson-PT-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812900606
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K 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 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 237K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 284K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 143K 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 booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-00
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-01
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-02
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-03
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-04
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-05
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-06
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-07
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-08
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-09
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-10
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-11
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-12
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-13
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-14
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748942158585

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-03 09:15:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 09:15:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:15:59] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-06-03 09:15:59] [INFO ] Transformed 244 places.
[2025-06-03 09:15:59] [INFO ] Transformed 332 transitions.
[2025-06-03 09:15:59] [INFO ] Found NUPN structural information;
[2025-06-03 09:16:00] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1549 ms. (25 steps per ms) remains 9/10 properties
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 9/9 properties
[2025-06-03 09:16:00] [INFO ] Flatten gal took : 104 ms
[2025-06-03 09:16:00] [INFO ] Flatten gal took : 44 ms
[2025-06-03 09:16:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12094998159028767565.gal : 31 ms
[2025-06-03 09:16:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8064358476826614631.prop : 15 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/ReachabilityCardinality12094998159028767565.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8064358476826614631.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8064358476826614631.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 1060 ms. (37 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :9 after 39
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :39 after 53
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :53 after 116
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :116 after 213
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :213 after 1126
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1126 after 4159
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :4159 after 8058
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
[2025-06-03 09:16:01] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2025-06-03 09:16:01] [INFO ] Computed 15 invariants in 10 ms
[2025-06-03 09:16:01] [INFO ] State equation strengthened by 57 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :8058 after 33592
Problem Peterson-PT-3-ReachabilityCardinality-2025-02 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-3-ReachabilityCardinality-2025-06 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-3-ReachabilityCardinality-2025-01 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem Peterson-PT-3-ReachabilityCardinality-2025-05 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-3-ReachabilityCardinality-2025-07 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 5/234 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/234 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/240 variables, 6/240 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/251 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 4/244 variables, 4/255 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 4/259 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/259 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 308/552 variables, 244/503 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 57/560 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/560 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/552 variables, 0/560 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 560 constraints, problems are : Problem set: 5 solved, 4 unsolved in 908 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 5 solved, 4 unsolved
SDD proceeding with computation,9 properties remain. new max is 16384
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 5 solved, 4 unsolved
SDD size :33592 after 136278
Problem Peterson-PT-3-ReachabilityCardinality-2025-13 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 179/238 variables, 9/68 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 179/247 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:02] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:02] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:02] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:02] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 4/251 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/251 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/240 variables, 2/253 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/255 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:03] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:03] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:03] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:03] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 4/259 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/259 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/244 variables, 4/263 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 4/267 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:03] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:03] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:03] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:04] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:04] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:04] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:04] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:04] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:04] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:04] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:04] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:04] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 10 ms to minimize.
Invariant property Peterson-PT-3-ReachabilityCardinality-2025-10 does not hold.
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:04] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 6 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :136278 after 341876
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:05] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 14/281 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:05] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:05] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:05] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:05] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 4/285 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/285 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 308/552 variables, 244/529 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 57/586 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 2/588 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:16:06] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/552 variables, 1/589 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/552 variables, 0/589 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/552 variables, 0/589 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 589 constraints, problems are : Problem set: 7 solved, 2 unsolved in 4203 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5206ms problems are : Problem set: 7 solved, 2 unsolved
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 90 ms.
Support contains 14 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 244 transition count 253
Reduce places removed 79 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 83 rules applied. Total rules applied 162 place count 165 transition count 249
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 166 place count 161 transition count 249
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 166 place count 161 transition count 204
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 256 place count 116 transition count 204
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 278 place count 105 transition count 193
Applied a total of 278 rules in 46 ms. Remains 105 /244 variables (removed 139) and now considering 193/332 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 105/244 places, 193/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Invariant property Peterson-PT-3-ReachabilityCardinality-2025-08 does not hold.
Finished probabilistic random walk after 134438 steps, run visited all 1 properties in 238 ms. (steps per millisecond=564 )
Probabilistic random walk after 134438 steps, saw 27027 distinct states, run finished after 242 ms. (steps per millisecond=555 ) properties seen :1
FORMULA Peterson-PT-3-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,7 properties remain. new max is 16384
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 7397 ms.

BK_STOP 1748942167232

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="Peterson-PT-3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-PT-3, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812900606"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;