About the Execution of GreatSPN+red for Anderson-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 796.079 | 152585.00 | 201060.00 | 563.60 | FFTFFFFTTFFFTFFF | 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.r003-smll-171620117500348.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 Anderson-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117500348
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 667K May 18 16:42 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 Anderson-PT-08-LTLFireability-00
FORMULA_NAME Anderson-PT-08-LTLFireability-01
FORMULA_NAME Anderson-PT-08-LTLFireability-02
FORMULA_NAME Anderson-PT-08-LTLFireability-03
FORMULA_NAME Anderson-PT-08-LTLFireability-04
FORMULA_NAME Anderson-PT-08-LTLFireability-05
FORMULA_NAME Anderson-PT-08-LTLFireability-06
FORMULA_NAME Anderson-PT-08-LTLFireability-07
FORMULA_NAME Anderson-PT-08-LTLFireability-08
FORMULA_NAME Anderson-PT-08-LTLFireability-09
FORMULA_NAME Anderson-PT-08-LTLFireability-10
FORMULA_NAME Anderson-PT-08-LTLFireability-11
FORMULA_NAME Anderson-PT-08-LTLFireability-12
FORMULA_NAME Anderson-PT-08-LTLFireability-13
FORMULA_NAME Anderson-PT-08-LTLFireability-14
FORMULA_NAME Anderson-PT-08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716436767501
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 03:59:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 03:59:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 03:59:29] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2024-05-23 03:59:29] [INFO ] Transformed 401 places.
[2024-05-23 03:59:29] [INFO ] Transformed 1328 transitions.
[2024-05-23 03:59:29] [INFO ] Found NUPN structural information;
[2024-05-23 03:59:29] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Anderson-PT-08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 310 transition count 733
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 310 transition count 733
Applied a total of 182 rules in 128 ms. Remains 310 /401 variables (removed 91) and now considering 733/1328 (removed 595) transitions.
// Phase 1: matrix 733 rows 310 cols
[2024-05-23 03:59:30] [INFO ] Computed 19 invariants in 40 ms
[2024-05-23 03:59:31] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-05-23 03:59:31] [INFO ] Invariant cache hit.
[2024-05-23 03:59:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 03:59:32] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 2538 ms to find 0 implicit places.
Running 725 sub problems to find dead transitions.
[2024-05-23 03:59:32] [INFO ] Invariant cache hit.
[2024-05-23 03:59:32] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-23 03:59:40] [INFO ] Deduced a trap composed of 116 places in 344 ms of which 48 ms to minimize.
[2024-05-23 03:59:40] [INFO ] Deduced a trap composed of 133 places in 252 ms of which 5 ms to minimize.
[2024-05-23 03:59:41] [INFO ] Deduced a trap composed of 122 places in 238 ms of which 4 ms to minimize.
[2024-05-23 03:59:41] [INFO ] Deduced a trap composed of 152 places in 228 ms of which 4 ms to minimize.
[2024-05-23 03:59:41] [INFO ] Deduced a trap composed of 78 places in 268 ms of which 4 ms to minimize.
[2024-05-23 03:59:41] [INFO ] Deduced a trap composed of 105 places in 308 ms of which 8 ms to minimize.
[2024-05-23 03:59:42] [INFO ] Deduced a trap composed of 99 places in 291 ms of which 4 ms to minimize.
[2024-05-23 03:59:42] [INFO ] Deduced a trap composed of 100 places in 291 ms of which 5 ms to minimize.
[2024-05-23 03:59:42] [INFO ] Deduced a trap composed of 137 places in 238 ms of which 4 ms to minimize.
[2024-05-23 03:59:43] [INFO ] Deduced a trap composed of 127 places in 278 ms of which 3 ms to minimize.
[2024-05-23 03:59:43] [INFO ] Deduced a trap composed of 131 places in 282 ms of which 4 ms to minimize.
[2024-05-23 03:59:43] [INFO ] Deduced a trap composed of 177 places in 278 ms of which 3 ms to minimize.
[2024-05-23 03:59:44] [INFO ] Deduced a trap composed of 90 places in 286 ms of which 4 ms to minimize.
[2024-05-23 03:59:44] [INFO ] Deduced a trap composed of 212 places in 283 ms of which 3 ms to minimize.
[2024-05-23 03:59:44] [INFO ] Deduced a trap composed of 204 places in 282 ms of which 4 ms to minimize.
[2024-05-23 03:59:45] [INFO ] Deduced a trap composed of 209 places in 281 ms of which 3 ms to minimize.
[2024-05-23 03:59:45] [INFO ] Deduced a trap composed of 202 places in 225 ms of which 4 ms to minimize.
[2024-05-23 03:59:45] [INFO ] Deduced a trap composed of 193 places in 278 ms of which 3 ms to minimize.
[2024-05-23 03:59:45] [INFO ] Deduced a trap composed of 145 places in 277 ms of which 3 ms to minimize.
[2024-05-23 03:59:46] [INFO ] Deduced a trap composed of 156 places in 278 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-23 03:59:46] [INFO ] Deduced a trap composed of 220 places in 194 ms of which 3 ms to minimize.
[2024-05-23 03:59:47] [INFO ] Deduced a trap composed of 118 places in 263 ms of which 3 ms to minimize.
[2024-05-23 03:59:47] [INFO ] Deduced a trap composed of 131 places in 256 ms of which 3 ms to minimize.
[2024-05-23 03:59:47] [INFO ] Deduced a trap composed of 182 places in 262 ms of which 3 ms to minimize.
[2024-05-23 03:59:48] [INFO ] Deduced a trap composed of 169 places in 267 ms of which 3 ms to minimize.
[2024-05-23 03:59:48] [INFO ] Deduced a trap composed of 145 places in 222 ms of which 4 ms to minimize.
[2024-05-23 03:59:48] [INFO ] Deduced a trap composed of 160 places in 263 ms of which 4 ms to minimize.
[2024-05-23 03:59:48] [INFO ] Deduced a trap composed of 141 places in 277 ms of which 3 ms to minimize.
[2024-05-23 03:59:49] [INFO ] Deduced a trap composed of 128 places in 288 ms of which 3 ms to minimize.
[2024-05-23 03:59:49] [INFO ] Deduced a trap composed of 71 places in 266 ms of which 4 ms to minimize.
[2024-05-23 03:59:49] [INFO ] Deduced a trap composed of 211 places in 259 ms of which 3 ms to minimize.
[2024-05-23 03:59:50] [INFO ] Deduced a trap composed of 184 places in 253 ms of which 3 ms to minimize.
[2024-05-23 03:59:50] [INFO ] Deduced a trap composed of 195 places in 267 ms of which 3 ms to minimize.
[2024-05-23 03:59:50] [INFO ] Deduced a trap composed of 113 places in 270 ms of which 3 ms to minimize.
[2024-05-23 03:59:50] [INFO ] Deduced a trap composed of 187 places in 271 ms of which 5 ms to minimize.
[2024-05-23 03:59:51] [INFO ] Deduced a trap composed of 106 places in 257 ms of which 3 ms to minimize.
[2024-05-23 03:59:51] [INFO ] Deduced a trap composed of 116 places in 266 ms of which 4 ms to minimize.
[2024-05-23 03:59:51] [INFO ] Deduced a trap composed of 159 places in 276 ms of which 4 ms to minimize.
[2024-05-23 03:59:52] [INFO ] Deduced a trap composed of 99 places in 278 ms of which 3 ms to minimize.
[2024-05-23 03:59:52] [INFO ] Deduced a trap composed of 114 places in 277 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-23 03:59:59] [INFO ] Deduced a trap composed of 156 places in 274 ms of which 3 ms to minimize.
[2024-05-23 03:59:59] [INFO ] Deduced a trap composed of 76 places in 277 ms of which 3 ms to minimize.
[2024-05-23 04:00:00] [INFO ] Deduced a trap composed of 111 places in 286 ms of which 3 ms to minimize.
[2024-05-23 04:00:00] [INFO ] Deduced a trap composed of 96 places in 261 ms of which 3 ms to minimize.
[2024-05-23 04:00:01] [INFO ] Deduced a trap composed of 181 places in 251 ms of which 3 ms to minimize.
[2024-05-23 04:00:02] [INFO ] Deduced a trap composed of 159 places in 269 ms of which 3 ms to minimize.
[2024-05-23 04:00:02] [INFO ] Deduced a trap composed of 75 places in 290 ms of which 3 ms to minimize.
[2024-05-23 04:00:02] [INFO ] Deduced a trap composed of 197 places in 285 ms of which 3 ms to minimize.
[2024-05-23 04:00:03] [INFO ] Deduced a trap composed of 150 places in 270 ms of which 3 ms to minimize.
[2024-05-23 04:00:03] [INFO ] Deduced a trap composed of 154 places in 287 ms of which 3 ms to minimize.
[2024-05-23 04:00:03] [INFO ] Deduced a trap composed of 141 places in 287 ms of which 4 ms to minimize.
[2024-05-23 04:00:04] [INFO ] Deduced a trap composed of 56 places in 290 ms of which 4 ms to minimize.
[2024-05-23 04:00:04] [INFO ] Deduced a trap composed of 93 places in 267 ms of which 3 ms to minimize.
SMT process timed out in 31622ms, After SMT, problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 31663ms
Starting structural reductions in LTL mode, iteration 1 : 310/401 places, 733/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34387 ms. Remains : 310/401 places, 733/1328 transitions.
Support contains 37 out of 310 places after structural reductions.
[2024-05-23 04:00:04] [INFO ] Flatten gal took : 135 ms
[2024-05-23 04:00:05] [INFO ] Flatten gal took : 81 ms
[2024-05-23 04:00:05] [INFO ] Input system was already deterministic with 733 transitions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (8 resets) in 2892 ms. (13 steps per ms) remains 13/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
[2024-05-23 04:00:06] [INFO ] Invariant cache hit.
[2024-05-23 04:00:06] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 179/189 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 109/298 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 12/310 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 04:00:06] [INFO ] Deduced a trap composed of 63 places in 233 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 733/1043 variables, 310/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1043 variables, 56/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1043 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1043 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1043/1043 variables, and 386 constraints, problems are : Problem set: 0 solved, 3 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 310/310 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 179/189 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 109/298 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 6 (OVERLAPS) 12/310 variables, 9/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-23 04:00:07] [INFO ] Deduced a trap composed of 100 places in 225 ms of which 3 ms to minimize.
[2024-05-23 04:00:08] [INFO ] Deduced a trap composed of 85 places in 221 ms of which 3 ms to minimize.
[2024-05-23 04:00:08] [INFO ] Deduced a trap composed of 183 places in 297 ms of which 15 ms to minimize.
[2024-05-23 04:00:08] [INFO ] Deduced a trap composed of 131 places in 263 ms of which 4 ms to minimize.
[2024-05-23 04:00:08] [INFO ] Deduced a trap composed of 119 places in 280 ms of which 3 ms to minimize.
[2024-05-23 04:00:09] [INFO ] Deduced a trap composed of 96 places in 282 ms of which 4 ms to minimize.
[2024-05-23 04:00:09] [INFO ] Deduced a trap composed of 137 places in 282 ms of which 3 ms to minimize.
[2024-05-23 04:00:09] [INFO ] Deduced a trap composed of 104 places in 272 ms of which 3 ms to minimize.
[2024-05-23 04:00:10] [INFO ] Deduced a trap composed of 75 places in 278 ms of which 3 ms to minimize.
[2024-05-23 04:00:10] [INFO ] Deduced a trap composed of 150 places in 286 ms of which 4 ms to minimize.
[2024-05-23 04:00:10] [INFO ] Deduced a trap composed of 120 places in 283 ms of which 3 ms to minimize.
[2024-05-23 04:00:10] [INFO ] Deduced a trap composed of 94 places in 263 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 12/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 733/1043 variables, 310/342 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1043 variables, 56/398 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1043 variables, 2/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1043 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1043 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1043/1043 variables, and 400 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4861 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 310/310 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 5840ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 543 ms.
Support contains 6 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 733/733 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 310 transition count 677
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 254 transition count 677
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 131 place count 235 transition count 406
Iterating global reduction 0 with 19 rules applied. Total rules applied 150 place count 235 transition count 406
Applied a total of 150 rules in 68 ms. Remains 235 /310 variables (removed 75) and now considering 406/733 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 235/310 places, 406/733 transitions.
RANDOM walk for 40000 steps (8 resets) in 374 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 101763 steps, run visited all 2 properties in 889 ms. (steps per millisecond=114 )
Probabilistic random walk after 101763 steps, saw 69919 distinct states, run finished after 906 ms. (steps per millisecond=112 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA Anderson-PT-08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
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)) U G(!p2)))'
Support contains 6 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 310 transition count 677
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 254 transition count 677
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 130 place count 236 transition count 421
Iterating global reduction 0 with 18 rules applied. Total rules applied 148 place count 236 transition count 421
Applied a total of 148 rules in 59 ms. Remains 236 /310 variables (removed 74) and now considering 421/733 (removed 312) transitions.
// Phase 1: matrix 421 rows 236 cols
[2024-05-23 04:00:14] [INFO ] Computed 19 invariants in 8 ms
[2024-05-23 04:00:14] [INFO ] Implicit Places using invariants in 381 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/310 places, 421/733 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 235 transition count 360
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 174 transition count 360
Applied a total of 122 rules in 23 ms. Remains 174 /235 variables (removed 61) and now considering 360/421 (removed 61) transitions.
// Phase 1: matrix 360 rows 174 cols
[2024-05-23 04:00:14] [INFO ] Computed 18 invariants in 7 ms
[2024-05-23 04:00:15] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-23 04:00:15] [INFO ] Invariant cache hit.
[2024-05-23 04:00:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 04:00:15] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 174/310 places, 360/733 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1372 ms. Remains : 174/310 places, 360/733 transitions.
Stuttering acceptance computed with spot in 406 ms :[p2, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) p2 p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-00
Product exploration explored 100000 steps with 33160 reset in 534 ms.
Product exploration explored 100000 steps with 33148 reset in 375 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p2)), (X (OR (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 142 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[p2, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) p2 p1)]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 728 ms. (54 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
[2024-05-23 04:00:17] [INFO ] Invariant cache hit.
[2024-05-23 04:00:17] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 13/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 174/534 variables, and 18 constraints, problems are : Problem set: 2 solved, 0 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/174 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p2)), (X (OR (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F p1), (F (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 27 factoid took 441 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 174 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 : 174/174 places, 360/360 transitions.
Applied a total of 0 rules in 17 ms. Remains 174 /174 variables (removed 0) and now considering 360/360 (removed 0) transitions.
[2024-05-23 04:00:18] [INFO ] Invariant cache hit.
[2024-05-23 04:00:19] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-23 04:00:19] [INFO ] Invariant cache hit.
[2024-05-23 04:00:19] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 04:00:19] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2024-05-23 04:00:19] [INFO ] Redundant transitions in 27 ms returned []
Running 352 sub problems to find dead transitions.
[2024-05-23 04:00:19] [INFO ] Invariant cache hit.
[2024-05-23 04:00:19] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-23 04:00:22] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 3 ms to minimize.
[2024-05-23 04:00:22] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 2 ms to minimize.
[2024-05-23 04:00:22] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-05-23 04:00:22] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-23 04:00:22] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 2 ms to minimize.
[2024-05-23 04:00:23] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 2 ms to minimize.
[2024-05-23 04:00:23] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 3 ms to minimize.
[2024-05-23 04:00:23] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-05-23 04:00:23] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 2 ms to minimize.
[2024-05-23 04:00:23] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 3 ms to minimize.
[2024-05-23 04:00:24] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-23 04:00:24] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 2 ms to minimize.
[2024-05-23 04:00:24] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 3 ms to minimize.
[2024-05-23 04:00:24] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2024-05-23 04:00:24] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-05-23 04:00:24] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 2 ms to minimize.
[2024-05-23 04:00:24] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 2 ms to minimize.
[2024-05-23 04:00:25] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 2 ms to minimize.
[2024-05-23 04:00:25] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 2 ms to minimize.
[2024-05-23 04:00:25] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-23 04:00:25] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 2 ms to minimize.
[2024-05-23 04:00:26] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
[2024-05-23 04:00:26] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 2 ms to minimize.
[2024-05-23 04:00:26] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 2 ms to minimize.
[2024-05-23 04:00:27] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 2 ms to minimize.
[2024-05-23 04:00:27] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2024-05-23 04:00:27] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 2 ms to minimize.
[2024-05-23 04:00:27] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-23 04:00:28] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 2 ms to minimize.
[2024-05-23 04:00:28] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-23 04:00:28] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 2 ms to minimize.
[2024-05-23 04:00:28] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 3 ms to minimize.
[2024-05-23 04:00:28] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 2 ms to minimize.
[2024-05-23 04:00:28] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 3 ms to minimize.
[2024-05-23 04:00:28] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-05-23 04:00:29] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 3 ms to minimize.
[2024-05-23 04:00:29] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2024-05-23 04:00:29] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-05-23 04:00:29] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 2 ms to minimize.
[2024-05-23 04:00:29] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-23 04:00:32] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 3 ms to minimize.
[2024-05-23 04:00:32] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-05-23 04:00:32] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 3 ms to minimize.
[2024-05-23 04:00:32] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 2 ms to minimize.
[2024-05-23 04:00:32] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-05-23 04:00:33] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-23 04:00:33] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2024-05-23 04:00:33] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 2 ms to minimize.
[2024-05-23 04:00:33] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 3 ms to minimize.
[2024-05-23 04:00:33] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 2 ms to minimize.
[2024-05-23 04:00:33] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-23 04:00:34] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 2 ms to minimize.
[2024-05-23 04:00:34] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 3 ms to minimize.
[2024-05-23 04:00:34] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-05-23 04:00:34] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-05-23 04:00:34] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2024-05-23 04:00:34] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 3 ms to minimize.
[2024-05-23 04:00:34] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 2 ms to minimize.
[2024-05-23 04:00:35] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 2 ms to minimize.
[2024-05-23 04:00:35] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-23 04:00:36] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-05-23 04:00:36] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-23 04:00:36] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 3 ms to minimize.
[2024-05-23 04:00:36] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-23 04:00:36] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-05-23 04:00:37] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 3 ms to minimize.
[2024-05-23 04:00:37] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 2 ms to minimize.
[2024-05-23 04:00:38] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2024-05-23 04:00:38] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2024-05-23 04:00:38] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 2 ms to minimize.
[2024-05-23 04:00:38] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 2 ms to minimize.
[2024-05-23 04:00:38] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-23 04:00:38] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2024-05-23 04:00:39] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-05-23 04:00:39] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-05-23 04:00:39] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 3 ms to minimize.
[2024-05-23 04:00:39] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 3 ms to minimize.
[2024-05-23 04:00:39] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
[2024-05-23 04:00:39] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 2 ms to minimize.
[2024-05-23 04:00:39] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-23 04:00:41] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-23 04:00:41] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
[2024-05-23 04:00:42] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2024-05-23 04:00:42] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2024-05-23 04:00:42] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 2 ms to minimize.
[2024-05-23 04:00:42] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 2 ms to minimize.
[2024-05-23 04:00:42] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
[2024-05-23 04:00:42] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2024-05-23 04:00:42] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-05-23 04:00:43] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 3 ms to minimize.
[2024-05-23 04:00:43] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
[2024-05-23 04:00:43] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 3 ms to minimize.
[2024-05-23 04:00:43] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-05-23 04:00:43] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 2 ms to minimize.
[2024-05-23 04:00:43] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-23 04:00:44] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-05-23 04:00:44] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-05-23 04:00:44] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 3 ms to minimize.
[2024-05-23 04:00:44] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 2 ms to minimize.
[2024-05-23 04:00:44] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 8 (OVERLAPS) 360/534 variables, 174/292 constraints. Problems are: Problem set: 0 solved, 352 unsolved
SMT process timed out in 30265ms, After SMT, problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 30270ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31248 ms. Remains : 174/174 places, 360/360 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 33959 steps (7 resets) in 133 ms. (253 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 9 factoid took 239 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 195 ms.
Stack based approach found an accepted trace after 60784 steps with 0 reset with depth 60785 and stack size 45932 in 322 ms.
FORMULA Anderson-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-00 finished in 37075 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(G(p0)))'
Support contains 5 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 477
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 477
Applied a total of 36 rules in 13 ms. Remains 292 /310 variables (removed 18) and now considering 477/733 (removed 256) transitions.
// Phase 1: matrix 477 rows 292 cols
[2024-05-23 04:00:51] [INFO ] Computed 19 invariants in 8 ms
[2024-05-23 04:00:51] [INFO ] Implicit Places using invariants in 402 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 404 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/310 places, 477/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 421 ms. Remains : 291/310 places, 477/733 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-01 finished in 605 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(((p1 U !p2)&&p0))&&F(p2)&&X(p3)))'
Support contains 6 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 477
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 477
Applied a total of 36 rules in 9 ms. Remains 292 /310 variables (removed 18) and now considering 477/733 (removed 256) transitions.
// Phase 1: matrix 477 rows 292 cols
[2024-05-23 04:00:52] [INFO ] Computed 19 invariants in 12 ms
[2024-05-23 04:00:52] [INFO ] Implicit Places using invariants in 548 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 550 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/310 places, 477/733 transitions.
Applied a total of 0 rules in 3 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 563 ms. Remains : 291/310 places, 477/733 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (OR (NOT p0) p2), (NOT p2), (NOT p3), p2, true]
Running random walk in product with property : Anderson-PT-08-LTLFireability-03
Product exploration explored 100000 steps with 1 reset in 235 ms.
Stack based approach found an accepted trace after 74 steps with 1 reset with depth 73 and stack size 73 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-03 finished in 1072 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(X(X(X(F(p0))))))'
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 290 transition count 447
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 290 transition count 447
Applied a total of 40 rules in 8 ms. Remains 290 /310 variables (removed 20) and now considering 447/733 (removed 286) transitions.
// Phase 1: matrix 447 rows 290 cols
[2024-05-23 04:00:53] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 04:00:53] [INFO ] Implicit Places using invariants in 453 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 455 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/310 places, 447/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 289 /289 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 467 ms. Remains : 289/310 places, 447/733 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-04
Product exploration explored 100000 steps with 1 reset in 151 ms.
Stack based approach found an accepted trace after 67 steps with 0 reset with depth 68 and stack size 68 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-04 finished in 819 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)&&F(p1))))'
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 310 transition count 677
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 254 transition count 677
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 132 place count 234 transition count 391
Iterating global reduction 0 with 20 rules applied. Total rules applied 152 place count 234 transition count 391
Applied a total of 152 rules in 26 ms. Remains 234 /310 variables (removed 76) and now considering 391/733 (removed 342) transitions.
// Phase 1: matrix 391 rows 234 cols
[2024-05-23 04:00:53] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 04:00:54] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-23 04:00:54] [INFO ] Invariant cache hit.
[2024-05-23 04:00:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 04:00:55] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2024-05-23 04:00:55] [INFO ] Redundant transitions in 7 ms returned []
Running 383 sub problems to find dead transitions.
[2024-05-23 04:00:55] [INFO ] Invariant cache hit.
[2024-05-23 04:00:55] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 04:00:58] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 3 ms to minimize.
[2024-05-23 04:00:59] [INFO ] Deduced a trap composed of 76 places in 179 ms of which 4 ms to minimize.
[2024-05-23 04:00:59] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 2 ms to minimize.
[2024-05-23 04:01:00] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 2 ms to minimize.
[2024-05-23 04:01:00] [INFO ] Deduced a trap composed of 98 places in 176 ms of which 3 ms to minimize.
[2024-05-23 04:01:00] [INFO ] Deduced a trap composed of 108 places in 190 ms of which 3 ms to minimize.
[2024-05-23 04:01:00] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 2 ms to minimize.
[2024-05-23 04:01:00] [INFO ] Deduced a trap composed of 145 places in 150 ms of which 2 ms to minimize.
[2024-05-23 04:01:01] [INFO ] Deduced a trap composed of 125 places in 175 ms of which 2 ms to minimize.
[2024-05-23 04:01:01] [INFO ] Deduced a trap composed of 143 places in 186 ms of which 3 ms to minimize.
[2024-05-23 04:01:01] [INFO ] Deduced a trap composed of 149 places in 157 ms of which 3 ms to minimize.
[2024-05-23 04:01:01] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 3 ms to minimize.
[2024-05-23 04:01:01] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 2 ms to minimize.
[2024-05-23 04:01:02] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 3 ms to minimize.
[2024-05-23 04:01:02] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 3 ms to minimize.
[2024-05-23 04:01:02] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 3 ms to minimize.
[2024-05-23 04:01:02] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 3 ms to minimize.
[2024-05-23 04:01:02] [INFO ] Deduced a trap composed of 157 places in 198 ms of which 2 ms to minimize.
[2024-05-23 04:01:03] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 2 ms to minimize.
[2024-05-23 04:01:03] [INFO ] Deduced a trap composed of 127 places in 177 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 04:01:03] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 2 ms to minimize.
[2024-05-23 04:01:05] [INFO ] Deduced a trap composed of 134 places in 160 ms of which 2 ms to minimize.
[2024-05-23 04:01:05] [INFO ] Deduced a trap composed of 107 places in 175 ms of which 3 ms to minimize.
[2024-05-23 04:01:05] [INFO ] Deduced a trap composed of 127 places in 185 ms of which 3 ms to minimize.
[2024-05-23 04:01:05] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 3 ms to minimize.
[2024-05-23 04:01:06] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 3 ms to minimize.
[2024-05-23 04:01:06] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 3 ms to minimize.
[2024-05-23 04:01:06] [INFO ] Deduced a trap composed of 56 places in 190 ms of which 3 ms to minimize.
[2024-05-23 04:01:06] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 2 ms to minimize.
[2024-05-23 04:01:06] [INFO ] Deduced a trap composed of 77 places in 187 ms of which 3 ms to minimize.
[2024-05-23 04:01:07] [INFO ] Deduced a trap composed of 134 places in 172 ms of which 3 ms to minimize.
[2024-05-23 04:01:08] [INFO ] Deduced a trap composed of 120 places in 140 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 04:01:11] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 3 ms to minimize.
[2024-05-23 04:01:12] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2024-05-23 04:01:12] [INFO ] Deduced a trap composed of 143 places in 176 ms of which 4 ms to minimize.
[2024-05-23 04:01:13] [INFO ] Deduced a trap composed of 94 places in 182 ms of which 2 ms to minimize.
[2024-05-23 04:01:13] [INFO ] Deduced a trap composed of 85 places in 205 ms of which 3 ms to minimize.
[2024-05-23 04:01:13] [INFO ] Deduced a trap composed of 69 places in 179 ms of which 3 ms to minimize.
[2024-05-23 04:01:13] [INFO ] Deduced a trap composed of 95 places in 193 ms of which 3 ms to minimize.
[2024-05-23 04:01:13] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 2 ms to minimize.
[2024-05-23 04:01:14] [INFO ] Deduced a trap composed of 135 places in 177 ms of which 2 ms to minimize.
[2024-05-23 04:01:14] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 3 ms to minimize.
[2024-05-23 04:01:15] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 3 ms to minimize.
[2024-05-23 04:01:15] [INFO ] Deduced a trap composed of 107 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 04:01:16] [INFO ] Deduced a trap composed of 133 places in 170 ms of which 3 ms to minimize.
[2024-05-23 04:01:17] [INFO ] Deduced a trap composed of 97 places in 186 ms of which 3 ms to minimize.
[2024-05-23 04:01:18] [INFO ] Deduced a trap composed of 97 places in 178 ms of which 3 ms to minimize.
[2024-05-23 04:01:18] [INFO ] Deduced a trap composed of 107 places in 179 ms of which 3 ms to minimize.
[2024-05-23 04:01:18] [INFO ] Deduced a trap composed of 86 places in 159 ms of which 3 ms to minimize.
[2024-05-23 04:01:18] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 2 ms to minimize.
[2024-05-23 04:01:18] [INFO ] Deduced a trap composed of 121 places in 166 ms of which 2 ms to minimize.
[2024-05-23 04:01:18] [INFO ] Deduced a trap composed of 113 places in 175 ms of which 3 ms to minimize.
[2024-05-23 04:01:19] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 2 ms to minimize.
[2024-05-23 04:01:19] [INFO ] Deduced a trap composed of 149 places in 170 ms of which 3 ms to minimize.
[2024-05-23 04:01:19] [INFO ] Deduced a trap composed of 123 places in 168 ms of which 3 ms to minimize.
[2024-05-23 04:01:20] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 3 ms to minimize.
[2024-05-23 04:01:20] [INFO ] Deduced a trap composed of 147 places in 177 ms of which 3 ms to minimize.
[2024-05-23 04:01:20] [INFO ] Deduced a trap composed of 120 places in 185 ms of which 2 ms to minimize.
[2024-05-23 04:01:21] [INFO ] Deduced a trap composed of 103 places in 167 ms of which 3 ms to minimize.
[2024-05-23 04:01:21] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 2 ms to minimize.
[2024-05-23 04:01:21] [INFO ] Deduced a trap composed of 88 places in 176 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 04:01:25] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 3 ms to minimize.
[2024-05-23 04:01:25] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/625 variables, and 82 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/234 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 04:01:29] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 3 ms to minimize.
[2024-05-23 04:01:30] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 3 ms to minimize.
[2024-05-23 04:01:30] [INFO ] Deduced a trap composed of 134 places in 164 ms of which 4 ms to minimize.
[2024-05-23 04:01:30] [INFO ] Deduced a trap composed of 97 places in 163 ms of which 3 ms to minimize.
[2024-05-23 04:01:31] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 04:01:36] [INFO ] Deduced a trap composed of 94 places in 171 ms of which 2 ms to minimize.
[2024-05-23 04:01:36] [INFO ] Deduced a trap composed of 68 places in 187 ms of which 3 ms to minimize.
[2024-05-23 04:01:36] [INFO ] Deduced a trap composed of 128 places in 185 ms of which 3 ms to minimize.
[2024-05-23 04:01:36] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 2 ms to minimize.
[2024-05-23 04:01:36] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 3 ms to minimize.
[2024-05-23 04:01:37] [INFO ] Deduced a trap composed of 130 places in 185 ms of which 2 ms to minimize.
[2024-05-23 04:01:37] [INFO ] Deduced a trap composed of 112 places in 181 ms of which 3 ms to minimize.
[2024-05-23 04:01:37] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2024-05-23 04:01:37] [INFO ] Deduced a trap composed of 124 places in 173 ms of which 3 ms to minimize.
[2024-05-23 04:01:38] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 3 ms to minimize.
[2024-05-23 04:01:38] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 2 ms to minimize.
[2024-05-23 04:01:38] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-05-23 04:01:38] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
[2024-05-23 04:01:38] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 3 ms to minimize.
[2024-05-23 04:01:39] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 4 ms to minimize.
[2024-05-23 04:01:39] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 2 ms to minimize.
[2024-05-23 04:01:39] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 2 ms to minimize.
[2024-05-23 04:01:39] [INFO ] Deduced a trap composed of 91 places in 179 ms of which 3 ms to minimize.
[2024-05-23 04:01:39] [INFO ] Deduced a trap composed of 77 places in 195 ms of which 3 ms to minimize.
[2024-05-23 04:01:40] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/625 variables, and 107 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/234 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/383 constraints, Known Traps: 88/88 constraints]
After SMT, in 60391ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Starting structural reductions in SI_LTL mode, iteration 1 : 234/310 places, 391/733 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61601 ms. Remains : 234/310 places, 391/733 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 196 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-05 finished in 61946 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(X((G(p0)||F(((!p1&&F((!p1&&G(!p2))))||G((F(!p1)&&F(G(!p2))))))))))'
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 290 transition count 447
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 290 transition count 447
Applied a total of 40 rules in 9 ms. Remains 290 /310 variables (removed 20) and now considering 447/733 (removed 286) transitions.
// Phase 1: matrix 447 rows 290 cols
[2024-05-23 04:01:55] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 04:01:56] [INFO ] Implicit Places using invariants in 452 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 454 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/310 places, 447/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 289 /289 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 468 ms. Remains : 289/310 places, 447/733 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), p2, p2, p1, (AND (NOT p0) p2)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 145 ms.
Stack based approach found an accepted trace after 237 steps with 0 reset with depth 238 and stack size 201 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-06 finished in 988 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((G((F(p1)||p0))&&X((!p2 U (p3||G(!p2)))))))'
Support contains 6 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 477
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 477
Applied a total of 36 rules in 9 ms. Remains 292 /310 variables (removed 18) and now considering 477/733 (removed 256) transitions.
// Phase 1: matrix 477 rows 292 cols
[2024-05-23 04:01:56] [INFO ] Computed 19 invariants in 5 ms
[2024-05-23 04:01:57] [INFO ] Implicit Places using invariants in 478 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 480 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/310 places, 477/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 494 ms. Remains : 291/310 places, 477/733 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p3) p2), true]
Running random walk in product with property : Anderson-PT-08-LTLFireability-07
Product exploration explored 100000 steps with 2 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 199 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 95 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/3 properties
// Phase 1: matrix 477 rows 291 cols
[2024-05-23 04:01:58] [INFO ] Computed 18 invariants in 4 ms
[2024-05-23 04:01:58] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 266/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/284 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 291/768 variables, and 18 constraints, problems are : Problem set: 1 solved, 0 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/291 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLFireability-07 finished in 1509 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||(p1&&X(F(p1)))||G(F(p1))))))'
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 291 transition count 448
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 291 transition count 448
Applied a total of 38 rules in 9 ms. Remains 291 /310 variables (removed 19) and now considering 448/733 (removed 285) transitions.
// Phase 1: matrix 448 rows 291 cols
[2024-05-23 04:01:58] [INFO ] Computed 19 invariants in 6 ms
[2024-05-23 04:01:58] [INFO ] Implicit Places using invariants in 397 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 408 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/310 places, 448/733 transitions.
Applied a total of 0 rules in 3 ms. Remains 290 /290 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 422 ms. Remains : 290/310 places, 448/733 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-08-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 211 ms.
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLFireability-12 finished in 1022 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(G((F(p1)&&p0))))'
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 291 transition count 462
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 291 transition count 462
Applied a total of 38 rules in 9 ms. Remains 291 /310 variables (removed 19) and now considering 462/733 (removed 271) transitions.
// Phase 1: matrix 462 rows 291 cols
[2024-05-23 04:01:59] [INFO ] Computed 19 invariants in 5 ms
[2024-05-23 04:01:59] [INFO ] Implicit Places using invariants in 448 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 450 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/310 places, 462/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 463 ms. Remains : 290/310 places, 462/733 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-13 finished in 608 ms.
All properties solved by simple procedures.
Total runtime 150684 ms.
ITS solved all properties within timeout
BK_STOP 1716436920086
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-08"
export BK_EXAMINATION="LTLFireability"
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 Anderson-PT-08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620117500348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-08.tgz
mv Anderson-PT-08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;