Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000143.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 MedleyA-PT-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 33K 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 MedleyA-PT-06-ReachabilityFireability-2025-00
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-01
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-02
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-03
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-04
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-05
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-06
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-07
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-08
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-09
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-10
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-11
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-12
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-13
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-14
FORMULA_NAME MedleyA-PT-06-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748847961230

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-02 07:06:03] [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-02 07:06:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 07:06:04] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2025-06-02 07:06:04] [INFO ] Transformed 124 places.
[2025-06-02 07:06:04] [INFO ] Transformed 118 transitions.
[2025-06-02 07:06:04] [INFO ] Found NUPN structural information;
[2025-06-02 07:06:04] [INFO ] Parsed PT model containing 124 places and 118 transitions and 372 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 07:06:05] [INFO ] Flatten gal took : 104 ms
[2025-06-02 07:06:05] [INFO ] Flatten gal took : 43 ms
RANDOM walk for 40000 steps (1112 resets) in 2478 ms. (16 steps per ms) remains 12/16 properties
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 07:06:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5908872924327045123.gal : 32 ms
BEST_FIRST walk for 40003 steps (232 resets) in 660 ms. (60 steps per ms) remains 12/12 properties
[2025-06-02 07:06:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5734934701543579191.prop : 10 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/ReachabilityCardinality5908872924327045123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5734934701543579191.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
Loading property file /tmp/ReachabilityCardinality5734934701543579191.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 14
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :14 after 93
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :93 after 104
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :104 after 3374
BEST_FIRST walk for 40004 steps (240 resets) in 1030 ms. (38 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :3374 after 5854
BEST_FIRST walk for 40004 steps (240 resets) in 638 ms. (62 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (356 resets) in 547 ms. (72 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (219 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (361 resets) in 292 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (236 resets) in 117 ms. (339 steps per ms) remains 10/12 properties
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (253 resets) in 362 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (244 resets) in 179 ms. (222 steps per ms) remains 9/10 properties
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (298 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (205 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
// Phase 1: matrix 118 rows 124 cols
[2025-06-02 07:06:06] [INFO ] Computed 24 invariants in 23 ms
Excessive predecessor constraint size, skipping predecessor.
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/96 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem MedleyA-PT-06-ReachabilityFireability-2025-07 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :5854 after 369854
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem MedleyA-PT-06-ReachabilityFireability-2025-14 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 20/116 variables, 12/110 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 20/130 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 3/133 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem MedleyA-PT-06-ReachabilityFireability-2025-11 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 8/124 variables, 7/140 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 8/148 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 118/242 variables, 124/272 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 272 constraints, problems are : Problem set: 3 solved, 6 unsolved in 1728 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/76 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem MedleyA-PT-06-ReachabilityFireability-2025-02 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 37/112 variables, 12/88 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 37/125 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/128 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:08] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:09] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:09] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:09] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:09] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:09] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 11 ms to minimize.
Problem MedleyA-PT-06-ReachabilityFireability-2025-06 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-06-ReachabilityFireability-2025-13 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 6/134 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:09] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:09] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 2/136 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/136 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Problem MedleyA-PT-06-ReachabilityFireability-2025-04 is UNSAT
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 12/124 variables, 8/144 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 12/156 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/156 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 118/242 variables, 124/280 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 1/281 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/281 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/242 variables, 0/281 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 281 constraints, problems are : Problem set: 7 solved, 2 unsolved in 1241 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3124ms problems are : Problem set: 7 solved, 2 unsolved
Parikh walk visited 0 properties in 202 ms.
Support contains 35 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 118/118 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 118 transition count 116
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 116 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 114 transition count 114
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 114 transition count 111
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 111 transition count 111
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 27 place count 104 transition count 104
Iterating global reduction 3 with 7 rules applied. Total rules applied 34 place count 104 transition count 104
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 62 place count 90 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 89 transition count 90
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 89 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 87 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 87 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 86 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 71 place count 85 transition count 86
Applied a total of 71 rules in 94 ms. Remains 85 /124 variables (removed 39) and now considering 86/118 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 85/124 places, 86/118 transitions.
RANDOM walk for 40000 steps (1733 resets) in 514 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (291 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (317 resets) in 406 ms. (98 steps per ms) remains 2/2 properties
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :369854 after 416002
Interrupted probabilistic random walk after 2518261 steps, run timeout after 3001 ms. (steps per millisecond=839 ) properties seen :1 out of 2
Probabilistic random walk after 2518261 steps, saw 446985 distinct states, run finished after 3011 ms. (steps per millisecond=836 ) properties seen :1
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 86 rows 85 cols
[2025-06-02 07:06:13] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/44 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/54 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:13] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:13] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/77 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/83 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:13] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/83 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/85 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 86/171 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/171 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/171 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 106 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/44 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/54 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/77 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/83 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/83 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/85 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 86/171 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/171 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:14] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:14] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/171 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/171 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/171 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 634ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 86/86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 83 transition count 84
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 14 place count 73 transition count 63
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 73 transition count 63
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 24 place count 73 transition count 60
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 70 transition count 60
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 65 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 64 transition count 54
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 64 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 63 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 63 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 61 transition count 54
Free-agglomeration rule applied 5 times with reduction of 1 identical transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 61 transition count 48
Reduce places removed 5 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 59 place count 55 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 53 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 67 place count 50 transition count 45
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 50 transition count 43
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 74 place count 47 transition count 41
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 76 place count 46 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 76 place count 46 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 79 place count 44 transition count 39
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 80 place count 44 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 81 place count 43 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 82 place count 43 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 83 place count 42 transition count 37
Applied a total of 83 rules in 54 ms. Remains 42 /85 variables (removed 43) and now considering 37/86 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 42/85 places, 37/86 transitions.
RANDOM walk for 37059 steps (2390 resets) in 118 ms. (311 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-06-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 10340 ms.

BK_STOP 1748847974376

--------------------
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="MedleyA-PT-06"
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 MedleyA-PT-06, 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 r128-smll-174876524000143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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