About the Execution of LTSMin+red for QuasiCertifProtocol-PT-28
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 925.100 | 329079.00 | 350688.00 | 875.00 | 29 16 841 29 29 1 1 29 1 1 1 1 1 1 1 1 | 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.r520-tall-171662337800101.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 ltsminxred
Input is QuasiCertifProtocol-PT-28, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 107K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 666K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K Apr 13 03:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 76K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 121K Apr 13 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 795K Apr 13 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 749K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717221233135
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:53:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:53:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:53:54] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-06-01 05:53:54] [INFO ] Transformed 2998 places.
[2024-06-01 05:53:54] [INFO ] Transformed 446 transitions.
[2024-06-01 05:53:54] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Current structural bounds on expressions (Initially) : Max Seen:[0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 446 rows 2998 cols
[2024-06-01 05:53:54] [INFO ] Computed 2553 invariants in 168 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[841, 16, +inf, 841, 841, 1, 1, +inf, 29, 29, +inf, +inf, 29, +inf]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-01 16 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (302 resets) in 223 ms. (44 steps per ms)
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (169 resets) in 411 ms. (291 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[841, +inf, 841, 841, 1, +inf, 29, 29, +inf, +inf, 29, +inf]
[2024-06-01 05:53:55] [INFO ] Invariant cache hit.
[2024-06-01 05:53:56] [INFO ] [Real]Absence check using 32 positive place invariants in 70 ms returned sat
[2024-06-01 05:53:56] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 476 ms returned sat
[2024-06-01 05:54:00] [INFO ] [Real]Absence check using state equation in 4043 ms returned unknown
[2024-06-01 05:54:00] [INFO ] [Real]Absence check using 32 positive place invariants in 75 ms returned sat
[2024-06-01 05:54:01] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 500 ms returned sat
[2024-06-01 05:54:02] [INFO ] [Real]Absence check using state equation in 1354 ms returned sat
[2024-06-01 05:54:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:54:03] [INFO ] [Nat]Absence check using 32 positive place invariants in 62 ms returned sat
[2024-06-01 05:54:03] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 490 ms returned sat
[2024-06-01 05:54:05] [INFO ] [Nat]Absence check using state equation in 1297 ms returned sat
[2024-06-01 05:54:05] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 40 ms.
[2024-06-01 05:54:06] [INFO ] Added : 68 causal constraints over 14 iterations in 1168 ms. Result :sat
Minimization took 558 ms.
[2024-06-01 05:54:07] [INFO ] [Real]Absence check using 32 positive place invariants in 55 ms returned sat
[2024-06-01 05:54:07] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 487 ms returned sat
[2024-06-01 05:54:10] [INFO ] [Real]Absence check using state equation in 2424 ms returned sat
[2024-06-01 05:54:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:54:10] [INFO ] [Nat]Absence check using 32 positive place invariants in 64 ms returned sat
[2024-06-01 05:54:10] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 457 ms returned sat
[2024-06-01 05:54:13] [INFO ] [Nat]Absence check using state equation in 2181 ms returned unknown
[2024-06-01 05:54:13] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2024-06-01 05:54:13] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 480 ms returned sat
[2024-06-01 05:54:15] [INFO ] [Real]Absence check using state equation in 1305 ms returned sat
[2024-06-01 05:54:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:54:15] [INFO ] [Nat]Absence check using 32 positive place invariants in 53 ms returned sat
[2024-06-01 05:54:16] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 472 ms returned sat
[2024-06-01 05:54:17] [INFO ] [Nat]Absence check using state equation in 1644 ms returned sat
[2024-06-01 05:54:17] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 37 ms.
[2024-06-01 05:54:19] [INFO ] Added : 80 causal constraints over 16 iterations in 1214 ms. Result :sat
Minimization took 551 ms.
[2024-06-01 05:54:19] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2024-06-01 05:54:20] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 478 ms returned sat
[2024-06-01 05:54:21] [INFO ] [Real]Absence check using state equation in 1277 ms returned sat
[2024-06-01 05:54:21] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 35 ms.
[2024-06-01 05:54:22] [INFO ] Added : 59 causal constraints over 12 iterations in 977 ms. Result :sat
Minimization took 552 ms.
[2024-06-01 05:54:23] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2024-06-01 05:54:24] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 470 ms returned sat
[2024-06-01 05:54:25] [INFO ] [Real]Absence check using state equation in 1386 ms returned sat
[2024-06-01 05:54:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:54:25] [INFO ] [Nat]Absence check using 32 positive place invariants in 55 ms returned sat
[2024-06-01 05:54:26] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 457 ms returned sat
[2024-06-01 05:54:28] [INFO ] [Nat]Absence check using state equation in 2286 ms returned sat
[2024-06-01 05:54:28] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2024-06-01 05:54:29] [INFO ] Added : 61 causal constraints over 13 iterations in 947 ms. Result :sat
Minimization took 552 ms.
[2024-06-01 05:54:30] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2024-06-01 05:54:31] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 469 ms returned sat
[2024-06-01 05:54:32] [INFO ] [Real]Absence check using state equation in 1196 ms returned sat
[2024-06-01 05:54:32] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 33 ms.
[2024-06-01 05:54:34] [INFO ] Added : 125 causal constraints over 25 iterations in 1931 ms. Result :sat
Minimization took 553 ms.
[2024-06-01 05:54:35] [INFO ] [Real]Absence check using 32 positive place invariants in 57 ms returned sat
[2024-06-01 05:54:35] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 480 ms returned sat
[2024-06-01 05:54:35] [INFO ] [Real]Absence check using state equation in 91 ms returned unsat
[2024-06-01 05:54:36] [INFO ] [Real]Absence check using 32 positive place invariants in 61 ms returned sat
[2024-06-01 05:54:36] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 453 ms returned sat
[2024-06-01 05:54:37] [INFO ] [Real]Absence check using state equation in 1227 ms returned sat
[2024-06-01 05:54:37] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 39 ms.
[2024-06-01 05:54:38] [INFO ] Added : 41 causal constraints over 9 iterations in 767 ms. Result :sat
Minimization took 552 ms.
[2024-06-01 05:54:39] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2024-06-01 05:54:40] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 505 ms returned sat
[2024-06-01 05:54:41] [INFO ] [Real]Absence check using state equation in 1528 ms returned sat
[2024-06-01 05:54:41] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 35 ms.
[2024-06-01 05:54:44] [INFO ] Added : 147 causal constraints over 30 iterations in 2394 ms. Result :sat
Minimization took 57 ms.
[2024-06-01 05:54:44] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2024-06-01 05:54:45] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 498 ms returned sat
[2024-06-01 05:54:46] [INFO ] [Real]Absence check using state equation in 1221 ms returned sat
[2024-06-01 05:54:46] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2024-06-01 05:54:48] [INFO ] Added : 129 causal constraints over 26 iterations in 2027 ms. Result :sat
Minimization took 553 ms.
[2024-06-01 05:54:49] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2024-06-01 05:54:49] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 447 ms returned sat
[2024-06-01 05:54:51] [INFO ] [Real]Absence check using state equation in 1422 ms returned sat
[2024-06-01 05:54:51] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 30 ms.
[2024-06-01 05:54:53] [INFO ] Added : 139 causal constraints over 28 iterations in 2205 ms. Result :sat
Minimization took 420 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[841, +inf, 841, 841, 1, +inf, 29, 1, +inf, +inf, 29, +inf]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[841, +inf, 841, 841, 1, +inf, 29, +inf, +inf, 29, +inf]
Support contains 961 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2095 are kept as prefixes of interest. Removing 903 places using SCC suffix rule.17 ms
Discarding 903 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Iterating post reduction 0 with 176 rules applied. Total rules applied 177 place count 2066 transition count 269
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 177 place count 2066 transition count 239
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 57 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 1 with 117 rules applied. Total rules applied 294 place count 1979 transition count 239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 294 place count 1979 transition count 238
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 297 place count 1977 transition count 238
Applied a total of 297 rules in 273 ms. Remains 1977 /2998 variables (removed 1021) and now considering 238/446 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 1977/2998 places, 238/446 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 238 rows 1977 cols
[2024-06-01 05:54:54] [INFO ] Computed 1739 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[841, +inf, 841, 841, 1, +inf, 29, +inf, +inf, 29, +inf]
RANDOM walk for 1000000 steps (16125 resets) in 23110 ms. (43 steps per ms)
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9404363 steps (7831 resets) in 29856 ms. (314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 667, 0, 29, 29, 0, 1, 0, 0, 0] Max Struct:[841, +inf, 841, 841, +inf, 29, +inf, +inf, 29, +inf]
[2024-06-01 05:55:47] [INFO ] Invariant cache hit.
[2024-06-01 05:55:48] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 366 ms returned sat
[2024-06-01 05:55:49] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2024-06-01 05:55:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:55:49] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 356 ms returned sat
[2024-06-01 05:55:50] [INFO ] [Nat]Absence check using state equation in 1125 ms returned sat
[2024-06-01 05:55:50] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 20 ms.
[2024-06-01 05:55:52] [INFO ] Added : 117 causal constraints over 24 iterations in 1222 ms. Result :sat
Minimization took 2515 ms.
[2024-06-01 05:55:55] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 380 ms returned sat
[2024-06-01 05:55:55] [INFO ] [Real]Absence check using state equation in 847 ms returned sat
[2024-06-01 05:55:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:55:56] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 378 ms returned sat
[2024-06-01 05:55:57] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2024-06-01 05:55:57] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 22 ms.
[2024-06-01 05:55:58] [INFO ] Added : 80 causal constraints over 16 iterations in 823 ms. Result :sat
Minimization took 2402 ms.
[2024-06-01 05:56:01] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 362 ms returned sat
[2024-06-01 05:56:02] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2024-06-01 05:56:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:56:02] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 356 ms returned sat
[2024-06-01 05:56:05] [INFO ] [Nat]Absence check using state equation in 3216 ms returned sat
[2024-06-01 05:56:06] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 21 ms.
[2024-06-01 05:56:06] [INFO ] Added : 89 causal constraints over 18 iterations in 909 ms. Result :sat
Minimization took 2789 ms.
[2024-06-01 05:56:10] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 358 ms returned sat
[2024-06-01 05:56:11] [INFO ] [Real]Absence check using state equation in 1406 ms returned unsat
[2024-06-01 05:56:12] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 340 ms returned sat
[2024-06-01 05:56:12] [INFO ] [Real]Absence check using state equation in 420 ms returned unsat
[2024-06-01 05:56:13] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 357 ms returned sat
[2024-06-01 05:56:13] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2024-06-01 05:56:13] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 27 ms.
[2024-06-01 05:56:14] [INFO ] Added : 106 causal constraints over 22 iterations in 1155 ms. Result :sat
Minimization took 2221 ms.
[2024-06-01 05:56:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:56:17] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 354 ms returned sat
[2024-06-01 05:56:18] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2024-06-01 05:56:18] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 16 ms.
[2024-06-01 05:56:19] [INFO ] Added : 106 causal constraints over 22 iterations in 1061 ms. Result :sat
Minimization took 2196 ms.
[2024-06-01 05:56:22] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 367 ms returned sat
[2024-06-01 05:56:22] [INFO ] [Real]Absence check using state equation in 462 ms returned unsat
[2024-06-01 05:56:23] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 367 ms returned sat
[2024-06-01 05:56:23] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2024-06-01 05:56:23] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 18 ms.
[2024-06-01 05:56:24] [INFO ] Added : 88 causal constraints over 18 iterations in 956 ms. Result :sat
Minimization took 2193 ms.
[2024-06-01 05:56:27] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 352 ms returned sat
[2024-06-01 05:56:28] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2024-06-01 05:56:28] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 19 ms.
[2024-06-01 05:56:29] [INFO ] Added : 106 causal constraints over 22 iterations in 1181 ms. Result :sat
Minimization took 2255 ms.
[2024-06-01 05:56:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:56:32] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 362 ms returned sat
[2024-06-01 05:56:32] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2024-06-01 05:56:32] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 21 ms.
[2024-06-01 05:56:33] [INFO ] Added : 106 causal constraints over 22 iterations in 1103 ms. Result :sat
Minimization took 2184 ms.
[2024-06-01 05:56:36] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 361 ms returned sat
[2024-06-01 05:56:37] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2024-06-01 05:56:37] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 23 ms.
[2024-06-01 05:56:38] [INFO ] Added : 106 causal constraints over 22 iterations in 1198 ms. Result :sat
Minimization took 2227 ms.
[2024-06-01 05:56:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:56:41] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 352 ms returned sat
[2024-06-01 05:56:41] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2024-06-01 05:56:41] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 16 ms.
[2024-06-01 05:56:42] [INFO ] Added : 106 causal constraints over 22 iterations in 1059 ms. Result :sat
Minimization took 2183 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 667, 0, 29, 29, 0, 1, 0, 0, 0] Max Struct:[841, +inf, 841, 29, 29, 29, 1, +inf, 29, +inf]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-07 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-04 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[29, 841, 29, 1, 1, 1, 1] Max Struct:[841, +inf, 841, 29, +inf, 29, +inf]
Support contains 901 out of 1977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1977/1977 places, 238/238 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 1948 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 1947 transition count 207
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 61 place count 1947 transition count 149
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 29 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 206 place count 1860 transition count 149
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 207 place count 1860 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 1859 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 209 place count 1858 transition count 147
Applied a total of 209 rules in 187 ms. Remains 1858 /1977 variables (removed 119) and now considering 147/238 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 1858/1977 places, 147/238 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 147 rows 1858 cols
[2024-06-01 05:56:49] [INFO ] Computed 1711 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[29, 841, 29, 1, 1, 1, 1] Max Struct:[841, +inf, 841, 29, +inf, 29, +inf]
RANDOM walk for 557132 steps (4721 resets) in 30001 ms. (18 steps per ms)
BEST_FIRST walk for 3105957 steps (1300 resets) in 35008 ms. (88 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[29, 841, 29, 1, 1, 1, 1] Max Struct:[841, +inf, 841, 29, +inf, 29, +inf]
[2024-06-01 05:57:54] [INFO ] Invariant cache hit.
[2024-06-01 05:57:55] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 322 ms returned sat
[2024-06-01 05:57:57] [INFO ] [Real]Absence check using state equation in 2137 ms returned unsat
[2024-06-01 05:57:57] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 332 ms returned sat
[2024-06-01 05:58:12] [INFO ] [Real]Absence check using state equation in 14518 ms returned sat
[2024-06-01 05:58:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:58:12] [INFO ] [Nat]Absence check using 0 positive and 1711 generalized place invariants in 342 ms returned sat
[2024-06-01 05:58:23] [INFO ] [Nat]Absence check using state equation in 10661 ms returned sat
[2024-06-01 05:58:23] [INFO ] Computed and/alt/rep : 59/59/59 causal constraints (skipped 59 transitions) in 12 ms.
[2024-06-01 05:58:23] [INFO ] Added : 28 causal constraints over 6 iterations in 288 ms. Result :sat
Minimization took 1248 ms.
[2024-06-01 05:58:25] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 326 ms returned sat
[2024-06-01 05:58:28] [INFO ] [Real]Absence check using state equation in 2639 ms returned unsat
[2024-06-01 05:58:28] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 312 ms returned sat
[2024-06-01 05:58:29] [INFO ] [Real]Absence check using state equation in 496 ms returned unsat
[2024-06-01 05:58:29] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 314 ms returned sat
[2024-06-01 05:58:30] [INFO ] [Real]Absence check using state equation in 473 ms returned unsat
[2024-06-01 05:58:30] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 318 ms returned sat
[2024-06-01 05:58:31] [INFO ] [Real]Absence check using state equation in 278 ms returned unsat
[2024-06-01 05:58:31] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 315 ms returned sat
[2024-06-01 05:58:32] [INFO ] [Real]Absence check using state equation in 1028 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[29, 841, 29, 1, 1, 1, 1] Max Struct:[29, +inf, 29, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-03 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-00 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[841] Max Struct:[+inf]
Support contains 841 out of 1858 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1858/1858 places, 147/147 transitions.
Graph (complete) has 27058 edges and 1858 vertex of which 899 are kept as prefixes of interest. Removing 959 places using SCC suffix rule.2 ms
Discarding 959 places :
Also discarding 89 output transitions
Drop transitions (Output transitions of discarded places.) removed 89 transitions
Applied a total of 1 rules in 21 ms. Remains 899 /1858 variables (removed 959) and now considering 58/147 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 899/1858 places, 58/147 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 58 rows 899 cols
[2024-06-01 05:58:46] [INFO ] Computed 841 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[841] Max Struct:[+inf]
RANDOM walk for 555692 steps (9418 resets) in 30001 ms. (18 steps per ms)
BEST_FIRST walk for 113369 steps (122 resets) in 5001 ms. (22 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[841] Max Struct:[+inf]
[2024-06-01 05:59:21] [INFO ] Invariant cache hit.
[2024-06-01 05:59:21] [INFO ] [Real]Absence check using 0 positive and 841 generalized place invariants in 138 ms returned sat
[2024-06-01 05:59:22] [INFO ] [Real]Absence check using state equation in 645 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[841] Max Struct:[841]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-02 841 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 327873 ms.
ITS solved all properties within timeout
BK_STOP 1717221562214
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -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="QuasiCertifProtocol-PT-28"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is QuasiCertifProtocol-PT-28, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337800101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;