About the Execution of LoLa+red for HealthRecord-PT-08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
269.012 | 137239.00 | 277655.00 | 610.30 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r213-smll-167840356600183.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is HealthRecord-PT-08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-167840356600183
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 68K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1678611105964
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=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-08
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-12 08:51:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-12 08:51:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:51:49] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-12 08:51:49] [INFO ] Transformed 156 places.
[2023-03-12 08:51:49] [INFO ] Transformed 326 transitions.
[2023-03-12 08:51:49] [INFO ] Found NUPN structural information;
[2023-03-12 08:51:49] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 291 ms.
Graph (trivial) has 266 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 8 ms
Free SCC test removed 6 places
Structural test allowed to assert that 33 places are NOT stable. Took 22 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Incomplete random walk after 10000 steps, including 750 resets, run finished after 981 ms. (steps per millisecond=10 ) properties (out of 123) seen :60
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 63) seen :2
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 61) seen :0
Running SMT prover for 61 properties.
[2023-03-12 08:51:51] [INFO ] Flow matrix only has 276 transitions (discarded 18 similar events)
// Phase 1: matrix 276 rows 150 cols
[2023-03-12 08:51:51] [INFO ] Computed 18 place invariants in 45 ms
[2023-03-12 08:51:52] [INFO ] After 975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:61
[2023-03-12 08:51:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 26 ms returned sat
[2023-03-12 08:51:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 22 ms returned sat
[2023-03-12 08:51:54] [INFO ] After 1254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :61
[2023-03-12 08:51:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 08:51:55] [INFO ] After 1067ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :61
[2023-03-12 08:51:56] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 15 ms to minimize.
[2023-03-12 08:51:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-12 08:51:57] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2023-03-12 08:51:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-03-12 08:51:57] [INFO ] After 3124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :61
Attempting to minimize the solution found.
Minimization took 1218 ms.
[2023-03-12 08:51:58] [INFO ] After 6626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :61
Fused 61 Parikh solutions to 50 different solutions.
Parikh walk visited 1 properties in 653 ms.
Support contains 60 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 294/294 transitions.
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 150 transition count 272
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 28 place count 147 transition count 269
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 28 place count 147 transition count 266
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 142 transition count 266
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 75 place count 103 transition count 188
Iterating global reduction 2 with 39 rules applied. Total rules applied 114 place count 103 transition count 188
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 98 transition count 178
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 98 transition count 178
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 129 place count 98 transition count 173
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 141 place count 92 transition count 201
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 92 transition count 196
Applied a total of 146 rules in 95 ms. Remains 92 /150 variables (removed 58) and now considering 196/294 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 92/150 places, 196/294 transitions.
Interrupted random walk after 948453 steps, including 218407 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen 28
Incomplete Best-First random walk after 100001 steps, including 3187 resets, run finished after 440 ms. (steps per millisecond=227 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3209 resets, run finished after 488 ms. (steps per millisecond=204 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3167 resets, run finished after 500 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3158 resets, run finished after 468 ms. (steps per millisecond=213 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3171 resets, run finished after 409 ms. (steps per millisecond=244 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3183 resets, run finished after 411 ms. (steps per millisecond=243 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3193 resets, run finished after 399 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3182 resets, run finished after 409 ms. (steps per millisecond=244 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100000 steps, including 3224 resets, run finished after 405 ms. (steps per millisecond=246 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3145 resets, run finished after 424 ms. (steps per millisecond=235 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3182 resets, run finished after 414 ms. (steps per millisecond=241 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3222 resets, run finished after 426 ms. (steps per millisecond=234 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3144 resets, run finished after 424 ms. (steps per millisecond=235 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100000 steps, including 3187 resets, run finished after 418 ms. (steps per millisecond=239 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3161 resets, run finished after 395 ms. (steps per millisecond=253 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100000 steps, including 3230 resets, run finished after 373 ms. (steps per millisecond=268 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100000 steps, including 3209 resets, run finished after 415 ms. (steps per millisecond=240 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3146 resets, run finished after 414 ms. (steps per millisecond=241 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3188 resets, run finished after 405 ms. (steps per millisecond=246 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3181 resets, run finished after 401 ms. (steps per millisecond=249 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3180 resets, run finished after 402 ms. (steps per millisecond=248 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3191 resets, run finished after 407 ms. (steps per millisecond=245 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3207 resets, run finished after 428 ms. (steps per millisecond=233 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100000 steps, including 3194 resets, run finished after 414 ms. (steps per millisecond=241 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3198 resets, run finished after 402 ms. (steps per millisecond=248 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3223 resets, run finished after 400 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100000 steps, including 3211 resets, run finished after 412 ms. (steps per millisecond=242 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3211 resets, run finished after 445 ms. (steps per millisecond=224 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3185 resets, run finished after 415 ms. (steps per millisecond=240 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3159 resets, run finished after 403 ms. (steps per millisecond=248 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3189 resets, run finished after 413 ms. (steps per millisecond=242 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 100001 steps, including 3209 resets, run finished after 422 ms. (steps per millisecond=236 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-12 08:52:42] [INFO ] Flow matrix only has 188 transitions (discarded 8 similar events)
// Phase 1: matrix 188 rows 92 cols
[2023-03-12 08:52:42] [INFO ] Computed 16 place invariants in 6 ms
[2023-03-12 08:52:43] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-12 08:52:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-12 08:52:43] [INFO ] [Nat]Absence check using 10 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-12 08:52:44] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-12 08:52:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 08:52:44] [INFO ] After 404ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-12 08:52:44] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 5 ms to minimize.
[2023-03-12 08:52:44] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2023-03-12 08:52:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 274 ms
[2023-03-12 08:52:45] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2023-03-12 08:52:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-12 08:52:45] [INFO ] After 1369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-12 08:52:45] [INFO ] After 2539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Fused 32 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 32 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 196/196 transitions.
Graph (complete) has 449 edges and 92 vertex of which 83 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 83 transition count 192
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 79 transition count 191
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 20 place count 69 transition count 171
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 69 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 69 transition count 168
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 3 with 4 rules applied. Total rules applied 37 place count 67 transition count 166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 66 transition count 163
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 66 transition count 163
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 64 transition count 171
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 64 transition count 167
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 62 place count 64 transition count 167
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 76 place count 64 transition count 167
Applied a total of 76 rules in 53 ms. Remains 64 /92 variables (removed 28) and now considering 167/196 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 64/92 places, 167/196 transitions.
Incomplete random walk after 1000000 steps, including 166266 resets, run finished after 24674 ms. (steps per millisecond=40 ) properties (out of 32) seen :23
Incomplete Best-First random walk after 1000001 steps, including 22393 resets, run finished after 3406 ms. (steps per millisecond=293 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22413 resets, run finished after 3281 ms. (steps per millisecond=304 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 22261 resets, run finished after 3271 ms. (steps per millisecond=305 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22353 resets, run finished after 3295 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22379 resets, run finished after 3034 ms. (steps per millisecond=329 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 22325 resets, run finished after 2748 ms. (steps per millisecond=363 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 22423 resets, run finished after 2622 ms. (steps per millisecond=381 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 08:53:32] [INFO ] Flow matrix only has 153 transitions (discarded 14 similar events)
// Phase 1: matrix 153 rows 64 cols
[2023-03-12 08:53:32] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 08:53:32] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 08:53:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 08:53:32] [INFO ] [Nat]Absence check using 1 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-12 08:53:32] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 08:53:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 08:53:32] [INFO ] After 36ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 08:53:32] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2023-03-12 08:53:32] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2023-03-12 08:53:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-03-12 08:53:32] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-12 08:53:32] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 233 ms.
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 167/167 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 47 transition count 133
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 47 transition count 133
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 45 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 45 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 43 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 43 transition count 123
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 41 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 41 transition count 117
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 58 place count 41 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 40 transition count 104
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 37 transition count 116
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 37 transition count 115
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 37 transition count 115
Applied a total of 70 rules in 45 ms. Remains 37 /64 variables (removed 27) and now considering 115/167 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 37/64 places, 115/167 transitions.
Incomplete random walk after 1000000 steps, including 167502 resets, run finished after 17564 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 24338 resets, run finished after 2558 ms. (steps per millisecond=390 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000001 steps, including 24324 resets, run finished after 1821 ms. (steps per millisecond=549 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 24471 resets, run finished after 1834 ms. (steps per millisecond=545 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 08:53:56] [INFO ] Flow matrix only has 105 transitions (discarded 10 similar events)
// Phase 1: matrix 105 rows 37 cols
[2023-03-12 08:53:56] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-12 08:53:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:53:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 08:53:56] [INFO ] [Nat]Absence check using 1 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 08:53:56] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 08:53:56] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-12 08:53:56] [INFO ] After 21ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 08:53:56] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-12 08:53:56] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 3 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 115/115 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 35 transition count 114
Applied a total of 4 rules in 12 ms. Remains 35 /37 variables (removed 2) and now considering 114/115 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 35/37 places, 114/115 transitions.
Finished random walk after 484537 steps, including 81633 resets, run visited all 3 properties in 5328 ms. (steps per millisecond=90 )
Able to resolve query StableMarking after proving 125 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 132865 ms.
ITS solved all properties within timeout
BK_STOP 1678611243203
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
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="HealthRecord-PT-08"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool lolaxred"
echo " Input is HealthRecord-PT-08, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r213-smll-167840356600183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-08.tgz
mv HealthRecord-PT-08 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;