About the Execution of GreatSPN+red for QuasiCertifProtocol-PT-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13749.235 | 2543275.00 | 5860412.00 | 4080.70 | TFFTTFFFFFT?F?FF | 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.r311-tall-171662335800091.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 greatspnxred
Input is QuasiCertifProtocol-PT-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 74K Apr 13 04:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 496K Apr 13 04:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 04:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 141K Apr 13 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 906K Apr 13 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 13 04:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K 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 503K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716658466133
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 17:34:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 17:34:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:34:27] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-25 17:34:27] [INFO ] Transformed 1966 places.
[2024-05-25 17:34:27] [INFO ] Transformed 356 transitions.
[2024-05-25 17:34:27] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1169 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 1920 transition count 356
Applied a total of 46 rules in 99 ms. Remains 1920 /1966 variables (removed 46) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1920 cols
[2024-05-25 17:34:27] [INFO ] Computed 1565 invariants in 76 ms
[2024-05-25 17:34:29] [INFO ] Implicit Places using invariants in 1779 ms returned []
[2024-05-25 17:34:29] [INFO ] Invariant cache hit.
[2024-05-25 17:34:32] [INFO ] Implicit Places using invariants and state equation in 3137 ms returned [1157, 1158, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1183, 1185, 1186, 1188]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 4967 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1898/1966 places, 356/356 transitions.
Applied a total of 0 rules in 19 ms. Remains 1898 /1898 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5102 ms. Remains : 1898/1966 places, 356/356 transitions.
Support contains 1169 out of 1898 places after structural reductions.
[2024-05-25 17:34:33] [INFO ] Flatten gal took : 152 ms
[2024-05-25 17:34:33] [INFO ] Flatten gal took : 74 ms
[2024-05-25 17:34:33] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 1167 out of 1898 places (down from 1169) after GAL structural reductions.
RANDOM walk for 40000 steps (1484 resets) in 3496 ms. (11 steps per ms) remains 12/18 properties
BEST_FIRST walk for 40004 steps (89 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (93 resets) in 241 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 759 ms. (52 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (86 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (89 resets) in 275 ms. (144 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (92 resets) in 542 ms. (73 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (87 resets) in 182 ms. (218 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (83 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (49 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (87 resets) in 243 ms. (163 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (85 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 193 ms. (206 steps per ms) remains 12/12 properties
// Phase 1: matrix 356 rows 1898 cols
[2024-05-25 17:34:35] [INFO ] Computed 1543 invariants in 32 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1160 variables, 968/968 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1160 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2/1162 variables, 1/969 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1162 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 641/1803 variables, 530/1499 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1803 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 6 (OVERLAPS) 353/2156 variables, 1803/3302 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2156 variables, 0/3302 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 98/2254 variables, 95/3397 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2254 variables, 44/3441 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2254 variables, 0/3441 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 331.0 5819.0))
(s1 (/ 2.0 529.0))
(s2 (/ 3.0 1058.0))
(s3 (/ 2.0 529.0))
(s4 (/ 2.0 529.0))
(s5 (/ 2.0 529.0))
(s6 (/ 2.0 529.0))
(s7 (/ 2.0 529.0))
(s8 (/ 2.0 529.0))
(s9 (/ 2.0 529.0))
(s10 (/ 2.0 529.0))
(s11 (/ 2.0 529.0))
(s12 (/ 2.0 529.0))
(s13 (/ 2.0 529.0))
(s14 (/ 2.0 529.0))
(s15 (/ 2.0 529.0))
(s16 (/ 2.0 529.0))
(s17 (/ 2.0 529.0))
(s18 (/ 2.0 529.0))
(s19 (/ 2.0 529.0))
(s20 (/ 2.0 529.0))
(s21 (/ 2.0 529.0))
(s22 (/ 2.0 529.0))
(s23 (/ 1.0 1058.0))
(s24 (/ 2.0 529.0))
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 (/ 1.0 2116.0))
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 (/ 150621.0 11638.0))
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 (/ 1.0 2116.0))
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 (/ 10007.0 11638.0))
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 (/ 527.0 529.0))
(s78 (/ 10007.0 11638.0))
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 (/ 10007.0 11638.0))
(s85 (/ 10007.0 11638.0))
(s86 (/ 10007.0 11638.0))
(s87 (/ 10007.0 11638.0))
(s88 (/ 10007.0 11638.0))
(s89 0.0)
(s90 (/ 10007.0 11638.0))
(s91 0.0)
(s92 0.0)
(s93 (/ 3.0 22.0))
(s94 (/ 3.0 22.0))
(s95 (/ 3.0 22.0))
(s96 (/ 3.0 22.0))
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 (/ 3.0 22.0))
(s102 0.0)
(s103 0.0)
(s104 (/ 3.0 22.0))
(s105 (/ 3.0 22.0))
(s106 (/ 3.0 22.0))
(s107 (/ 3.0 22.0))
(s108 (/ 3.0 22.0))
(s109 (/ 3.0 22.0))
(s110 0.0)
(s111 0.0)
(s112 (/ 3.0 22.0))
(s113 (/ 3.0 22.0))
(s114 0.0)
(s115 (/ 3.0 22.0))
(s116 (/ 3.0 22.0))
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 (/ 3.0 22.0))
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 timeout
0.0)
(s714 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2254/2254 variables, and 3441 constraints, problems are : Problem set: 3 solved, 9 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1542/1542 constraints, State Equation: 1898/1898 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 968/968 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/968 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/1161 variables, 1/969 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1161 variables, 0/969 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 642/1803 variables, 530/1499 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-05-25 17:34:41] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 7 ms to minimize.
[2024-05-25 17:34:42] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1803 variables, 2/1501 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1803 variables, 0/1501 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 353/2156 variables, 1803/3304 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2156/2254 variables, and 3308 constraints, problems are : Problem set: 3 solved, 9 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1498/1542 constraints, State Equation: 1803/1898 constraints, PredecessorRefiner: 4/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 10240ms problems are : Problem set: 3 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1159 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1896 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 1850 transition count 286
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 117 place count 1850 transition count 263
Deduced a syphon composed of 23 places in 4 ms
Ensure Unique test removed 22 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 1 with 68 rules applied. Total rules applied 185 place count 1805 transition count 263
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 186 place count 1804 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 1804 transition count 262
Applied a total of 187 rules in 211 ms. Remains 1804 /1898 variables (removed 94) and now considering 262/356 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 1804/1898 places, 262/356 transitions.
RANDOM walk for 40000 steps (1600 resets) in 1347 ms. (29 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (100 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 710 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (98 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (96 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (101 resets) in 339 ms. (117 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (95 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (64 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (95 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (102 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 371448 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 9
Probabilistic random walk after 371448 steps, saw 56462 distinct states, run finished after 3009 ms. (steps per millisecond=123 ) properties seen :0
// Phase 1: matrix 262 rows 1804 cols
[2024-05-25 17:34:49] [INFO ] Computed 1542 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 621/1780 variables, 1035/1519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1780 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 23/1803 variables, 23/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1803 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 262/2065 variables, 1803/3345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2065 variables, 0/3345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/2066 variables, 1/3346 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2066 variables, 0/3346 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2066 variables, 0/3346 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2066/2066 variables, and 3346 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3465 ms.
Refiners :[Generalized P Invariants (flows): 1542/1542 constraints, State Equation: 1804/1804 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 621/1780 variables, 1035/1519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1780 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 23/1803 variables, 23/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1803 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 262/2065 variables, 1803/3345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2065 variables, 7/3352 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2065 variables, 0/3352 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/2066 variables, 1/3353 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2066/2066 variables, and 3355 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45022 ms.
Refiners :[Generalized P Invariants (flows): 1542/1542 constraints, State Equation: 1804/1804 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 48579ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1159 out of 1804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1804/1804 places, 262/262 transitions.
Applied a total of 0 rules in 37 ms. Remains 1804 /1804 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1804/1804 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1804/1804 places, 262/262 transitions.
Applied a total of 0 rules in 54 ms. Remains 1804 /1804 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-25 17:35:38] [INFO ] Invariant cache hit.
[2024-05-25 17:35:39] [INFO ] Implicit Places using invariants in 1320 ms returned [116, 121]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1322 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1802/1804 places, 262/262 transitions.
Applied a total of 0 rules in 33 ms. Remains 1802 /1802 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1409 ms. Remains : 1802/1804 places, 262/262 transitions.
RANDOM walk for 40000 steps (1600 resets) in 1411 ms. (28 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (102 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (98 resets) in 576 ms. (69 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (98 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (94 resets) in 494 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (98 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (64 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (98 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (101 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 371661 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 9
Probabilistic random walk after 371661 steps, saw 56499 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
// Phase 1: matrix 262 rows 1802 cols
[2024-05-25 17:35:43] [INFO ] Computed 1540 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 620/1779 variables, 1034/1518 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1779 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 22/1801 variables, 22/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1801 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 262/2063 variables, 1801/3341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2063 variables, 0/3341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/2064 variables, 1/3342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2064 variables, 0/3342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2064 variables, 0/3342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2064/2064 variables, and 3342 constraints, problems are : Problem set: 0 solved, 9 unsolved in 8388 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1802/1802 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 620/1779 variables, 1034/1518 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1779 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 22/1801 variables, 22/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1801 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 262/2063 variables, 1801/3341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2063 variables, 7/3348 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2063 variables, 0/3348 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2064/2064 variables, and 3349 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75031 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1802/1802 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 83519ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1159 out of 1802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1802/1802 places, 262/262 transitions.
Applied a total of 0 rules in 37 ms. Remains 1802 /1802 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1802/1802 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1802/1802 places, 262/262 transitions.
Applied a total of 0 rules in 20 ms. Remains 1802 /1802 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-25 17:37:07] [INFO ] Invariant cache hit.
[2024-05-25 17:37:08] [INFO ] Implicit Places using invariants in 1273 ms returned []
[2024-05-25 17:37:08] [INFO ] Invariant cache hit.
[2024-05-25 17:37:14] [INFO ] Implicit Places using invariants and state equation in 5415 ms returned []
Implicit Place search using SMT with State Equation took 6702 ms to find 0 implicit places.
[2024-05-25 17:37:14] [INFO ] Redundant transitions in 20 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-25 17:37:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1799 variables, 1538/1538 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1799 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 3/1802 variables, 2/1540 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1802 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 262/2064 variables, 1802/3342 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2064/2064 variables, and 3342 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1802/1802 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1799 variables, 1538/1538 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1799 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 3/1802 variables, 2/1540 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1802 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 262/2064 variables, 1802/3342 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2064 variables, 238/3580 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2064/2064 variables, and 3580 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1802/1802 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 60330ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67098 ms. Remains : 1802/1802 places, 262/262 transitions.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1898 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1898 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 23 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1894 transition count 356
Applied a total of 4 rules in 61 ms. Remains 1894 /1898 variables (removed 4) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1894 cols
[2024-05-25 17:38:14] [INFO ] Computed 1540 invariants in 34 ms
[2024-05-25 17:38:17] [INFO ] Implicit Places using invariants in 2311 ms returned []
[2024-05-25 17:38:17] [INFO ] Invariant cache hit.
[2024-05-25 17:38:26] [INFO ] Implicit Places using invariants and state equation in 9505 ms returned [1164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11817 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1898 places, 356/356 transitions.
Applied a total of 0 rules in 58 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11936 ms. Remains : 1893/1898 places, 356/356 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-01
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-01 finished in 12150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(p1))))'
Support contains 1081 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1894 transition count 356
Applied a total of 4 rules in 14 ms. Remains 1894 /1898 variables (removed 4) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:38:26] [INFO ] Invariant cache hit.
[2024-05-25 17:38:28] [INFO ] Implicit Places using invariants in 1275 ms returned []
[2024-05-25 17:38:28] [INFO ] Invariant cache hit.
[2024-05-25 17:38:36] [INFO ] Implicit Places using invariants and state equation in 8054 ms returned [1164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9333 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1898 places, 356/356 transitions.
Applied a total of 0 rules in 16 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9379 ms. Remains : 1893/1898 places, 356/356 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-02 finished in 9517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 49 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1896 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1894 transition count 354
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1894 transition count 354
Applied a total of 4 rules in 268 ms. Remains 1894 /1898 variables (removed 4) and now considering 354/356 (removed 2) transitions.
// Phase 1: matrix 354 rows 1894 cols
[2024-05-25 17:38:36] [INFO ] Computed 1541 invariants in 47 ms
[2024-05-25 17:38:38] [INFO ] Implicit Places using invariants in 2316 ms returned []
[2024-05-25 17:38:38] [INFO ] Invariant cache hit.
[2024-05-25 17:38:45] [INFO ] Implicit Places using invariants and state equation in 6676 ms returned [1164, 1829, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853, 1854]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 9009 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1870/1898 places, 354/356 transitions.
Applied a total of 0 rules in 82 ms. Remains 1870 /1870 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9359 ms. Remains : 1870/1898 places, 354/356 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-05
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-05 finished in 9444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 529 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1341 are kept as prefixes of interest. Removing 557 places using SCC suffix rule.11 ms
Discarding 557 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1295 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1295 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 95 place count 1293 transition count 261
Applied a total of 95 rules in 119 ms. Remains 1293 /1898 variables (removed 605) and now considering 261/356 (removed 95) transitions.
// Phase 1: matrix 261 rows 1293 cols
[2024-05-25 17:38:45] [INFO ] Computed 1034 invariants in 17 ms
[2024-05-25 17:38:46] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2024-05-25 17:38:46] [INFO ] Invariant cache hit.
[2024-05-25 17:38:52] [INFO ] Implicit Places using invariants and state equation in 6029 ms returned [587, 1252, 1256, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 7046 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1269/1898 places, 261/356 transitions.
Applied a total of 0 rules in 37 ms. Remains 1269 /1269 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7202 ms. Remains : 1269/1898 places, 261/356 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-07
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-07 finished in 7262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1341 are kept as prefixes of interest. Removing 557 places using SCC suffix rule.5 ms
Discarding 557 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1296 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1296 transition count 265
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 91 place count 1295 transition count 264
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1295 transition count 264
Applied a total of 92 rules in 183 ms. Remains 1295 /1898 variables (removed 603) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1295 cols
[2024-05-25 17:38:53] [INFO ] Computed 1034 invariants in 9 ms
[2024-05-25 17:38:54] [INFO ] Implicit Places using invariants in 1416 ms returned []
[2024-05-25 17:38:54] [INFO ] Invariant cache hit.
[2024-05-25 17:38:57] [INFO ] Implicit Places using invariants and state equation in 2619 ms returned [589, 1254, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 4038 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1898 places, 264/356 transitions.
Applied a total of 0 rules in 56 ms. Remains 1271 /1271 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4277 ms. Remains : 1271/1898 places, 264/356 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-09
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-09 finished in 4384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1894 transition count 356
Applied a total of 4 rules in 77 ms. Remains 1894 /1898 variables (removed 4) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1894 cols
[2024-05-25 17:38:57] [INFO ] Computed 1540 invariants in 20 ms
[2024-05-25 17:38:59] [INFO ] Implicit Places using invariants in 2228 ms returned []
[2024-05-25 17:38:59] [INFO ] Invariant cache hit.
[2024-05-25 17:39:09] [INFO ] Implicit Places using invariants and state equation in 9478 ms returned [1164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11709 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1898 places, 356/356 transitions.
Applied a total of 0 rules in 69 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11855 ms. Remains : 1893/1898 places, 356/356 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-10
Product exploration explored 100000 steps with 36534 reset in 490 ms.
Product exploration explored 100000 steps with 36276 reset in 495 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-10 finished in 13434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1870 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1868 transition count 352
Applied a total of 5 rules in 126 ms. Remains 1868 /1898 variables (removed 30) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1868 cols
[2024-05-25 17:39:11] [INFO ] Computed 1518 invariants in 21 ms
[2024-05-25 17:39:13] [INFO ] Implicit Places using invariants in 2283 ms returned []
[2024-05-25 17:39:13] [INFO ] Invariant cache hit.
[2024-05-25 17:39:16] [INFO ] Implicit Places using invariants and state equation in 3548 ms returned [1161]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5835 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1867/1898 places, 352/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6028 ms. Remains : 1867/1898 places, 352/356 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-11
Product exploration explored 100000 steps with 3715 reset in 281 ms.
Product exploration explored 100000 steps with 3714 reset in 292 ms.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 transition count 352
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1489 resets) in 230 ms. (173 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (99 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (45 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (50 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
// Phase 1: matrix 352 rows 1867 cols
[2024-05-25 17:39:18] [INFO ] Computed 1518 invariants in 195 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/582 variables, 230/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 132/714 variables, 109/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 132/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/714 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 903/1617 variables, 903/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1617 variables, 903/2280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1617 variables, 0/2280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 602/2219 variables, 599/2879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2219 variables, 506/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2219/2219 variables, and 3385 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1067 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1867/1867 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/582 variables, 230/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 132/714 variables, 109/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/714 variables, 132/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 903/1617 variables, 903/1380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1617 variables, 903/2283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1617 variables, 0/2283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 602/2219 variables, 599/2882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 506/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2219 variables, 0/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2219 variables, 0/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2219/2219 variables, and 3388 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2509 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1867/1867 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3798ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 82 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=16 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 14 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 493 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 76 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-25 17:39:22] [INFO ] Invariant cache hit.
[2024-05-25 17:39:25] [INFO ] Implicit Places using invariants in 2359 ms returned []
[2024-05-25 17:39:25] [INFO ] Invariant cache hit.
[2024-05-25 17:39:28] [INFO ] Implicit Places using invariants and state equation in 3651 ms returned []
Implicit Place search using SMT with State Equation took 6021 ms to find 0 implicit places.
[2024-05-25 17:39:28] [INFO ] Redundant transitions in 32 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-25 17:39:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1866 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1866 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 352/2218 variables, 1866/3384 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2218/2219 variables, and 3384 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1866/1867 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1866 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1866 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 352/2218 variables, 1866/3384 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2218 variables, 328/3712 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2218/2219 variables, and 3712 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1866/1867 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60437ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66579 ms. Remains : 1867/1867 places, 352/352 transitions.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 transition count 352
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1483 resets) in 439 ms. (90 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (101 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (45 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (50 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
[2024-05-25 17:40:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/582 variables, 230/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 132/714 variables, 109/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 132/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/714 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 903/1617 variables, 903/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1617 variables, 903/2280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1617 variables, 0/2280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 602/2219 variables, 599/2879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2219 variables, 506/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2219/2219 variables, and 3385 constraints, problems are : Problem set: 0 solved, 3 unsolved in 952 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1867/1867 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/582 variables, 230/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 132/714 variables, 109/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/714 variables, 132/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 903/1617 variables, 903/1380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1617 variables, 903/2283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1617 variables, 0/2283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 602/2219 variables, 599/2882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 506/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2219 variables, 0/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2219 variables, 0/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2219/2219 variables, and 3388 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2227 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1867/1867 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3215ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=40 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 448 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3713 reset in 248 ms.
Product exploration explored 100000 steps with 3715 reset in 270 ms.
Support contains 3 out of 1867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 80 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-25 17:40:34] [INFO ] Invariant cache hit.
[2024-05-25 17:40:37] [INFO ] Implicit Places using invariants in 2417 ms returned []
[2024-05-25 17:40:37] [INFO ] Invariant cache hit.
[2024-05-25 17:40:40] [INFO ] Implicit Places using invariants and state equation in 3721 ms returned []
Implicit Place search using SMT with State Equation took 6166 ms to find 0 implicit places.
[2024-05-25 17:40:41] [INFO ] Redundant transitions in 39 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-25 17:40:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1866 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1866 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 352/2218 variables, 1866/3384 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2218/2219 variables, and 3384 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1866/1867 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1866 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1866 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 352/2218 variables, 1866/3384 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2218 variables, 328/3712 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2218/2219 variables, and 3712 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1866/1867 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints]
After SMT, in 60531ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60536ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66842 ms. Remains : 1867/1867 places, 352/352 transitions.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-11 finished in 150925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)&&p0)))'
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1341 are kept as prefixes of interest. Removing 557 places using SCC suffix rule.3 ms
Discarding 557 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1296 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1296 transition count 265
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 91 place count 1295 transition count 264
Applied a total of 91 rules in 244 ms. Remains 1295 /1898 variables (removed 603) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1295 cols
[2024-05-25 17:41:42] [INFO ] Computed 1034 invariants in 7 ms
[2024-05-25 17:41:43] [INFO ] Implicit Places using invariants in 1568 ms returned []
[2024-05-25 17:41:43] [INFO ] Invariant cache hit.
[2024-05-25 17:41:49] [INFO ] Implicit Places using invariants and state equation in 5489 ms returned [1254, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7075 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1272/1898 places, 264/356 transitions.
Applied a total of 0 rules in 55 ms. Remains 1272 /1272 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7387 ms. Remains : 1272/1898 places, 264/356 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-12
Stuttering criterion allowed to conclude after 58 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-12 finished in 7503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p0))||(F(p0)&&G(p1))))&&F(G(p2)))))'
Support contains 3 out of 1898 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1872 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.3 ms
Discarding 26 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
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 0 with 4 rules applied. Total rules applied 5 place count 1869 transition count 351
Applied a total of 5 rules in 122 ms. Remains 1869 /1898 variables (removed 29) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1869 cols
[2024-05-25 17:41:49] [INFO ] Computed 1520 invariants in 26 ms
[2024-05-25 17:41:51] [INFO ] Implicit Places using invariants in 2357 ms returned []
[2024-05-25 17:41:51] [INFO ] Invariant cache hit.
[2024-05-25 17:41:58] [INFO ] Implicit Places using invariants and state equation in 7203 ms returned [1163, 1828, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 9591 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/1898 places, 351/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1845 /1845 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9780 ms. Remains : 1845/1898 places, 351/356 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-13
Product exploration explored 100000 steps with 8580 reset in 404 ms.
Product exploration explored 100000 steps with 8493 reset in 385 ms.
Computed a total of 1845 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1845 transition count 351
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 334 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
RANDOM walk for 998 steps (34 resets) in 8 ms. (110 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 350 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
// Phase 1: matrix 351 rows 1845 cols
[2024-05-25 17:42:01] [INFO ] Computed 1497 invariants in 30 ms
[2024-05-25 17:42:01] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-25 17:42:04] [INFO ] [Real]Absence check using 1 positive and 1496 generalized place invariants in 2141 ms returned sat
[2024-05-25 17:42:16] [INFO ] [Real]Absence check using state equation in 12301 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 1845 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 351/351 transitions.
Applied a total of 0 rules in 69 ms. Remains 1845 /1845 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2024-05-25 17:42:16] [INFO ] Invariant cache hit.
[2024-05-25 17:42:18] [INFO ] Implicit Places using invariants in 2298 ms returned []
[2024-05-25 17:42:18] [INFO ] Invariant cache hit.
[2024-05-25 17:42:32] [INFO ] Implicit Places using invariants and state equation in 13224 ms returned []
Implicit Place search using SMT with State Equation took 15544 ms to find 0 implicit places.
[2024-05-25 17:42:32] [INFO ] Redundant transitions in 18 ms returned []
Running 304 sub problems to find dead transitions.
[2024-05-25 17:42:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 2/1822 variables, 1/1497 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1822 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 304 unsolved
SMT process timed out in 30480ms, After SMT, problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 30484ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46141 ms. Remains : 1845/1845 places, 351/351 transitions.
Computed a total of 1845 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1845 transition count 351
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 350 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
RANDOM walk for 2665 steps (93 resets) in 16 ms. (156 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 387 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
[2024-05-25 17:43:03] [INFO ] Invariant cache hit.
[2024-05-25 17:43:04] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-25 17:43:06] [INFO ] [Real]Absence check using 1 positive and 1496 generalized place invariants in 2088 ms returned sat
[2024-05-25 17:43:18] [INFO ] [Real]Absence check using state equation in 12347 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 8550 reset in 314 ms.
Product exploration explored 100000 steps with 8697 reset in 339 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 351/351 transitions.
Graph (complete) has 15804 edges and 1845 vertex of which 1315 are kept as prefixes of interest. Removing 530 places using SCC suffix rule.3 ms
Discarding 530 places :
Also discarding 0 output transitions
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1271 transition count 263
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1271 transition count 263
Applied a total of 89 rules in 81 ms. Remains 1271 /1845 variables (removed 574) and now considering 263/351 (removed 88) transitions.
// Phase 1: matrix 263 rows 1271 cols
[2024-05-25 17:43:19] [INFO ] Computed 1012 invariants in 13 ms
[2024-05-25 17:43:21] [INFO ] Implicit Places using invariants in 1387 ms returned []
[2024-05-25 17:43:21] [INFO ] Invariant cache hit.
[2024-05-25 17:43:28] [INFO ] Implicit Places using invariants and state equation in 7613 ms returned []
Implicit Place search using SMT with State Equation took 9020 ms to find 0 implicit places.
[2024-05-25 17:43:28] [INFO ] Redundant transitions in 20 ms returned []
Running 216 sub problems to find dead transitions.
[2024-05-25 17:43:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 263/1510 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1510 variables, 0/2259 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 24/1534 variables, 24/2283 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1534 variables, 0/2283 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1534/1534 variables, and 2283 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1271/1271 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 263/1510 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1510 variables, 29/2288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1510 variables, 0/2288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 24/1534 variables, 24/2312 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1534/1534 variables, and 2499 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30071 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1271/1271 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1845 places, 263/351 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69463 ms. Remains : 1271/1845 places, 263/351 transitions.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-13 finished in 159953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p0))||(F(p0)&&G(p1))))&&F(G(p2)))))'
[2024-05-25 17:44:29] [INFO ] Flatten gal took : 74 ms
[2024-05-25 17:44:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-25 17:44:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1898 places, 356 transitions and 4251 arcs took 6 ms.
Total runtime 602409 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running QuasiCertifProtocol-PT-22
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1898
TRANSITIONS: 356
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.036s, Sys 0.002s]
SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.003s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1232
MODEL NAME: /home/mcc/execution/403/model
1898 places, 356 transitions.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716661009408
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-22"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is QuasiCertifProtocol-PT-22, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335800091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;