About the Execution of LTSMin+red for QuasiCertifProtocol-PT-18
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
875.460 | 232120.00 | 290070.00 | 669.50 | FFFFFTFFFFTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337800084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is QuasiCertifProtocol-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800084
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 46K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 318K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 13 04:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 360K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717220164173
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:36:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:36:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:36:05] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-01 05:36:05] [INFO ] Transformed 1398 places.
[2024-06-01 05:36:05] [INFO ] Transformed 296 transitions.
[2024-06-01 05:36:05] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 901 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1356 transition count 296
Applied a total of 42 rules in 66 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-06-01 05:36:05] [INFO ] Computed 1062 invariants in 68 ms
[2024-06-01 05:36:06] [INFO ] Implicit Places using invariants in 907 ms returned []
[2024-06-01 05:36:06] [INFO ] Invariant cache hit.
[2024-06-01 05:36:07] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 05:36:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 0/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/1652 variables, 1/2418 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 276/2693 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/1652 variables, and 2693 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 60502ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60520ms
Starting structural reductions in LTL mode, iteration 1 : 1356/1398 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62688 ms. Remains : 1356/1398 places, 296/296 transitions.
Support contains 901 out of 1356 places after structural reductions.
[2024-06-01 05:37:08] [INFO ] Flatten gal took : 113 ms
[2024-06-01 05:37:08] [INFO ] Flatten gal took : 73 ms
[2024-06-01 05:37:09] [INFO ] Input system was already deterministic with 296 transitions.
Reduction of identical properties reduced properties to check from 22 to 20
RANDOM walk for 40000 steps (1765 resets) in 2070 ms. (19 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 117 ms. (33 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 59 ms. (66 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 195 ms. (20 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 58 ms. (67 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 481539 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 19
Probabilistic random walk after 481539 steps, saw 71852 distinct states, run finished after 3004 ms. (steps per millisecond=160 ) properties seen :0
[2024-06-01 05:37:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/901 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 83/984 variables, 432/756 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/984 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 316/1300 variables, 306/1062 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 296/1596 variables, 1300/2362 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1596 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 8 (OVERLAPS) 56/1652 variables, 56/2418 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 1 solved, 18 unsolved in 4552 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/882 variables, 324/324 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/882 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 64/946 variables, 414/738 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/946 variables, 0/738 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 316/1262 variables, 306/1044 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/1044 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 296/1558 variables, 1262/2306 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1558 variables, 11/2317 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1558 variables, 0/2317 constraints. Problems are: Problem set: 1 solved, 18 unsolved
SMT process timed out in 9692ms, After SMT, problems are : Problem set: 1 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 882 out of 1356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 66 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1356/1356 places, 296/296 transitions.
RANDOM walk for 40000 steps (1763 resets) in 730 ms. (54 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 43 ms. (91 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 55 ms. (71 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 506080 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 18
Probabilistic random walk after 506080 steps, saw 74976 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2024-06-01 05:37:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/882 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/882 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 64/946 variables, 414/738 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/946 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 316/1262 variables, 306/1044 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 296/1558 variables, 1262/2306 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1558 variables, 0/2306 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 94/1652 variables, 94/2400 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1652 variables, 18/2418 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 0 solved, 18 unsolved in 4130 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/882 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/882 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 64/946 variables, 414/738 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/946 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 316/1262 variables, 306/1044 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 296/1558 variables, 1262/2306 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1558 variables, 11/2317 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1558 variables, 0/2317 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 94/1652 variables, 94/2411 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1652 variables, 18/2429 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1652 variables, 7/2436 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1652 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/1652 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1652/1652 variables, and 2436 constraints, problems are : Problem set: 0 solved, 18 unsolved in 32483 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 36691ms problems are : Problem set: 0 solved, 18 unsolved
Finished Parikh walk after 138 steps, including 0 resets, run visited all 18 properties in 7 ms. (steps per millisecond=19 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 18 properties in 21 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 1356 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1356 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1))||(X(p3)&&p2))))'
Support contains 761 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-01 05:38:03] [INFO ] Invariant cache hit.
[2024-06-01 05:38:03] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-06-01 05:38:03] [INFO ] Invariant cache hit.
[2024-06-01 05:38:07] [INFO ] Implicit Places using invariants and state equation in 3886 ms returned []
Implicit Place search using SMT with State Equation took 4560 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 05:38:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 0/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/1652 variables, 1/2418 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 276/2693 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/1652 variables, and 2693 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60356ms
Finished structural reductions in LTL mode , in 1 iterations and 64930 ms. Remains : 1356/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 392 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-00
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-00 finished in 65413 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((p1||X(p2)))||p0)))'
Support contains 22 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 112 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-01 05:39:08] [INFO ] Invariant cache hit.
[2024-06-01 05:39:10] [INFO ] Implicit Places using invariants in 1434 ms returned []
[2024-06-01 05:39:10] [INFO ] Invariant cache hit.
[2024-06-01 05:39:12] [INFO ] Implicit Places using invariants and state equation in 2429 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3870 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 31 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4014 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-01 finished in 4214 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(p0) U p1))'
Support contains 39 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.18 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1333 transition count 291
Applied a total of 5 rules in 141 ms. Remains 1333 /1356 variables (removed 23) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2024-06-01 05:39:12] [INFO ] Computed 1044 invariants in 28 ms
[2024-06-01 05:39:14] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2024-06-01 05:39:14] [INFO ] Invariant cache hit.
[2024-06-01 05:39:16] [INFO ] Implicit Places using invariants and state equation in 2211 ms returned [810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 923, 924, 925, 926, 927, 928, 929, 930, 931, 1172, 1173, 1174, 1175, 1176, 1177, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1293, 1294, 1295, 1296, 1299]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3534 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1356 places, 291/296 transitions.
Applied a total of 0 rules in 59 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3735 ms. Remains : 1295/1356 places, 291/296 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-04
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-04 finished in 3956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 20 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 129 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-06-01 05:39:16] [INFO ] Computed 1062 invariants in 23 ms
[2024-06-01 05:39:18] [INFO ] Implicit Places using invariants in 1462 ms returned []
[2024-06-01 05:39:18] [INFO ] Invariant cache hit.
[2024-06-01 05:39:23] [INFO ] Implicit Places using invariants and state equation in 5112 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 6581 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 35 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6747 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-05 finished in 7943 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(p0)&&X(X(!p0))))'
Support contains 20 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-01 05:39:24] [INFO ] Invariant cache hit.
[2024-06-01 05:39:26] [INFO ] Implicit Places using invariants in 1445 ms returned []
[2024-06-01 05:39:26] [INFO ] Invariant cache hit.
[2024-06-01 05:39:28] [INFO ] Implicit Places using invariants and state equation in 2415 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3866 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 44 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3948 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), p0, p0, true]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-06 finished in 4144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 21 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.8 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1334 transition count 292
Applied a total of 5 rules in 103 ms. Remains 1334 /1356 variables (removed 22) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1334 cols
[2024-06-01 05:39:28] [INFO ] Computed 1044 invariants in 18 ms
[2024-06-01 05:39:30] [INFO ] Implicit Places using invariants in 1448 ms returned []
[2024-06-01 05:39:30] [INFO ] Invariant cache hit.
[2024-06-01 05:39:32] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned [810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 923, 924, 925, 926, 927, 928, 929, 930, 931]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3592 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1356 places, 292/296 transitions.
Applied a total of 0 rules in 50 ms. Remains 1315 /1315 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3745 ms. Remains : 1315/1356 places, 292/296 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-07
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-07 finished in 3810 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(G(p1)))))'
Support contains 23 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1354 transition count 294
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1354 transition count 294
Applied a total of 3 rules in 139 ms. Remains 1354 /1356 variables (removed 2) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1354 cols
[2024-06-01 05:39:32] [INFO ] Computed 1062 invariants in 16 ms
[2024-06-01 05:39:34] [INFO ] Implicit Places using invariants in 1452 ms returned []
[2024-06-01 05:39:34] [INFO ] Invariant cache hit.
[2024-06-01 05:39:36] [INFO ] Implicit Places using invariants and state equation in 2437 ms returned [812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 925, 926, 927, 928, 929, 930, 931, 932, 933, 1174, 1175, 1176, 1177, 1178, 1179, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1314, 1315, 1316, 1317, 1320]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3895 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1316/1356 places, 294/296 transitions.
Applied a total of 0 rules in 45 ms. Remains 1316 /1316 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4079 ms. Remains : 1316/1356 places, 294/296 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-08
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-08 finished in 4226 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(G((p1 U (X(p2)&&G(!p3)))))&&p0)))'
Support contains 24 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-06-01 05:39:36] [INFO ] Computed 1062 invariants in 16 ms
[2024-06-01 05:39:38] [INFO ] Implicit Places using invariants in 1454 ms returned []
[2024-06-01 05:39:38] [INFO ] Invariant cache hit.
[2024-06-01 05:39:40] [INFO ] Implicit Places using invariants and state equation in 2593 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 4052 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 33 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4123 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (NOT p2) p3), (OR (NOT p0) (NOT p2) p3), true, (OR (NOT p2) p3), (NOT p2), p3, (NOT p2), p3, (OR (NOT p2) p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-09 finished in 4510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 968 are kept as prefixes of interest. Removing 388 places using SCC suffix rule.4 ms
Discarding 388 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 967 transition count 280
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 937 transition count 220
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 937 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 936 transition count 219
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 936 transition count 219
Applied a total of 70 rules in 221 ms. Remains 936 /1356 variables (removed 420) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 936 cols
[2024-06-01 05:39:41] [INFO ] Computed 720 invariants in 3 ms
[2024-06-01 05:39:42] [INFO ] Implicit Places using invariants in 885 ms returned []
[2024-06-01 05:39:42] [INFO ] Invariant cache hit.
[2024-06-01 05:39:44] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned [413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 526, 527, 528, 529, 530, 531, 532, 533, 534, 775, 776, 777, 778, 779, 780, 783, 784, 785, 786, 787, 788, 789, 790, 896, 897, 898, 899, 902]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 2594 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 898/1356 places, 219/296 transitions.
Applied a total of 0 rules in 26 ms. Remains 898 /898 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2841 ms. Remains : 898/1356 places, 219/296 transitions.
Stuttering acceptance computed with spot in 85 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-10
Product exploration explored 100000 steps with 4154 reset in 282 ms.
Product exploration explored 100000 steps with 4157 reset in 281 ms.
Computed a total of 898 stabilizing places and 219 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 898 transition count 219
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-10 finished in 3680 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||G(p1)))))'
Support contains 21 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-06-01 05:39:45] [INFO ] Computed 1062 invariants in 17 ms
[2024-06-01 05:39:46] [INFO ] Implicit Places using invariants in 1283 ms returned []
[2024-06-01 05:39:46] [INFO ] Invariant cache hit.
[2024-06-01 05:39:51] [INFO ] Implicit Places using invariants and state equation in 5326 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 6617 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 32 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6690 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-13
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-13 finished in 6784 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((p0 U X((!p1 U G(p0))))))))'
Support contains 3 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-01 05:39:51] [INFO ] Invariant cache hit.
[2024-06-01 05:39:53] [INFO ] Implicit Places using invariants in 1402 ms returned []
[2024-06-01 05:39:53] [INFO ] Invariant cache hit.
[2024-06-01 05:39:55] [INFO ] Implicit Places using invariants and state equation in 2313 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3720 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 35 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3792 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-15 finished in 4071 ms.
All properties solved by simple procedures.
Total runtime 230630 ms.
ITS solved all properties within timeout
BK_STOP 1717220396293
--------------------
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="QuasiCertifProtocol-PT-18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-PT-18, 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 r520-tall-171662337800084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 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 ;