About the Execution of ITS-Tools for MedleyB-PT-B04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 26983.00 | 0.00 | 0.00 | TTFTFFFFTTTFTFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900455.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 MedleyB-PT-B04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900455
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.5K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 10K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 1005K Jun 5 20:08 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 MedleyB-PT-B04-ReachabilityFireability-2025-00
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-01
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-02
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-03
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-04
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-05
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-06
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-07
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-08
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-09
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-10
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-11
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-12
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-13
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-14
FORMULA_NAME MedleyB-PT-B04-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749390645098
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-08 13:50:47] [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-08 13:50:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 13:50:47] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2025-06-08 13:50:47] [INFO ] Transformed 829 places.
[2025-06-08 13:50:47] [INFO ] Transformed 2410 transitions.
[2025-06-08 13:50:47] [INFO ] Found NUPN structural information;
[2025-06-08 13:50:47] [INFO ] Parsed PT model containing 829 places and 2410 transitions and 20118 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (376 resets) in 1886 ms. (21 steps per ms) remains 14/16 properties
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (59 resets) in 424 ms. (94 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (60 resets) in 336 ms. (118 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (57 resets) in 175 ms. (227 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (44 resets) in 164 ms. (242 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (58 resets) in 398 ms. (100 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (60 resets) in 252 ms. (158 steps per ms) remains 14/14 properties
[2025-06-08 13:50:48] [INFO ] Flatten gal took : 699 ms
BEST_FIRST walk for 40003 steps (58 resets) in 625 ms. (63 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (59 resets) in 433 ms. (92 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (40 resets) in 383 ms. (104 steps per ms) remains 14/14 properties
[2025-06-08 13:50:49] [INFO ] Flatten gal took : 349 ms
BEST_FIRST walk for 40004 steps (59 resets) in 213 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (57 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (58 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
[2025-06-08 13:50:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9046986525757994256.gal : 170 ms
BEST_FIRST walk for 40004 steps (60 resets) in 249 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (59 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
[2025-06-08 13:50:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2215081355041030556.prop : 3 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/ReachabilityCardinality9046986525757994256.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2215081355041030556.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
// Phase 1: matrix 2410 rows 829 cols
[2025-06-08 13:50:49] [INFO ] Computed 7 invariants in 61 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.
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/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Loading property file /tmp/ReachabilityCardinality2215081355041030556.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem MedleyB-PT-B04-ReachabilityFireability-2025-06 is UNSAT
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B04-ReachabilityFireability-2025-11 is UNSAT
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B04-ReachabilityFireability-2025-14 is UNSAT
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 744/829 variables, 7/92 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/829 variables, 744/836 constraints. Problems are: Problem set: 3 solved, 11 unsolved
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 10
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :13 after 16
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :16 after 17
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :17 after 149
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :149 after 2115
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :2115 after 9107
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :9107 after 11918
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :11918 after 16390
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :16390 after 43196
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :43196 after 377166
At refinement iteration 4 (INCLUDED_ONLY) 0/829 variables, 0/836 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2410/3239 variables, 829/1665 constraints. Problems are: Problem set: 3 solved, 11 unsolved
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :377166 after 1.26057e+08
At refinement iteration 6 (INCLUDED_ONLY) 0/3239 variables, 0/1665 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3239/3239 variables, and 1665 constraints, problems are : Problem set: 3 solved, 11 unsolved in 6152 ms.
Refiners :[Domain max(s): 829/829 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 829/829 constraints, PredecessorRefiner: 14/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem MedleyB-PT-B04-ReachabilityFireability-2025-00 is UNSAT
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 759/829 variables, 7/77 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/829 variables, 759/836 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:50:57] [INFO ] Deduced a trap composed of 190 places in 574 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :1.26057e+08 after 3.12073e+09
[2025-06-08 13:50:58] [INFO ] Deduced a trap composed of 190 places in 681 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:50:58] [INFO ] Deduced a trap composed of 191 places in 478 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/829 variables, 3/839 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/829 variables, 0/839 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2410/3239 variables, 829/1668 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3239 variables, 2/1670 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3239/3239 variables, and 1670 constraints, problems are : Problem set: 4 solved, 10 unsolved in 5033 ms.
Refiners :[Domain max(s): 829/829 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 829/829 constraints, PredecessorRefiner: 11/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11393ms problems are : Problem set: 4 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 829/829 places, 2410/2410 transitions.
Graph (trivial) has 670 edges and 829 vertex of which 100 / 829 are part of one of the 16 SCC in 7 ms
Free SCC test removed 84 places
Drop transitions (Empty/Sink Transition effects.) removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Graph (complete) has 1556 edges and 745 vertex of which 734 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.18 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 401 rules applied. Total rules applied 403 place count 734 transition count 1895
Reduce places removed 396 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 408 rules applied. Total rules applied 811 place count 338 transition count 1883
Reduce places removed 6 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 2 with 51 rules applied. Total rules applied 862 place count 332 transition count 1838
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 907 place count 287 transition count 1838
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 907 place count 287 transition count 1799
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 985 place count 248 transition count 1799
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 1044 place count 189 transition count 1740
Iterating global reduction 4 with 59 rules applied. Total rules applied 1103 place count 189 transition count 1740
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1108 place count 189 transition count 1735
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1113 place count 184 transition count 1719
Iterating global reduction 5 with 5 rules applied. Total rules applied 1118 place count 184 transition count 1719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1119 place count 184 transition count 1718
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1120 place count 183 transition count 1717
Iterating global reduction 6 with 1 rules applied. Total rules applied 1121 place count 183 transition count 1717
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 1161 place count 163 transition count 1697
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1163 place count 161 transition count 1695
Iterating global reduction 6 with 2 rules applied. Total rules applied 1165 place count 161 transition count 1695
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1173 place count 157 transition count 1703
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1176 place count 157 transition count 1700
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1183 place count 157 transition count 1693
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1190 place count 150 transition count 1693
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1194 place count 150 transition count 1693
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1195 place count 150 transition count 1692
Applied a total of 1195 rules in 540 ms. Remains 150 /829 variables (removed 679) and now considering 1692/2410 (removed 718) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 552 ms. Remains : 150/829 places, 1692/2410 transitions.
RANDOM walk for 40000 steps (1715 resets) in 1744 ms. (22 steps per ms) remains 9/10 properties
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (237 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (114 resets) in 58 ms. (678 steps per ms) remains 8/9 properties
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (242 resets) in 200 ms. (199 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (251 resets) in 369 ms. (108 steps per ms) remains 7/8 properties
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (249 resets) in 198 ms. (201 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (205 resets) in 285 ms. (139 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (230 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (230 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (241 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
// Phase 1: matrix 1692 rows 150 cols
[2025-06-08 13:51:02] [INFO ] Computed 6 invariants in 20 ms
[2025-06-08 13:51:02] [INFO ] State equation strengthened by 32 read => feed constraints.
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/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 76/132 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1680/1812 variables, 132/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1812 variables, 32/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1812 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 26/1838 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 3/1841 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/1842 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1842 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/1842 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1842/1842 variables, and 188 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1732 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 150/150 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 7/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 76/132 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:51:05] [INFO ] Deduced a trap composed of 38 places in 460 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:51:05] [INFO ] Deduced a trap composed of 40 places in 337 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1680/1812 variables, 132/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1812 variables, 32/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1812 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1812 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 26/1838 variables, 16/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1838 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 3/1841 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1841 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/1842 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1842 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1842 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1842/1842 variables, and 191 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3606 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 150/150 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 7/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5447ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 341 ms.
Support contains 51 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1692/1692 transitions.
Graph (trivial) has 50 edges and 150 vertex of which 4 / 150 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 148 transition count 1680
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 12 rules applied. Total rules applied 21 place count 140 transition count 1676
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 26 place count 136 transition count 1675
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 26 place count 136 transition count 1670
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 36 place count 131 transition count 1670
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 39 place count 128 transition count 1667
Iterating global reduction 3 with 3 rules applied. Total rules applied 42 place count 128 transition count 1667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 128 transition count 1666
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 43 place count 128 transition count 1665
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 127 transition count 1665
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 46 place count 126 transition count 1664
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 126 transition count 1664
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 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 125 transition count 1663
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 4 with 2 rules applied. Total rules applied 51 place count 124 transition count 1663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 52 place count 124 transition count 1662
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 53 place count 124 transition count 1661
Free-agglomeration rule applied 22 times.
Iterating global reduction 5 with 22 rules applied. Total rules applied 75 place count 124 transition count 1639
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 97 place count 102 transition count 1639
Applied a total of 97 rules in 244 ms. Remains 102 /150 variables (removed 48) and now considering 1639/1692 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 102/150 places, 1639/1692 transitions.
RANDOM walk for 40000 steps (2250 resets) in 278 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (253 resets) in 321 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (296 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Invariant property MedleyB-PT-B04-ReachabilityFireability-2025-13 does not hold.
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Interrupted probabilistic random walk after 766178 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :1 out of 2
Probabilistic random walk after 766178 steps, saw 167363 distinct states, run finished after 3006 ms. (steps per millisecond=254 ) properties seen :1
FORMULA MedleyB-PT-B04-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 24859 ms.
BK_STOP 1749390672081
--------------------
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="MedleyB-PT-B04"
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 MedleyB-PT-B04, 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 r254-tall-174931339900455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B04.tgz
mv MedleyB-PT-B04 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 '
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 ;