Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898400047.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is CO4-PT-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898400047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-00
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-01
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-02
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-03
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-04
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-05
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-06
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-07
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-08
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-09
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-10
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-11
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-12
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-13
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-14
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351374167

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-02 18:02:55] [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]
[2024-06-02 18:02:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:02:55] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-02 18:02:55] [INFO ] Transformed 383 places.
[2024-06-02 18:02:55] [INFO ] Transformed 454 transitions.
[2024-06-02 18:02:55] [INFO ] Found NUPN structural information;
[2024-06-02 18:02:55] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (71 resets) in 1450 ms. (27 steps per ms) remains 12/12 properties
[2024-06-02 18:02:56] [INFO ] Flatten gal took : 118 ms
[2024-06-02 18:02:56] [INFO ] Flatten gal took : 72 ms
[2024-06-02 18:02:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality346786026510183566.gal : 25 ms
[2024-06-02 18:02:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11003132843514273185.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality346786026510183566.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11003132843514273185.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality11003132843514273185.prop.
BEST_FIRST walk for 40000 steps (82 resets) in 1366 ms. (29 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :9 after 10
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :10 after 41
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :41 after 90
Invariant property CO4-PT-06-ReachabilityFireability-2024-14 does not hold.
FORMULA CO4-PT-06-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property CO4-PT-06-ReachabilityFireability-2024-13 does not hold.
FORMULA CO4-PT-06-ReachabilityFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :90 after 337
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :337 after 370
Reachability property CO4-PT-06-ReachabilityFireability-2024-10 is true.
FORMULA CO4-PT-06-ReachabilityFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :370 after 411
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :411 after 444
Reachability property CO4-PT-06-ReachabilityFireability-2024-11 is true.
FORMULA CO4-PT-06-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property CO4-PT-06-ReachabilityFireability-2024-05 does not hold.
FORMULA CO4-PT-06-ReachabilityFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :444 after 1261
BEST_FIRST walk for 40000 steps (26 resets) in 772 ms. (51 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (18 resets) in 355 ms. (112 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (62 resets) in 275 ms. (144 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (58 resets) in 478 ms. (83 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40000 steps (37 resets) in 330 ms. (120 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (117 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (43 resets) in 192 ms. (207 steps per ms) remains 11/11 properties
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1261 after 13315
BEST_FIRST walk for 40000 steps (32 resets) in 208 ms. (191 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (87 resets) in 209 ms. (190 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (46 resets) in 180 ms. (220 steps per ms) remains 11/11 properties
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :13315 after 23462
Interrupted probabilistic random walk after 775727 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :4 out of 11
Probabilistic random walk after 775727 steps, saw 167191 distinct states, run finished after 3017 ms. (steps per millisecond=257 ) properties seen :4
// Phase 1: matrix 334 rows 283 cols
[2024-06-02 18:03:00] [INFO ] Computed 6 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem CO4-PT-06-ReachabilityFireability-2024-00 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-06-ReachabilityFireability-2024-06 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-06-ReachabilityFireability-2024-08 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-06-ReachabilityFireability-2024-15 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 219/278 variables, 4/63 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 219/282 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/282 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/283 variables, 2/284 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 5/289 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/289 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 334/617 variables, 283/572 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/617 variables, 0/572 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/617 variables, 0/572 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 617/617 variables, and 572 constraints, problems are : Problem set: 4 solved, 3 unsolved in 877 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem CO4-PT-06-ReachabilityFireability-2024-02 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-06-ReachabilityFireability-2024-04 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 238/278 variables, 4/44 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 238/282 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/282 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/283 variables, 2/284 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 5/289 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/289 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 334/617 variables, 283/572 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/617 variables, 1/573 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/617 variables, 0/573 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/617 variables, 0/573 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 617/617 variables, and 573 constraints, problems are : Problem set: 6 solved, 1 unsolved in 565 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1576ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 18 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 334/334 transitions.
Graph (trivial) has 226 edges and 283 vertex of which 2 / 283 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 282 vertex of which 252 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :23462 after 139818
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 252 transition count 216
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 91 rules applied. Total rules applied 192 place count 167 transition count 210
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 197 place count 164 transition count 208
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 200 place count 163 transition count 206
Reduce places removed 1 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 4 with 17 rules applied. Total rules applied 217 place count 162 transition count 190
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 236 place count 146 transition count 187
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 236 place count 146 transition count 183
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 244 place count 142 transition count 183
Discarding 33 places :
Symmetric choice reduction at 6 with 33 rule applications. Total rules 277 place count 109 transition count 150
Iterating global reduction 6 with 33 rules applied. Total rules applied 310 place count 109 transition count 150
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 310 place count 109 transition count 147
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 316 place count 106 transition count 147
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 325 place count 97 transition count 138
Iterating global reduction 6 with 9 rules applied. Total rules applied 334 place count 97 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 335 place count 97 transition count 137
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 391 place count 69 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 392 place count 69 transition count 105
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 406 place count 62 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 408 place count 62 transition count 105
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 413 place count 57 transition count 95
Iterating global reduction 9 with 5 rules applied. Total rules applied 418 place count 57 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 420 place count 57 transition count 93
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 421 place count 56 transition count 90
Iterating global reduction 10 with 1 rules applied. Total rules applied 422 place count 56 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 423 place count 56 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 426 place count 56 transition count 86
Free-agglomeration rule applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 431 place count 56 transition count 81
Reduce places removed 5 places and 0 transitions.
Graph (complete) has 127 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 437 place count 50 transition count 81
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 438 place count 50 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 439 place count 50 transition count 79
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 443 place count 50 transition count 79
Graph (complete) has 125 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 444 place count 49 transition count 79
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 445 place count 49 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 446 place count 48 transition count 77
Applied a total of 446 rules in 183 ms. Remains 48 /283 variables (removed 235) and now considering 77/334 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 48/283 places, 77/334 transitions.
RANDOM walk for 40000 steps (32 resets) in 430 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (30 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2679 steps, run visited all 1 properties in 10 ms. (steps per millisecond=267 )
Probabilistic random walk after 2679 steps, saw 844 distinct states, run finished after 25 ms. (steps per millisecond=107 ) properties seen :1
FORMULA CO4-PT-06-ReachabilityFireability-2024-07 FALSE 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 7377 ms.

BK_STOP 1717351382800

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="CO4-PT-06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-06, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898400047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-06.tgz
mv CO4-PT-06 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;