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

About the Execution of ITS-Tools for QuasiCertifProtocol-PT-22

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 ?FTF???T???T?F?F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254700815.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 QuasiCertifProtocol-PT-22, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254700815
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 26K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 187K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 39K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 171K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 147K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 950K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 270K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 503K 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 QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-00
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-01
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-02
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-03
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-04
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-05
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-06
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-07
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-08
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-09
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-10
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-11
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-12
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-13
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-14
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749150207683

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-05 19:03:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 19:03:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 19:03:29] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-06-05 19:03:29] [INFO ] Transformed 1966 places.
[2025-06-05 19:03:29] [INFO ] Transformed 356 transitions.
[2025-06-05 19:03:29] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1485 resets) in 1993 ms. (20 steps per ms) remains 14/14 properties
[2025-06-05 19:03:29] [INFO ] Flatten gal took : 297 ms
BEST_FIRST walk for 40004 steps (68 resets) in 679 ms. (58 steps per ms) remains 14/14 properties
[2025-06-05 19:03:30] [INFO ] Flatten gal took : 98 ms
[2025-06-05 19:03:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5438617693029807922.gal : 100 ms
[2025-06-05 19:03:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10522753381623539473.prop : 28 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/ReachabilityCardinality5438617693029807922.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10522753381623539473.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (45 resets) in 1526 ms. (26 steps per ms) remains 14/14 properties

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
BEST_FIRST walk for 40004 steps (90 resets) in 182 ms. (218 steps per ms) remains 14/14 properties
Loading property file /tmp/ReachabilityCardinality10522753381623539473.prop.
BEST_FIRST walk for 40004 steps (85 resets) in 1072 ms. (37 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (88 resets) in 251 ms. (158 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :16 after 64
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :64 after 988116
BEST_FIRST walk for 40004 steps (32 resets) in 3687 ms. (10 steps per ms) remains 13/14 properties
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (70 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (69 resets) in 74 ms. (533 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (70 resets) in 970 ms. (41 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (69 resets) in 308 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (68 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (72 resets) in 262 ms. (152 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 530 ms. (75 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :1.33809e+07 after 1.3466e+07
Interrupted probabilistic random walk after 1748074 steps, run timeout after 9001 ms. (steps per millisecond=194 ) properties seen :0 out of 13
Probabilistic random walk after 1748074 steps, saw 238877 distinct states, run finished after 9007 ms. (steps per millisecond=194 ) properties seen :0
// Phase 1: matrix 356 rows 1966 cols
[2025-06-05 19:03:41] [INFO ] Computed 1611 invariants in 96 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1431 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :1.3466e+07 after 1.34661e+07
At refinement iteration 1 (INCLUDED_ONLY) 0/1431 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 29/1460 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1460 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 103/1563 variables, 1190/1215 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1563/2322 variables, and 1215 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1212/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 13/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1431 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1431 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :1.34661e+07 after 1.34666e+07
At refinement iteration 2 (OVERLAPS) 29/1460 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:48] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:48] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:49] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:49] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:49] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:49] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:49] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:49] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:50] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:50] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:50] [INFO ] Deduced a trap composed of 8 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-05 19:03:50] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:50] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:50] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:50] [INFO ] Deduced a trap composed of 8 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-05 19:03:50] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:50] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:51] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:51] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:03:51] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1460 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1460/2322 variables, and 45 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 22/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10259ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1431 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1916 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.8 ms
Discarding 50 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1916 transition count 354
Applied a total of 3 rules in 96 ms. Remains 1916 /1966 variables (removed 50) and now considering 354/356 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 1916/1966 places, 354/356 transitions.
RANDOM walk for 40000 steps (1543 resets) in 695 ms. (57 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (72 resets) in 223 ms. (178 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (48 resets) in 1195 ms. (33 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (88 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :1.34666e+07 after 1.54288e+07
BEST_FIRST walk for 40004 steps (93 resets) in 1045 ms. (38 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (93 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (71 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (71 resets) in 206 ms. (193 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 378 ms. (105 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (71 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 407 ms. (98 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (48 resets) in 647 ms. (61 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (48 resets) in 229 ms. (173 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 393805 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 13
Probabilistic random walk after 393805 steps, saw 60482 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
// Phase 1: matrix 354 rows 1916 cols
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :1.54288e+07 after 2.90536e+07
[2025-06-05 19:03:57] [INFO ] Computed 1563 invariants in 54 ms
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/1431 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1431 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 79/1510 variables, 661/1167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :2.90536e+07 after 1.35348e+08
At refinement iteration 3 (INCLUDED_ONLY) 0/1510 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 405/1915 variables, 396/1563 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :1.35348e+08 after 3.6931e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/1915 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :3.6931e+08 after 1.71689e+09
Problem QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-11 is UNSAT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-13 is UNSAT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-15 is UNSAT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 354/2269 variables, 1915/3478 constraints. Problems are: Problem set: 3 solved, 10 unsolved
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :1.71689e+09 after 2.19091e+10
At refinement iteration 7 (INCLUDED_ONLY) 0/2269 variables, 0/3478 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-01 is UNSAT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :2.19091e+10 after 8.8616e+10
At refinement iteration 8 (OVERLAPS) 1/2270 variables, 1/3479 constraints. Problems are: Problem set: 4 solved, 9 unsolved
SDD proceeding with computation,14 properties remain. new max is 131072
SDD size :8.8616e+10 after 2.1438e+11
At refinement iteration 9 (INCLUDED_ONLY) 0/2270 variables, 0/3479 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2270 variables, 0/3479 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2270/2270 variables, and 3479 constraints, problems are : Problem set: 4 solved, 9 unsolved in 19855 ms.
Refiners :[Generalized P Invariants (flows): 1563/1563 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 13/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 484/484 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/484 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 259/1126 variables, 337/821 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1126 variables, 0/821 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 771/1897 variables, 742/1563 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1897 variables, 0/1563 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 353/2250 variables, 1897/3460 constraints. Problems are: Problem set: 4 solved, 9 unsolved
SDD proceeding with computation,14 properties remain. new max is 262144
SDD size :2.1438e+11 after 7.54854e+11
At refinement iteration 7 (INCLUDED_ONLY) 0/2250 variables, 4/3464 constraints. Problems are: Problem set: 4 solved, 9 unsolved
SDD proceeding with computation,14 properties remain. new max is 524288
SDD size :7.54854e+11 after 1.6863e+12
At refinement iteration 8 (INCLUDED_ONLY) 0/2250 variables, 0/3464 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 20/2270 variables, 19/3483 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2270/2270 variables, and 3484 constraints, problems are : Problem set: 4 solved, 9 unsolved in 45036 ms.
Refiners :[Generalized P Invariants (flows): 1563/1563 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65053ms problems are : Problem set: 4 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 867 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 354/354 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1916 transition count 353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 1916 transition count 352
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 1915 transition count 352
Applied a total of 3 rules in 163 ms. Remains 1915 /1916 variables (removed 1) and now considering 352/354 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1915/1916 places, 352/354 transitions.
RANDOM walk for 40000 steps (1542 resets) in 985 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (72 resets) in 279 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (89 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (89 resets) in 1183 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (94 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (73 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (71 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (72 resets) in 243 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (73 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 580 ms. (68 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 524499 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 9
Probabilistic random walk after 524499 steps, saw 79178 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
// Phase 1: matrix 352 rows 1915 cols
[2025-06-05 19:05:06] [INFO ] Computed 1564 invariants in 75 ms
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/867 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 253/1120 variables, 338/822 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1120 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 778/1898 variables, 742/1564 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1898 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 352/2250 variables, 1898/3462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2250 variables, 0/3462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 17/2267 variables, 17/3479 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2267 variables, 0/3479 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2267 variables, 0/3479 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2267/2267 variables, and 3479 constraints, problems are : Problem set: 0 solved, 9 unsolved in 13149 ms.
Refiners :[Generalized P Invariants (flows): 1564/1564 constraints, State Equation: 1915/1915 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 253/1120 variables, 338/822 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1120 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 778/1898 variables, 742/1564 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1898 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 352/2250 variables, 1898/3462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,14 properties remain. new max is 1048576
SDD size :1.6863e+12 after 5.86166e+12
At refinement iteration 7 (INCLUDED_ONLY) 0/2250 variables, 5/3467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2250 variables, 0/3467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 17/2267 variables, 17/3484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2267/2267 variables, and 3484 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75023 ms.
Refiners :[Generalized P Invariants (flows): 1564/1564 constraints, State Equation: 1915/1915 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88293ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 867 out of 1915 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1915/1915 places, 352/352 transitions.
Applied a total of 0 rules in 29 ms. Remains 1915 /1915 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1915/1915 places, 352/352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1915/1915 places, 352/352 transitions.
Applied a total of 0 rules in 104 ms. Remains 1915 /1915 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2025-06-05 19:06:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:06:36] [INFO ] Implicit Places using invariants in 1728 ms returned [156, 160]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1737 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1913/1915 places, 352/352 transitions.
Applied a total of 0 rules in 42 ms. Remains 1913 /1913 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1885 ms. Remains : 1913/1915 places, 352/352 transitions.
RANDOM walk for 40000 steps (1542 resets) in 810 ms. (49 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (72 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (93 resets) in 959 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (92 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (72 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (72 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (73 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (72 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 426 ms. (93 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 621915 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 9
Probabilistic random walk after 621915 steps, saw 92580 distinct states, run finished after 3003 ms. (steps per millisecond=207 ) properties seen :0
// Phase 1: matrix 352 rows 1913 cols
[2025-06-05 19:06:40] [INFO ] Computed 1562 invariants in 43 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 258/1125 variables, 337/821 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1125 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 771/1896 variables, 741/1562 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1896 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 352/2248 variables, 1896/3458 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2248 variables, 0/3458 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 17/2265 variables, 17/3475 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2265 variables, 0/3475 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2265 variables, 0/3475 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2265/2265 variables, and 3475 constraints, problems are : Problem set: 0 solved, 9 unsolved in 15376 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1913/1913 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 258/1125 variables, 337/821 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1125 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 771/1896 variables, 741/1562 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1896 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 352/2248 variables, 1896/3458 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2248 variables, 5/3463 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2248 variables, 0/3463 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 17/2265 variables, 17/3480 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2265 variables, 0/3480 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,14 properties remain. new max is 2097152
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2265/2265 variables, and 3480 constraints, problems are : Problem set: 0 solved, 9 unsolved in 90016 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1913/1913 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105474ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 867 out of 1913 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1913/1913 places, 352/352 transitions.
Applied a total of 0 rules in 24 ms. Remains 1913 /1913 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1913/1913 places, 352/352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1913/1913 places, 352/352 transitions.
Applied a total of 0 rules in 23 ms. Remains 1913 /1913 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2025-06-05 19:08:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD size :5.86166e+12 after 1.37527e+13
[2025-06-05 19:08:27] [INFO ] Implicit Places using invariants in 1666 ms returned []
[2025-06-05 19:08:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:08:30] [INFO ] Implicit Places using invariants and state equation in 3105 ms returned [1153, 1160, 1161, 1162, 1163, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1178, 1180, 1182, 1183]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 4779 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1893/1913 places, 352/352 transitions.
Applied a total of 0 rules in 48 ms. Remains 1893 /1893 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4856 ms. Remains : 1893/1913 places, 352/352 transitions.
RANDOM walk for 40000 steps (1537 resets) in 638 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (73 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (95 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (94 resets) in 935 ms. (42 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (93 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (74 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (71 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (74 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (72 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 438 ms. (91 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 629371 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :0 out of 9
Probabilistic random walk after 629371 steps, saw 93834 distinct states, run finished after 3003 ms. (steps per millisecond=209 ) properties seen :0
// Phase 1: matrix 352 rows 1893 cols
[2025-06-05 19:08:34] [INFO ] Computed 1542 invariants in 13 ms
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 256/1123 variables, 336/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1123 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 753/1876 variables, 722/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1876 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 352/2228 variables, 1876/3418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2228 variables, 0/3418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 17/2245 variables, 17/3435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2245 variables, 0/3435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2245 variables, 0/3435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2245/2245 variables, and 3435 constraints, problems are : Problem set: 0 solved, 9 unsolved in 14087 ms.
Refiners :[Generalized P Invariants (flows): 1542/1542 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 256/1123 variables, 336/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1123 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 753/1876 variables, 722/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1876 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 352/2228 variables, 1876/3418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2228 variables, 5/3423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2228 variables, 0/3423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 17/2245 variables, 17/3440 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2245 variables, 0/3440 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/2245 variables, 0/3440 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2245/2245 variables, and 3440 constraints, problems are : Problem set: 0 solved, 9 unsolved in 105020 ms.
Refiners :[Generalized P Invariants (flows): 1542/1542 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 119155ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 867 out of 1893 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1893/1893 places, 352/352 transitions.
Applied a total of 0 rules in 40 ms. Remains 1893 /1893 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1893/1893 places, 352/352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1893/1893 places, 352/352 transitions.
Applied a total of 0 rules in 26 ms. Remains 1893 /1893 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2025-06-05 19:10:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:10:35] [INFO ] Implicit Places using invariants in 1421 ms returned []
[2025-06-05 19:10:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:10:38] [INFO ] Implicit Places using invariants and state equation in 3220 ms returned []
Implicit Place search using SMT with State Equation took 4644 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:10:38] [INFO ] Redundant transitions in 32 ms returned []
Running 328 sub problems to find dead transitions.
[2025-06-05 19:10:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1542/1542 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 352/2244 variables, 1892/3434 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2244/2245 variables, and 3434 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 1542/1542 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1542/1542 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 352/2244 variables, 1892/3434 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2244 variables, 328/3762 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2244/2245 variables, and 3762 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 1542/1542 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65020 ms. Remains : 1893/1893 places, 352/352 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 19:11:39] [INFO ] Flatten gal took : 66 ms
[2025-06-05 19:11:39] [INFO ] Applying decomposition
[2025-06-05 19:11:39] [INFO ] Flatten gal took : 58 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/graph5302453191618940207.txt' '-o' '/tmp/graph5302453191618940207.bin' '-w' '/tmp/graph5302453191618940207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5302453191618940207.bin' '-l' '-1' '-v' '-w' '/tmp/graph5302453191618940207.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:11:39] [INFO ] Decomposing Gal with order
[2025-06-05 19:11:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:11:39] [INFO ] Removed a total of 156 redundant transitions.
[2025-06-05 19:11:40] [INFO ] Flatten gal took : 252 ms
[2025-06-05 19:11:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 103 ms.
[2025-06-05 19:11:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3561579197513087312.gal : 26 ms
[2025-06-05 19:11:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12122370654305644410.prop : 4 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/ReachabilityCardinality3561579197513087312.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12122370654305644410.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/ReachabilityCardinality12122370654305644410.prop.
Detected timeout of ITS tools.
[2025-06-05 19:41:40] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12550569853054294487
[2025-06-05 19:41:40] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2025-06-05 19:41:40] [INFO ] Applying decomposition
[2025-06-05 19:41:40] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:41:40] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2025-06-05 19:41:40] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:41:40] [INFO ] Flatten gal took : 83 ms
[2025-06-05 19:41:40] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2025-06-05 19:41:40] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:41:40] [INFO ] Built C files in 257ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12550569853054294487
Running compilation step : cd /tmp/ltsmin12550569853054294487;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '80' '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'
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/graph864602030561075883.txt' '-o' '/tmp/graph864602030561075883.bin' '-w' '/tmp/graph864602030561075883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph864602030561075883.bin' '-l' '-1' '-v' '-w' '/tmp/graph864602030561075883.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:41:40] [INFO ] Decomposing Gal with order
[2025-06-05 19:41:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:41:41] [INFO ] Removed a total of 229 redundant transitions.
[2025-06-05 19:41:41] [INFO ] Flatten gal took : 105 ms
[2025-06-05 19:41:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 32 ms.
[2025-06-05 19:41:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability530127839489133681.gal : 13 ms
[2025-06-05 19:41:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16293108003841499553.prop : 2 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/ReachabilityFireability530127839489133681.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16293108003841499553.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 ...307
Loading property file /tmp/ReachabilityFireability16293108003841499553.prop.
Compilation finished in 2174 ms.
Running link step : cd /tmp/ltsmin12550569853054294487;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202500==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202500==true'
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202504==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202504==true'
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202505==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202505==true'
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202506==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202506==true'
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202508==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202508==true'
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202509==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202509==true'
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202510==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202510==true'
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202512==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202512==true'
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202514==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202514==true'
Retrying LTSmin with larger timeout 3200 s
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202500==true'
WARNING : LTSmin timed out (>355 s) on command cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202500==true'
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202504==true'
WARNING : LTSmin timed out (>355 s) on command cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202504==true'
Running LTSmin : cd /tmp/ltsmin12550569853054294487;'/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' 'QuasiCertifProtocolPT22ReachabilityFireability202505==true'

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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="QuasiCertifProtocol-PT-22"
export BK_EXAMINATION="ReachabilityFireability"
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 QuasiCertifProtocol-PT-22, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254700815"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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