About the Execution of ITS-Tools for MedleyB-PT-B08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 91116.00 | 0.00 | 0.00 | TFFFTTTFTTFFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931340000487.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-B08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931340000487
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.9K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 6 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 12:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 14K Jun 6 09:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Jun 6 09:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Jun 6 09:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:13 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 11M 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-B08-ReachabilityFireability-2025-00
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-01
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-02
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-03
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-04
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-05
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-06
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-07
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-08
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-09
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-10
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-11
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-12
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-13
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-14
FORMULA_NAME MedleyB-PT-B08-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749398807774
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-B08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-08 16:06: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-08 16:06:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 16:06:49] [INFO ] Load time of PNML (sax parser for PT used): 612 ms
[2025-06-08 16:06:49] [INFO ] Transformed 1099 places.
[2025-06-08 16:06:49] [INFO ] Transformed 14556 transitions.
[2025-06-08 16:06:49] [INFO ] Found NUPN structural information;
[2025-06-08 16:06:49] [INFO ] Parsed PT model containing 1099 places and 14556 transitions and 216508 arcs in 810 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (290 resets) in 4118 ms. (9 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 313 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 107 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 135 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 168 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 227 ms. (17 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 230 ms. (17 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 198 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 144 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
[2025-06-08 16:06:53] [INFO ] Flatten gal took : 2185 ms
[2025-06-08 16:06:54] [INFO ] Flatten gal took : 1133 ms
[2025-06-08 16:06:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3232156050482845003.gal : 268 ms
[2025-06-08 16:06:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4166962124609618427.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3232156050482845003.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4166962124609618427.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
Interrupted probabilistic random walk after 52104 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 16
Probabilistic random walk after 52104 steps, saw 13597 distinct states, run finished after 3012 ms. (steps per millisecond=17 ) properties seen :0
// Phase 1: matrix 14556 rows 1099 cols
[2025-06-08 16:06:55] [INFO ] Computed 9 invariants in 302 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/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem MedleyB-PT-B08-ReachabilityFireability-2025-03 is UNSAT
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B08-ReachabilityFireability-2025-11 is UNSAT
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B08-ReachabilityFireability-2025-15 is UNSAT
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1009/1099 variables, 9/99 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1099 variables, 1009/1108 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1099 variables, 0/1108 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15655/15655 variables, and 2207 constraints, problems are : Problem set: 3 solved, 13 unsolved in 5049 ms.
Refiners :[Domain max(s): 1099/1099 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 1099/1099 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1011/1099 variables, 9/97 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1099 variables, 1011/1108 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Loading property file /tmp/ReachabilityCardinality4166962124609618427.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/1099 variables, 0/1108 constraints. Problems are: Problem set: 3 solved, 13 unsolved
SMT process timed out in 10693ms, After SMT, problems are : Problem set: 3 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 88 out of 1099 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1099/1099 places, 14556/14556 transitions.
Graph (trivial) has 879 edges and 1099 vertex of which 122 / 1099 are part of one of the 20 SCC in 8 ms
Free SCC test removed 102 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2432 edges and 997 vertex of which 981 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.73 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 530 transitions
Trivial Post-agglo rules discarded 530 transitions
Performed 530 trivial Post agglomeration. Transition count delta: 530
Iterating post reduction 0 with 538 rules applied. Total rules applied 540 place count 981 transition count 13877
Reduce places removed 530 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 544 rules applied. Total rules applied 1084 place count 451 transition count 13863
Reduce places removed 7 places and 0 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Iterating post reduction 2 with 69 rules applied. Total rules applied 1153 place count 444 transition count 13801
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 66 rules applied. Total rules applied 1219 place count 382 transition count 13797
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1221 place count 380 transition count 13797
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 58 Pre rules applied. Total rules applied 1221 place count 380 transition count 13739
Deduced a syphon composed of 58 places in 7 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 5 with 116 rules applied. Total rules applied 1337 place count 322 transition count 13739
Discarding 82 places :
Symmetric choice reduction at 5 with 82 rule applications. Total rules 1419 place count 240 transition count 13657
Iterating global reduction 5 with 82 rules applied. Total rules applied 1501 place count 240 transition count 13657
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 10 rules applied. Total rules applied 1511 place count 240 transition count 13647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1512 place count 239 transition count 13647
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1512 place count 239 transition count 13646
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1514 place count 238 transition count 13646
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1520 place count 232 transition count 13640
Iterating global reduction 7 with 6 rules applied. Total rules applied 1526 place count 232 transition count 13640
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1527 place count 231 transition count 13638
Iterating global reduction 7 with 1 rules applied. Total rules applied 1528 place count 231 transition count 13638
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 12 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1562 place count 214 transition count 13621
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1568 place count 208 transition count 13615
Iterating global reduction 7 with 6 rules applied. Total rules applied 1574 place count 208 transition count 13615
Performed 13 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 13 places in 11 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1600 place count 195 transition count 13622
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1608 place count 195 transition count 13614
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1616 place count 195 transition count 13614
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 1617 place count 195 transition count 13613
Applied a total of 1617 rules in 2221 ms. Remains 195 /1099 variables (removed 904) and now considering 13613/14556 (removed 943) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2234 ms. Remains : 195/1099 places, 13613/14556 transitions.
RANDOM walk for 40000 steps (1275 resets) in 2706 ms. (14 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (110 resets) in 520 ms. (76 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (138 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (142 resets) in 272 ms. (146 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (66 resets) in 510 ms. (78 steps per ms) remains 12/13 properties
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (147 resets) in 323 ms. (123 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (142 resets) in 213 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (142 resets) in 342 ms. (116 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (138 resets) in 248 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (135 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (135 resets) in 347 ms. (114 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (132 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (63 resets) in 70 ms. (563 steps per ms) remains 11/12 properties
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (132 resets) in 488 ms. (81 steps per ms) remains 11/11 properties
// Phase 1: matrix 13613 rows 195 cols
[2025-06-08 16:07:10] [INFO ] Computed 9 invariants in 145 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 111/195 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 13613/13808 variables, 195/204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13808 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/13808 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13808/13808 variables, and 204 constraints, problems are : Problem set: 0 solved, 11 unsolved in 8315 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 111/195 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 13613/13808 variables, 195/204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13808 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/13808 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :19 after 21
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :21 after 190
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :190 after 5884
No progress, stopping.
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :5884 after 166191
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :166191 after 166425
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :166425 after 355016
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :355016 after 461422
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :461422 after 1.83964e+06
After SMT solving in domain Int declared 13808/13808 variables, and 204 constraints, problems are : Problem set: 0 solved, 11 unsolved in 20551 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29158ms problems are : Problem set: 0 solved, 11 unsolved
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 10 properties in 1434 ms.
Support contains 55 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 13613/13613 transitions.
Graph (trivial) has 100 edges and 195 vertex of which 8 / 195 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 191 transition count 13589
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 175 transition count 13589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 33 place count 175 transition count 13584
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 170 transition count 13584
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 49 place count 164 transition count 13578
Iterating global reduction 2 with 6 rules applied. Total rules applied 55 place count 164 transition count 13578
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 164 transition count 13576
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 57 place count 164 transition count 13572
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 65 place count 160 transition count 13572
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 158 transition count 13569
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 158 transition count 13569
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 157 transition count 13565
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 157 transition count 13565
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 83 place count 151 transition count 13559
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 87 place count 151 transition count 13555
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 89 place count 149 transition count 13552
Iterating global reduction 4 with 2 rules applied. Total rules applied 91 place count 149 transition count 13552
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :1.83964e+06 after 8.89021e+06
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 105 place count 149 transition count 13538
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 109 place count 147 transition count 13536
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 145 transition count 13544
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 125 place count 145 transition count 13532
Free-agglomeration rule applied 50 times.
Iterating global reduction 4 with 50 rules applied. Total rules applied 175 place count 145 transition count 13482
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 4 with 50 rules applied. Total rules applied 225 place count 95 transition count 13482
Applied a total of 225 rules in 4627 ms. Remains 95 /195 variables (removed 100) and now considering 13482/13613 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4628 ms. Remains : 95/195 places, 13482/13613 transitions.
RANDOM walk for 40000 steps (3276 resets) in 2804 ms. (14 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (248 resets) in 474 ms. (84 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 71333 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 71333 steps, saw 18429 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 13482 rows 95 cols
[2025-06-08 16:07:49] [INFO ] Computed 9 invariants in 109 ms
[2025-06-08 16:07:52] [INFO ] State equation strengthened by 275 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/95 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13482/13577 variables, 95/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13577 variables, 275/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13577 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13577 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13577/13577 variables, and 379 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12645 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 95/95 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/95 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13482/13577 variables, 95/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :8.89021e+06 after 3.62428e+10
At refinement iteration 4 (INCLUDED_ONLY) 0/13577 variables, 275/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13577 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13577 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13577/13577 variables, and 379 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13851 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 95/95 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29562ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 119 steps, including 9 resets, run visited all 1 properties in 13 ms. (steps per millisecond=9 )
FORMULA MedleyB-PT-B08-ReachabilityFireability-2025-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 20 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 89841 ms.
BK_STOP 1749398898890
--------------------
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-B08"
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-B08, 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-174931340000487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B08.tgz
mv MedleyB-PT-B08 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 ;