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.r576-smll-171734920100126.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 MedleyA-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 89K 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 MedleyA-PT-16-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-16-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717371995266

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-02 23:46:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:46:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:46:37] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2024-06-02 23:46:37] [INFO ] Transformed 196 places.
[2024-06-02 23:46:37] [INFO ] Transformed 392 transitions.
[2024-06-02 23:46:37] [INFO ] Found NUPN structural information;
[2024-06-02 23:46:37] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 131 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:46:39] [INFO ] Flatten gal took : 355 ms
RANDOM walk for 40000 steps (8 resets) in 3736 ms. (10 steps per ms) remains 13/14 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 23:46:39] [INFO ] Flatten gal took : 160 ms
[2024-06-02 23:46:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16225738151458194430.gal : 53 ms
[2024-06-02 23:46:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2781931027675314050.prop : 43 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/ReachabilityCardinality16225738151458194430.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2781931027675314050.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 ...329
Loading property file /tmp/ReachabilityCardinality2781931027675314050.prop.
BEST_FIRST walk for 40001 steps (8 resets) in 1596 ms. (25 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :5 after 13
BEST_FIRST walk for 40002 steps (8 resets) in 797 ms. (50 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :13 after 27
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :27 after 78
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :78 after 869
Invariant property MedleyA-PT-16-ReachabilityCardinality-2024-07 does not hold.
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property MedleyA-PT-16-ReachabilityCardinality-2024-05 does not hold.
BEST_FIRST walk for 40002 steps (8 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :869 after 1033
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :1033 after 1449
Invariant property MedleyA-PT-16-ReachabilityCardinality-2024-11 does not hold.
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :1449 after 17445
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :17445 after 19598
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :19598 after 23614
BEST_FIRST walk for 40003 steps (8 resets) in 1589 ms. (25 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 459 ms. (86 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 320 ms. (124 steps per ms) remains 13/13 properties
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :23614 after 59278
BEST_FIRST walk for 40001 steps (8 resets) in 264 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 248 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 13/13 properties
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :59278 after 81490
BEST_FIRST walk for 40002 steps (8 resets) in 766 ms. (52 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 340 ms. (117 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
// Phase 1: matrix 390 rows 196 cols
[2024-06-02 23:46:41] [INFO ] Computed 7 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MedleyA-PT-16-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-16-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 84/196 variables, 7/119 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 84/203 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 390/586 variables, 196/399 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/586 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 399 constraints, problems are : Problem set: 2 solved, 8 unsolved in 1181 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem MedleyA-PT-16-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-16-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 103/196 variables, 7/100 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 103/203 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-02 23:46:43] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 25 ms to minimize.
[2024-06-02 23:46:43] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 4 ms to minimize.
[2024-06-02 23:46:43] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 3 ms to minimize.
[2024-06-02 23:46:44] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 4 ms to minimize.
[2024-06-02 23:46:44] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 5/208 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-02 23:46:44] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/209 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/209 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 390/586 variables, 196/405 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 6/411 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/411 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/586 variables, 0/411 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 586/586 variables, and 411 constraints, problems are : Problem set: 4 solved, 6 unsolved in 2815 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 6/6 constraints]
After SMT, in 4203ms problems are : Problem set: 4 solved, 6 unsolved
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 3182 ms.
Support contains 57 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 390/390 transitions.
Graph (trivial) has 119 edges and 196 vertex of which 5 / 196 are part of one of the 1 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 192 transition count 368
Reduce places removed 17 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 1 with 19 rules applied. Total rules applied 37 place count 175 transition count 366
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 174 transition count 364
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 172 transition count 364
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 42 place count 172 transition count 362
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 46 place count 170 transition count 362
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 63 place count 153 transition count 334
Iterating global reduction 4 with 17 rules applied. Total rules applied 80 place count 153 transition count 334
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 4 with 1 rules applied. Total rules applied 81 place count 153 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 82 place count 152 transition count 333
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 82 place count 152 transition count 330
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 88 place count 149 transition count 330
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 89 place count 148 transition count 328
Iterating global reduction 6 with 1 rules applied. Total rules applied 90 place count 148 transition count 328
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 108 place count 139 transition count 319
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 109 place count 139 transition count 318
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 133 place count 127 transition count 382
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 136 place count 127 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 8 with 59 rules applied. Total rules applied 195 place count 127 transition count 320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 197 place count 126 transition count 331
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 208 place count 126 transition count 320
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 219 place count 115 transition count 320
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 220 place count 115 transition count 320
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 221 place count 114 transition count 318
Iterating global reduction 9 with 1 rules applied. Total rules applied 222 place count 114 transition count 318
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 223 place count 113 transition count 317
Applied a total of 223 rules in 173 ms. Remains 113 /196 variables (removed 83) and now considering 317/390 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 113/196 places, 317/390 transitions.
RANDOM walk for 40000 steps (8 resets) in 325 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 546 ms. (73 steps per ms) remains 3/4 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 437 ms. (91 steps per ms) remains 3/3 properties
Reachability property MedleyA-PT-16-ReachabilityCardinality-2024-13 is true.
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property MedleyA-PT-16-ReachabilityCardinality-2024-03 is true.
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :81490 after 1.56931e+06
BEST_FIRST walk for 40000 steps (8 resets) in 370 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 421 ms. (94 steps per ms) remains 3/3 properties
[2024-06-02 23:46:49] [INFO ] Flow matrix only has 309 transitions (discarded 8 similar events)
// Phase 1: matrix 309 rows 113 cols
[2024-06-02 23:46:49] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:46:49] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/110 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 306/416 variables, 110/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/422 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 18/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/422 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 176 constraints, problems are : Problem set: 0 solved, 2 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/110 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:46:50] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.56931e+06 after 1.74127e+06
At refinement iteration 6 (OVERLAPS) 306/416 variables, 110/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/422 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 18/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:46:50] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 5 ms to minimize.
[2024-06-02 23:46:50] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 995ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 131 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 317/317 transitions.
Graph (trivial) has 108 edges and 113 vertex of which 4 / 113 are part of one of the 1 SCC in 9 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 110 transition count 298
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 95 transition count 298
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 31 place count 95 transition count 295
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 92 transition count 295
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 46 place count 83 transition count 278
Iterating global reduction 2 with 9 rules applied. Total rules applied 55 place count 83 transition count 278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 60 place count 83 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 82 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 61 place count 82 transition count 272
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 63 place count 81 transition count 272
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 79 transition count 265
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 79 transition count 265
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 91 place count 67 transition count 252
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 100 place count 67 transition count 243
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 101 place count 66 transition count 241
Iterating global reduction 5 with 1 rules applied. Total rules applied 102 place count 66 transition count 241
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 126 place count 54 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 139 place count 54 transition count 279
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 140 place count 53 transition count 269
Iterating global reduction 6 with 1 rules applied. Total rules applied 141 place count 53 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 143 place count 52 transition count 282
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 149 place count 52 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 151 place count 51 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 179 place count 51 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 179 place count 51 transition count 256
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 181 place count 50 transition count 256
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 185 place count 50 transition count 252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 187 place count 49 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 189 place count 49 transition count 263
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 196 place count 49 transition count 256
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 209 place count 42 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 225 place count 42 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 226 place count 41 transition count 233
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 25 edges and 39 vertex of which 4 / 39 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 229 place count 37 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 256 place count 37 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 11 with 53 rules applied. Total rules applied 309 place count 37 transition count 153
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 310 place count 36 transition count 152
Iterating global reduction 11 with 1 rules applied. Total rules applied 311 place count 36 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 315 place count 34 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 317 place count 33 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 322 place count 33 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 323 place count 33 transition count 150
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 326 place count 32 transition count 148
Applied a total of 326 rules in 171 ms. Remains 32 /113 variables (removed 81) and now considering 148/317 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 32/113 places, 148/317 transitions.
RANDOM walk for 36105 steps (4235 resets) in 1651 ms. (21 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-16-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 14315 ms.

BK_STOP 1717372011649

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-16"
export BK_EXAMINATION="ReachabilityCardinality"
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 MedleyA-PT-16, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920100126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;