Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K 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 107K 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-10-ReachabilityFireability-2025-00
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-01
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-02
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-03
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-04
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-05
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-06
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-07
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-08
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-09
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-10
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-11
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-12
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-13
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-14
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748857666213

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-02 09:47:48] [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 09:47:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:47:49] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2025-06-02 09:47:49] [INFO ] Transformed 149 places.
[2025-06-02 09:47:49] [INFO ] Transformed 340 transitions.
[2025-06-02 09:47:49] [INFO ] Found NUPN structural information;
[2025-06-02 09:47:49] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 441 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1738 resets) in 3867 ms. (10 steps per ms) remains 14/16 properties
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 09:47:50] [INFO ] Flatten gal took : 273 ms
[2025-06-02 09:47:50] [INFO ] Flatten gal took : 105 ms
BEST_FIRST walk for 40004 steps (458 resets) in 780 ms. (51 steps per ms) remains 14/14 properties
[2025-06-02 09:47:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5256178264023070783.gal : 78 ms
BEST_FIRST walk for 40003 steps (427 resets) in 430 ms. (92 steps per ms) remains 14/14 properties
[2025-06-02 09:47:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16565406267627185102.prop : 16 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/ReachabilityCardinality5256178264023070783.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16565406267627185102.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (430 resets) in 229 ms. (173 steps per ms) remains 14/14 properties
Loading property file /tmp/ReachabilityCardinality16565406267627185102.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :7 after 17
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :17 after 40
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :40 after 97
BEST_FIRST walk for 40004 steps (449 resets) in 897 ms. (44 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :97 after 2769
BEST_FIRST walk for 40004 steps (406 resets) in 245 ms. (162 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :2769 after 4119
BEST_FIRST walk for 40004 steps (428 resets) in 200 ms. (199 steps per ms) remains 14/14 properties
Reachability property MedleyA-PT-10-ReachabilityFireability-2025-11 is true.
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property MedleyA-PT-10-ReachabilityFireability-2025-03 is true.
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property MedleyA-PT-10-ReachabilityFireability-2025-02 does not hold.
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :4119 after 36674
BEST_FIRST walk for 40002 steps (418 resets) in 1635 ms. (24 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (404 resets) in 280 ms. (142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (451 resets) in 526 ms. (75 steps per ms) remains 14/14 properties
Reachability property MedleyA-PT-10-ReachabilityFireability-2025-15 is true.
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
BEST_FIRST walk for 40003 steps (444 resets) in 287 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (376 resets) in 303 ms. (131 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (422 resets) in 229 ms. (173 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (359 resets) in 145 ms. (273 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (374 resets) in 289 ms. (137 steps per ms) remains 14/14 properties
// Phase 1: matrix 340 rows 149 cols
[2025-06-02 09:47:52] [INFO ] Computed 12 invariants in 26 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Invariant property MedleyA-PT-10-ReachabilityFireability-2025-08 does not hold.
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property MedleyA-PT-10-ReachabilityFireability-2025-07 is true.
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 1/82 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Reachability property MedleyA-PT-10-ReachabilityFireability-2025-04 is true.
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :36674 after 90239
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem MedleyA-PT-10-ReachabilityFireability-2025-00 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-10-ReachabilityFireability-2025-01 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-10-ReachabilityFireability-2025-10 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-10-ReachabilityFireability-2025-13 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 46/127 variables, 7/89 constraints. Problems are: Problem set: 7 solved, 3 unsolved
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :90239 after 114739
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 46/135 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/135 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Problem MedleyA-PT-10-ReachabilityFireability-2025-05 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 22/149 variables, 4/139 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 22/161 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/161 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 340/489 variables, 149/310 constraints. Problems are: Problem set: 8 solved, 2 unsolved
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :114739 after 401675
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/310 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/489 variables, 0/310 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 310 constraints, problems are : Problem set: 8 solved, 2 unsolved in 1072 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 73/119 variables, 7/53 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 73/126 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/126 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/149 variables, 5/131 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 30/161 constraints. Problems are: Problem set: 8 solved, 2 unsolved
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :401675 after 617976
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/161 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 340/489 variables, 149/310 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/310 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/489 variables, 0/310 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 489/489 variables, and 310 constraints, problems are : Problem set: 8 solved, 2 unsolved in 890 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2169ms problems are : Problem set: 8 solved, 2 unsolved
Parikh walk visited 0 properties in 152 ms.
Support contains 46 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 340/340 transitions.
Graph (complete) has 543 edges and 149 vertex of which 144 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 144 transition count 334
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 141 transition count 334
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 141 transition count 329
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 136 transition count 329
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 51 place count 103 transition count 290
Iterating global reduction 2 with 33 rules applied. Total rules applied 84 place count 103 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 87 place count 103 transition count 287
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 92 place count 98 transition count 275
Iterating global reduction 3 with 5 rules applied. Total rules applied 97 place count 98 transition count 275
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 97 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 97 transition count 273
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 107 place count 93 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 93 transition count 263
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 113 place count 93 transition count 261
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 91 transition count 261
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 91 transition count 258
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 88 transition count 258
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 130 place count 88 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 87 transition count 257
Applied a total of 131 rules in 165 ms. Remains 87 /149 variables (removed 62) and now considering 257/340 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 87/149 places, 257/340 transitions.
RANDOM walk for 40000 steps (2588 resets) in 358 ms. (111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (389 resets) in 428 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (548 resets) in 145 ms. (273 steps per ms) remains 1/2 properties
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 257 rows 87 cols
[2025-06-02 09:47:55] [INFO ] Computed 11 invariants in 4 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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/69 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/86 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 257/343 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :617976 after 1.4757e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/344 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/69 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/86 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 257/343 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/344 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/344 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 686ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
FORMULA MedleyA-PT-10-ReachabilityFireability-2025-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 11 ms.
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 7340 ms.

BK_STOP 1748857676475

--------------------
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-10"
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-10, 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-174876524100175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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