fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r212-tall-174901993700134
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ShieldRVs-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 TTTFFTFFFTTT?TFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901993700134.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 ShieldRVs-PT-040A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901993700134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 217K 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 97K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 256K May 29 14:33 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 ShieldRVs-PT-040A-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749058823635

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-04 17:40:24] [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-04 17:40:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 17:40:25] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-06-04 17:40:25] [INFO ] Transformed 563 places.
[2025-06-04 17:40:25] [INFO ] Transformed 763 transitions.
[2025-06-04 17:40:25] [INFO ] Found NUPN structural information;
[2025-06-04 17:40:25] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (72 resets) in 2082 ms. (19 steps per ms) remains 5/15 properties
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 17:40:25] [INFO ] Flatten gal took : 331 ms
BEST_FIRST walk for 40004 steps (8 resets) in 454 ms. (87 steps per ms) remains 4/5 properties
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-04 17:40:25] [INFO ] Flatten gal took : 114 ms
[2025-06-04 17:40:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4613890068850740339.gal : 58 ms
BEST_FIRST walk for 40002 steps (8 resets) in 566 ms. (70 steps per ms) remains 4/4 properties
[2025-06-04 17:40:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9216800663144538870.prop : 8 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/ReachabilityCardinality4613890068850740339.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9216800663144538870.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 ...328
BEST_FIRST walk for 40004 steps (8 resets) in 592 ms. (67 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality9216800663144538870.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 3/4 properties
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,4 properties remain. new max is 4
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD size :3 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :69 after 206
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :206 after 1274
// Phase 1: matrix 763 rows 563 cols
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1274 after 57748
[2025-06-04 17:40:26] [INFO ] Computed 161 invariants in 15 ms
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :57748 after 628365
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :628365 after 6.55089e+06
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :6.55089e+06 after 6.06166e+08
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 164/257 variables, 69/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 164/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 306/563 variables, 92/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 306/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 763/1326 variables, 563/1287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 1287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 879 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 164/257 variables, 69/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 164/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:27] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:27] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 306/563 variables, 92/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 306/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:27] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:28] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:28] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:28] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:28] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:28] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:28] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:28] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:28] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:29] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:29] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:29] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:29] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:29] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:29] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:29] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:29] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:29] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:29] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:30] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 20/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:30] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 763/1326 variables, 563/1310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:30] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:30] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:30] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1326 variables, 3/1313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:30] [INFO ] Deduced a trap along path composed of 10 places in 36 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1326 variables, 1/1314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:31] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:31] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1326 variables, 2/1316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1326 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1326 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 1316 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4003 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4954ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 774 ms.
Support contains 93 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 56 times.
Drop transitions (Partial Free agglomeration) removed 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 58 place count 562 transition count 762
Applied a total of 58 rules in 142 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 562/563 places, 762/763 transitions.
RANDOM walk for 40000 steps (80 resets) in 632 ms. (63 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :6.06166e+08 after 5.72653e+10
Interrupted probabilistic random walk after 251444 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 2
Probabilistic random walk after 251444 steps, saw 55512 distinct states, run finished after 3005 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 762 rows 562 cols
[2025-06-04 17:40:35] [INFO ] Computed 161 invariants in 15 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 164/257 variables, 69/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 164/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 305/562 variables, 92/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 305/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 762/1324 variables, 562/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 1285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 511 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 164/257 variables, 69/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 164/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:36] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:36] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:36] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 305/562 variables, 92/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 305/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:36] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:36] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:37] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:37] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:37] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:37] [INFO ] Deduced a trap composed of 7 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-04 17:40:37] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:37] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:37] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:37] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 10/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 762/1324 variables, 562/1298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:37] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:38] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 2/1300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:38] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1324 variables, 1/1301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:38] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1324 variables, 1/1302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1324 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1324 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2265 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2834ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2025-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 802 ms.
Support contains 24 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 562 transition count 762
Applied a total of 14 rules in 74 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 562/562 places, 762/762 transitions.
RANDOM walk for 40000 steps (82 resets) in 379 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 301508 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 301508 steps, saw 68350 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
// Phase 1: matrix 762 rows 562 cols
[2025-06-04 17:40:42] [INFO ] Computed 161 invariants in 8 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 65/89 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 65/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 473/562 variables, 138/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 473/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 762/1324 variables, 562/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 1285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 65/89 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 65/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 473/562 variables, 138/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 473/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:43] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:44] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 11 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-04 17:40:45] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:45] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 4/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 762/1324 variables, 562/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:46] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:46] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:46] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:46] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:46] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:46] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:40:46] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 7/1316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1324 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1324 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3923 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 24 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 26 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 23 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2025-06-04 17:40:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:40:47] [INFO ] Implicit Places using invariants in 282 ms returned []
[2025-06-04 17:40:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 17:40:48] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 17:40:48] [INFO ] Redundant transitions in 125 ms returned []
Running 761 sub problems to find dead transitions.
[2025-06-04 17:40:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:12] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:12] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:13] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:13] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:13] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:13] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:13] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:13] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:14] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:14] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:14] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:14] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:14] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:15] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:15] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:15] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:15] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:15] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:15] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:16] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:16] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:16] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:16] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:16] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:16] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:17] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:17] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:17] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:17] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:17] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:17] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:17] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:18] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:18] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:18] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:18] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:18] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:18] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:41:18] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
SMT process timed out in 30334ms, After SMT, problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 30339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31392 ms. Remains : 562/562 places, 762/762 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 17:41:18] [INFO ] Flatten gal took : 65 ms
[2025-06-04 17:41:18] [INFO ] Applying decomposition
[2025-06-04 17:41:18] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6412410604752250070.txt' '-o' '/tmp/graph6412410604752250070.bin' '-w' '/tmp/graph6412410604752250070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6412410604752250070.bin' '-l' '-1' '-v' '-w' '/tmp/graph6412410604752250070.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:41:18] [INFO ] Decomposing Gal with order
[2025-06-04 17:41:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:41:19] [INFO ] Removed a total of 837 redundant transitions.
[2025-06-04 17:41:19] [INFO ] Flatten gal took : 130 ms
[2025-06-04 17:41:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 896 labels/synchronizations in 71 ms.
[2025-06-04 17:41:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16242412365587771711.gal : 13 ms
[2025-06-04 17:41:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14651297414772827440.prop : 0 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/ReachabilityCardinality16242412365587771711.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14651297414772827440.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality14651297414772827440.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 45
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :45 after 2599
Detected timeout of ITS tools.
[2025-06-04 18:11:23] [INFO ] Flatten gal took : 853 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15152762626321487801
[2025-06-04 18:11:23] [INFO ] Applying decomposition
[2025-06-04 18:11:23] [INFO ] Computing symmetric may disable matrix : 762 transitions.
[2025-06-04 18:11:23] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 18:11:24] [INFO ] Computing symmetric may enable matrix : 762 transitions.
[2025-06-04 18:11:24] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 18:11:24] [INFO ] Flatten gal took : 633 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15617945294669072907.txt' '-o' '/tmp/graph15617945294669072907.bin' '-w' '/tmp/graph15617945294669072907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15617945294669072907.bin' '-l' '-1' '-v' '-w' '/tmp/graph15617945294669072907.weights' '-q' '0' '-e' '0.001'
[2025-06-04 18:11:26] [INFO ] Decomposing Gal with order
[2025-06-04 18:11:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 18:11:27] [INFO ] Computing Do-Not-Accords matrix : 762 transitions.
[2025-06-04 18:11:27] [INFO ] Computation of Completed DNA matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 18:11:27] [INFO ] Built C files in 3785ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15152762626321487801
Running compilation step : cd /tmp/ltsmin15152762626321487801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-04 18:12:59] [INFO ] Removed a total of 866 redundant transitions.
[2025-06-04 18:12:59] [INFO ] Flatten gal took : 91796 ms
[2025-06-04 18:12:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 927 labels/synchronizations in 51 ms.
[2025-06-04 18:12:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2277743446792298598.gal : 6 ms
[2025-06-04 18:12:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12752632993789035371.prop : 0 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/ReachabilityCardinality2277743446792298598.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12752632993789035371.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality12752632993789035371.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :7 after 1343
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1343 after 1.73702e+37
Compilation finished in 93818 ms.
Running link step : cd /tmp/ltsmin15152762626321487801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 175 ms.
Running LTSmin : cd /tmp/ltsmin15152762626321487801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT040AReachabilityCardinality202512==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.119: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.204: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.519: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.748: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.748: Initializing POR dependencies: labels 763, guards 762
pins2lts-mc-linux64( 7/ 8), 0.903: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.990: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 2.179: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 2.939: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 15.305: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 15.560: "ShieldRVsPT040AReachabilityCardinality202512==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 15.561: "ShieldRVsPT040AReachabilityCardinality202512==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 15.561: "ShieldRVsPT040AReachabilityCardinality202512==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 15.562: "ShieldRVsPT040AReachabilityCardinality202512==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 15.562: "ShieldRVsPT040AReachabilityCardinality202512==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 15.575: "ShieldRVsPT040AReachabilityCardinality202512==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 15.563: "ShieldRVsPT040AReachabilityCardinality202512==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 15.576: There are 763 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 15.576: State length is 562, there are 762 groups
pins2lts-mc-linux64( 0/ 8), 15.576: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 15.576: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 15.576: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 15.576: Visible groups: 0 / 762, labels: 1 / 763
pins2lts-mc-linux64( 0/ 8), 15.576: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 15.576: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 15.565: "ShieldRVsPT040AReachabilityCardinality202512==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 15.798: ~8 levels ~960 states ~4088 transitions
pins2lts-mc-linux64( 7/ 8), 16.871: ~6 levels ~1920 states ~9888 transitions
pins2lts-mc-linux64( 6/ 8), 17.720: ~8 levels ~3840 states ~21328 transitions
pins2lts-mc-linux64( 7/ 8), 18.050: ~8 levels ~7680 states ~42544 transitions
pins2lts-mc-linux64( 7/ 8), 19.212: ~10 levels ~15360 states ~89216 transitions
pins2lts-mc-linux64( 7/ 8), 22.139: ~11 levels ~30720 states ~187480 transitions
pins2lts-mc-linux64( 7/ 8), 25.610: ~13 levels ~61440 states ~392944 transitions
pins2lts-mc-linux64( 7/ 8), 42.486: ~14 levels ~122880 states ~824768 transitions
pins2lts-mc-linux64( 1/ 8), 74.576: ~12 levels ~245760 states ~1733608 transitions
pins2lts-mc-linux64( 1/ 8), 127.464: ~13 levels ~491520 states ~3653320 transitions
pins2lts-mc-linux64( 3/ 8), 170.164: ~16 levels ~983040 states ~8017216 transitions
pins2lts-mc-linux64( 7/ 8), 244.277: ~18 levels ~1966080 states ~15789328 transitions
pins2lts-mc-linux64( 7/ 8), 398.573: ~19 levels ~3932160 states ~32847704 transitions
pins2lts-mc-linux64( 6/ 8), 600.309: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 600.590:
pins2lts-mc-linux64( 0/ 8), 600.590: mean standard work distribution: 2.6% (states) 0.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 600.590:
pins2lts-mc-linux64( 0/ 8), 600.590: Explored 6166761 states 54395728 transitions, fanout: 8.821
pins2lts-mc-linux64( 0/ 8), 600.590: Total exploration time 585.010 sec (584.760 sec minimum, 584.830 sec on average)
pins2lts-mc-linux64( 0/ 8), 600.590: States per second: 10541, Transitions per second: 92983
pins2lts-mc-linux64( 0/ 8), 600.590: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 600.590:
pins2lts-mc-linux64( 0/ 8), 600.590: Queue width: 8B, total height: 6241968, memory: 47.62MB
pins2lts-mc-linux64( 0/ 8), 600.590: Tree memory: 350.7MB, 29.6 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 600.590: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 600.590: Stored 783 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 600.590: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 600.590: Est. total memory use: 398.3MB (~1071.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15152762626321487801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT040AReachabilityCardinality202512==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15152762626321487801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT040AReachabilityCardinality202512==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ShieldRVs-PT-040A"
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 ShieldRVs-PT-040A, 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 r212-tall-174901993700134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040A.tgz
mv ShieldRVs-PT-040A 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 ;