About the Execution of 2023-gold for MedleyA-PT-17
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
401.220 | 54856.00 | 82238.00 | 720.50 | TTTFTFTTFTTTTTTT | normal |
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.r597-smll-171734926500084.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 gold2023
Input is MedleyA-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500084
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 175K 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-17-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-17-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717363149529
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-06-02 21:19:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:19:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:19:12] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-06-02 21:19:12] [INFO ] Transformed 248 places.
[2024-06-02 21:19:12] [INFO ] Transformed 591 transitions.
[2024-06-02 21:19:12] [INFO ] Found NUPN structural information;
[2024-06-02 21:19:12] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 344 resets, run finished after 841 ms. (steps per millisecond=11 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 892261 steps, run timeout after 6001 ms. (steps per millisecond=148 ) properties seen :{3=1, 6=1, 8=1, 9=1, 10=1}
Probabilistic random walk after 892261 steps, saw 161528 distinct states, run finished after 6004 ms. (steps per millisecond=148 ) properties seen :5
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 589 rows 248 cols
[2024-06-02 21:19:20] [INFO ] Computed 7 invariants in 22 ms
[2024-06-02 21:19:21] [INFO ] After 455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 21:19:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:19:29] [INFO ] After 7630ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-06-02 21:19:29] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 10 ms to minimize.
[2024-06-02 21:19:31] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 1 ms to minimize.
[2024-06-02 21:19:31] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 1 ms to minimize.
[2024-06-02 21:19:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2179 ms
[2024-06-02 21:19:31] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 5 ms to minimize.
[2024-06-02 21:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-06-02 21:19:32] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 1 ms to minimize.
[2024-06-02 21:19:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2024-06-02 21:19:32] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:19:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1503 ms
[2024-06-02 21:19:33] [INFO ] After 12216ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 6041 ms.
[2024-06-02 21:19:39] [INFO ] After 18525ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 102 ms.
Support contains 63 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 589/589 transitions.
Graph (trivial) has 171 edges and 248 vertex of which 3 / 248 are part of one of the 1 SCC in 11 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions 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 246 transition count 571
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 231 transition count 562
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 48 place count 223 transition count 562
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 48 place count 223 transition count 552
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 68 place count 213 transition count 552
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 98 place count 183 transition count 499
Iterating global reduction 3 with 30 rules applied. Total rules applied 128 place count 183 transition count 499
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 144 place count 183 transition count 483
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 144 place count 183 transition count 482
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 182 transition count 482
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 181 transition count 480
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 181 transition count 480
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 4 with 18 rules applied. Total rules applied 166 place count 172 transition count 471
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 200 place count 155 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 155 transition count 519
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 203 place count 153 transition count 503
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 153 transition count 503
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 231 place count 153 transition count 477
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 239 place count 149 transition count 473
Free-agglomeration rule applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 256 place count 149 transition count 456
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 273 place count 132 transition count 456
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 274 place count 132 transition count 455
Applied a total of 274 rules in 236 ms. Remains 132 /248 variables (removed 116) and now considering 455/589 (removed 134) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 132/248 places, 455/589 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :1
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 21:19:41] [INFO ] Flow matrix only has 428 transitions (discarded 27 similar events)
// Phase 1: matrix 428 rows 132 cols
[2024-06-02 21:19:41] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:19:41] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 21:19:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 21:19:41] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 21:19:41] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 21:19:41] [INFO ] After 154ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 21:19:41] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2024-06-02 21:19:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 563 ms
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:19:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:19:42] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:19:43] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2024-06-02 21:19:44] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-06-02 21:19:44] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:19:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1660 ms
[2024-06-02 21:19:44] [INFO ] After 2652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 162 ms.
[2024-06-02 21:19:44] [INFO ] After 3233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 101 ms.
Support contains 42 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 455/455 transitions.
Graph (trivial) has 54 edges and 132 vertex of which 2 / 132 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 131 transition count 452
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 129 transition count 451
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 9 place count 125 transition count 442
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 125 transition count 442
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 122 transition count 439
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 119 transition count 455
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 119 transition count 452
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 36 place count 119 transition count 444
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 44 place count 111 transition count 444
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 111 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 46 place count 110 transition count 458
Applied a total of 46 rules in 92 ms. Remains 110 /132 variables (removed 22) and now considering 458/455 (removed -3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 110/132 places, 458/455 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 640119 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{1=1}
Probabilistic random walk after 640119 steps, saw 111726 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :1
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2024-06-02 21:19:48] [INFO ] Flow matrix only has 422 transitions (discarded 36 similar events)
// Phase 1: matrix 422 rows 110 cols
[2024-06-02 21:19:48] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:19:48] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:19:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 21:19:48] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:19:48] [INFO ] State equation strengthened by 181 read => feed constraints.
[2024-06-02 21:19:49] [INFO ] After 961ms SMT Verify possible using 181 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:19:49] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 0 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 966 ms
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-06-02 21:19:51] [INFO ] After 2189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 402 ms.
[2024-06-02 21:19:51] [INFO ] After 3203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 39 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 458/458 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 457
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 107 transition count 471
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 107 transition count 465
Applied a total of 12 rules in 24 ms. Remains 107 /110 variables (removed 3) and now considering 465/458 (removed -7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 107/110 places, 465/458 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 810268 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 810268 steps, saw 144946 distinct states, run finished after 3002 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-02 21:19:54] [INFO ] Flow matrix only has 429 transitions (discarded 36 similar events)
// Phase 1: matrix 429 rows 107 cols
[2024-06-02 21:19:54] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 21:19:54] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:19:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 21:19:55] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:19:55] [INFO ] State equation strengthened by 181 read => feed constraints.
[2024-06-02 21:19:55] [INFO ] After 196ms SMT Verify possible using 181 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:19:55] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-06-02 21:19:55] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:19:55] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-06-02 21:19:55] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-06-02 21:19:56] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:19:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 577 ms
[2024-06-02 21:19:56] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
[2024-06-02 21:19:56] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:19:56] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:19:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3837 ms
[2024-06-02 21:19:59] [INFO ] After 4738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 257 ms.
[2024-06-02 21:20:00] [INFO ] After 5343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 39 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 465/465 transitions.
Applied a total of 0 rules in 11 ms. Remains 107 /107 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 107/107 places, 465/465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 465/465 transitions.
Applied a total of 0 rules in 10 ms. Remains 107 /107 variables (removed 0) and now considering 465/465 (removed 0) transitions.
[2024-06-02 21:20:00] [INFO ] Flow matrix only has 429 transitions (discarded 36 similar events)
[2024-06-02 21:20:00] [INFO ] Invariant cache hit.
[2024-06-02 21:20:00] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 21:20:00] [INFO ] Flow matrix only has 429 transitions (discarded 36 similar events)
[2024-06-02 21:20:00] [INFO ] Invariant cache hit.
[2024-06-02 21:20:00] [INFO ] State equation strengthened by 181 read => feed constraints.
[2024-06-02 21:20:00] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-06-02 21:20:00] [INFO ] Redundant transitions in 37 ms returned []
[2024-06-02 21:20:00] [INFO ] Flow matrix only has 429 transitions (discarded 36 similar events)
[2024-06-02 21:20:00] [INFO ] Invariant cache hit.
[2024-06-02 21:20:01] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 944 ms. Remains : 107/107 places, 465/465 transitions.
Graph (trivial) has 51 edges and 107 vertex of which 2 / 107 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 7 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 106 transition count 420
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 106 transition count 420
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 106 transition count 419
Applied a total of 11 rules in 49 ms. Remains 106 /107 variables (removed 1) and now considering 419/465 (removed 46) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 419 rows 106 cols
[2024-06-02 21:20:01] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:20:01] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:20:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 21:20:01] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:20:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-02 21:20:01] [INFO ] After 123ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:20:01] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 540 ms.
[2024-06-02 21:20:02] [INFO ] After 1092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:20:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-06-02 21:20:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 465 transitions and 2584 arcs took 5 ms.
[2024-06-02 21:20:02] [INFO ] Flatten gal took : 115 ms
Total runtime 50464 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MedleyA-PT-17
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityCardinality
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MedleyA-PT-17-ReachabilityCardinality-2024-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1717363204385
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 14 (type EXCL) for 3 MedleyA-PT-17-ReachabilityCardinality-2024-07
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 3 MedleyA-PT-17-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 3 MedleyA-PT-17-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 13 (type SRCH) for 3 MedleyA-PT-17-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 9 (type FNDP) for MedleyA-PT-17-ReachabilityCardinality-2024-07
lola: result : true
lola: fired transitions : 9670
lola: tried executions : 541
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 10 (type EQUN) for MedleyA-PT-17-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 13 (type SRCH) for MedleyA-PT-17-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 14 (type EXCL) for MedleyA-PT-17-ReachabilityCardinality-2024-07 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 0 MedleyA-PT-17-ReachabilityCardinality-2024-03
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 0 MedleyA-PT-17-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 0 MedleyA-PT-17-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 0 MedleyA-PT-17-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 10 (type EQUN) for MedleyA-PT-17-ReachabilityCardinality-2024-07
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 16 (type SRCH) for MedleyA-PT-17-ReachabilityCardinality-2024-03
lola: result : true
lola: markings : 1696
lola: fired transitions : 3151
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for MedleyA-PT-17-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 8 (type EQUN) for MedleyA-PT-17-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 17 (type EXCL) for MedleyA-PT-17-ReachabilityCardinality-2024-03 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MedleyA-PT-17-ReachabilityCardinality-2024-03: AG false tandem / insertion
MedleyA-PT-17-ReachabilityCardinality-2024-07: EF true findpath
Time elapsed: 1 secs. Pages in use: 3
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-17"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is MedleyA-PT-17, 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 r597-smll-171734926500084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 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 '
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 ;