About the Execution of LTSMin+red for QuasiCertifProtocol-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 570.623 | 3600000.00 | 14359738.00 | 359.50 | ?FFFTFFFTFFFTTFT | 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-171662337700067.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-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337700067
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 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 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K 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 78K 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-06-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717219755028
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:29:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:29:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:29:16] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-06-01 05:29:16] [INFO ] Transformed 270 places.
[2024-06-01 05:29:16] [INFO ] Transformed 116 transitions.
[2024-06-01 05:29:16] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 195 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 258 transition count 116
Applied a total of 12 rules in 18 ms. Remains 258 /270 variables (removed 12) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 258 cols
[2024-06-01 05:29:16] [INFO ] Computed 143 invariants in 13 ms
[2024-06-01 05:29:17] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 05:29:17] [INFO ] Invariant cache hit.
[2024-06-01 05:29:17] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 05:29:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 5/256 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 116/374 variables, 258/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 401 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4940 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 5/256 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 116/374 variables, 258/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 108/509 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 509 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11224ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11242ms
Starting structural reductions in LTL mode, iteration 1 : 258/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11798 ms. Remains : 258/270 places, 116/116 transitions.
Support contains 195 out of 258 places after structural reductions.
[2024-06-01 05:29:28] [INFO ] Flatten gal took : 49 ms
[2024-06-01 05:29:28] [INFO ] Flatten gal took : 19 ms
[2024-06-01 05:29:28] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (3926 resets) in 2511 ms. (15 steps per ms) remains 24/31 properties
BEST_FIRST walk for 4003 steps (68 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (68 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (70 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (67 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (65 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (69 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (68 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (68 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (61 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (88 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (64 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (68 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (63 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (70 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (66 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (67 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (69 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (70 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (69 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (72 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (69 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (71 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (72 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
[2024-06-01 05:29:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/168 variables, 2/51 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/51 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 36/204 variables, 50/101 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 40/244 variables, 36/137 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/137 constraints. Problems are: Problem set: 3 solved, 21 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 8 (OVERLAPS) 116/360 variables, 244/381 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/381 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 14/374 variables, 14/395 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 6/401 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/401 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/401 constraints. Problems are: Problem set: 7 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 401 constraints, problems are : Problem set: 7 solved, 17 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 49/49 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/49 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 4/168 variables, 2/51 constraints. Problems are: Problem set: 7 solved, 17 unsolved
[2024-06-01 05:29:31] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 8 ms to minimize.
[2024-06-01 05:29:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
[2024-06-01 05:29:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:29:31] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 4/55 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/55 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 36/204 variables, 50/105 constraints. Problems are: Problem set: 7 solved, 17 unsolved
[2024-06-01 05:29:31] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:29:31] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:29:31] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:29:31] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 2 ms to minimize.
[2024-06-01 05:29:31] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 11/116 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/116 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 40/244 variables, 36/152 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/152 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 116/360 variables, 244/396 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 15/411 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/411 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 14/374 variables, 14/425 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 6/431 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/374 variables, 2/433 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/374 variables, 0/433 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/374 variables, 0/433 constraints. Problems are: Problem set: 7 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 433 constraints, problems are : Problem set: 7 solved, 17 unsolved in 4956 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 17/24 constraints, Known Traps: 15/15 constraints]
After SMT, in 6465ms problems are : Problem set: 7 solved, 17 unsolved
Fused 17 Parikh solutions to 13 different solutions.
Finished Parikh walk after 45 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 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 17 properties in 335 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 258 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 258 transition count 116
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' '!((F(p0) U (p1&&G(F(p2)))))'
Support contains 65 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
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 2 place count 252 transition count 115
Applied a total of 2 rules in 42 ms. Remains 252 /258 variables (removed 6) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 252 cols
[2024-06-01 05:29:37] [INFO ] Computed 138 invariants in 7 ms
[2024-06-01 05:29:37] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 05:29:37] [INFO ] Invariant cache hit.
[2024-06-01 05:29:37] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [148, 149, 150, 151, 155, 160, 161, 198, 199, 223, 224, 225, 226, 227]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 460 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 238/258 places, 115/116 transitions.
Applied a total of 0 rules in 9 ms. Remains 238 /238 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 511 ms. Remains : 238/258 places, 115/116 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-00
Product exploration explored 100000 steps with 10244 reset in 382 ms.
Product exploration explored 100000 steps with 10250 reset in 227 ms.
Computed a total of 238 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 115
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 564 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (4098 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (508 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 171851 steps, run visited all 1 properties in 237 ms. (steps per millisecond=725 )
Probabilistic random walk after 171851 steps, saw 29132 distinct states, run finished after 240 ms. (steps per millisecond=716 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 14 factoid took 625 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Support contains 50 out of 238 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 : 238/238 places, 115/115 transitions.
Applied a total of 0 rules in 19 ms. Remains 238 /238 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 238 cols
[2024-06-01 05:29:40] [INFO ] Computed 126 invariants in 9 ms
[2024-06-01 05:29:40] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 05:29:40] [INFO ] Invariant cache hit.
[2024-06-01 05:29:40] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-06-01 05:29:40] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-06-01 05:29:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 115/345 variables, 230/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 8/353 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 364 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3637 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 115/345 variables, 230/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 91/447 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 8/353 variables, 8/455 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 464 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6557 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 10239ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 10241ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10626 ms. Remains : 238/238 places, 115/115 transitions.
Computed a total of 238 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 115
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (4098 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (498 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 171851 steps, run visited all 1 properties in 178 ms. (steps per millisecond=965 )
Probabilistic random walk after 171851 steps, saw 29132 distinct states, run finished after 179 ms. (steps per millisecond=960 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10259 reset in 184 ms.
Product exploration explored 100000 steps with 10249 reset in 180 ms.
Support contains 50 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 115/115 transitions.
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 1 place count 238 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 114
Applied a total of 3 rules in 19 ms. Remains 237 /238 variables (removed 1) and now considering 114/115 (removed 1) transitions.
// Phase 1: matrix 114 rows 237 cols
[2024-06-01 05:29:52] [INFO ] Computed 126 invariants in 7 ms
[2024-06-01 05:29:52] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 05:29:52] [INFO ] Invariant cache hit.
[2024-06-01 05:29:52] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-06-01 05:29:52] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-01 05:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 114/343 variables, 229/355 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 8/351 variables, 8/363 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/351 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 363 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3571 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 114/343 variables, 229/355 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 91/446 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 8/351 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 8/462 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/351 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 462 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6565 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 10176ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 10177ms
Starting structural reductions in SI_LTL mode, iteration 1 : 237/238 places, 114/115 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10538 ms. Remains : 237/238 places, 114/115 transitions.
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-00 finished in 25763 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))'
Support contains 49 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 244 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 14 ms. Remains 241 /258 variables (removed 17) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-06-01 05:30:02] [INFO ] Computed 132 invariants in 4 ms
[2024-06-01 05:30:02] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 05:30:02] [INFO ] Invariant cache hit.
[2024-06-01 05:30:03] [INFO ] Implicit Places using invariants and state equation in 322 ms returned [144, 145, 146, 147, 151, 156, 157, 194, 195, 219, 220, 221, 222, 223]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 472 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/258 places, 111/116 transitions.
Applied a total of 0 rules in 9 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 495 ms. Remains : 227/258 places, 111/116 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-01
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-01 finished in 537 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 U (G(p1)||(p1&&G(p0))))))))'
Support contains 15 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 173 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 172 transition count 84
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 16 place count 172 transition count 84
Applied a total of 16 rules in 12 ms. Remains 172 /258 variables (removed 86) and now considering 84/116 (removed 32) transitions.
// Phase 1: matrix 84 rows 172 cols
[2024-06-01 05:30:03] [INFO ] Computed 90 invariants in 1 ms
[2024-06-01 05:30:03] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 05:30:03] [INFO ] Invariant cache hit.
[2024-06-01 05:30:03] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [127, 128, 150, 151, 152, 153, 154]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 246 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/258 places, 84/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 165 /165 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 165/258 places, 84/116 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-02
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-02 finished in 423 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((!p0&&X(G((!p0||G(p1)))))) U (p2||X(X(p3)))))'
Support contains 66 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 12 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-06-01 05:30:03] [INFO ] Computed 139 invariants in 5 ms
[2024-06-01 05:30:03] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 05:30:03] [INFO ] Invariant cache hit.
[2024-06-01 05:30:04] [INFO ] Implicit Places using invariants and state equation in 232 ms returned [148, 149, 150, 151, 155, 160, 161]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 406 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 420 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 511 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (AND (NOT p1) p0 (NOT p3)), true, (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 170 ms.
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 13 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-04 finished in 1363 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)&&X(G(p1)))))'
Support contains 64 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 173 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.2 ms
Discarding 85 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 173 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 172 transition count 84
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 18 place count 172 transition count 84
Applied a total of 18 rules in 21 ms. Remains 172 /258 variables (removed 86) and now considering 84/116 (removed 32) transitions.
// Phase 1: matrix 84 rows 172 cols
[2024-06-01 05:30:05] [INFO ] Computed 90 invariants in 1 ms
[2024-06-01 05:30:05] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 05:30:05] [INFO ] Invariant cache hit.
[2024-06-01 05:30:05] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [81, 82, 83, 84, 87, 92, 93]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 231 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/258 places, 84/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 165 /165 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 257 ms. Remains : 165/258 places, 84/116 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-05
Stuttering criterion allowed to conclude after 226 steps with 20 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-05 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(F(p0)&&G(p1))))))'
Support contains 2 out of 258 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 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 254 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
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 2 place count 253 transition count 115
Applied a total of 2 rules in 17 ms. Remains 253 /258 variables (removed 5) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 253 cols
[2024-06-01 05:30:05] [INFO ] Computed 139 invariants in 2 ms
[2024-06-01 05:30:05] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 05:30:05] [INFO ] Invariant cache hit.
[2024-06-01 05:30:05] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [149, 150, 151, 152, 156, 161, 162, 199, 200, 224, 225, 226, 227, 228]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 419 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/258 places, 115/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 239 /239 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 444 ms. Remains : 239/258 places, 115/116 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-07
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-07 finished in 526 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(p0))'
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 2 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-06-01 05:30:06] [INFO ] Computed 139 invariants in 1 ms
[2024-06-01 05:30:06] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 05:30:06] [INFO ] Invariant cache hit.
[2024-06-01 05:30:06] [INFO ] Implicit Places using invariants and state equation in 301 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 453 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 458 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-12 finished in 818 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(G((X(p0)||F(p1))))))))'
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 5 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-06-01 05:30:06] [INFO ] Computed 138 invariants in 1 ms
[2024-06-01 05:30:07] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 05:30:07] [INFO ] Invariant cache hit.
[2024-06-01 05:30:07] [INFO ] Implicit Places using invariants and state equation in 256 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 403 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 410 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-15
Product exploration explored 100000 steps with 9832 reset in 195 ms.
Product exploration explored 100000 steps with 9840 reset in 159 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (3931 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (714 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (695 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (716 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1440957 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :2 out of 3
Probabilistic random walk after 1440957 steps, saw 230532 distinct states, run finished after 3003 ms. (steps per millisecond=479 ) properties seen :2
// Phase 1: matrix 116 rows 246 cols
[2024-06-01 05:30:11] [INFO ] Computed 132 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/82 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/93 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/113 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 102/215 variables, 75/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 147/362 variables, 147/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 114/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/362 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 2/362 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Generalized P Invariants (flows): 0/132 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-15 finished in 4817 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&&G(F(p2)))))'
[2024-06-01 05:30:11] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:30:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:30:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 258 places, 116 transitions and 647 arcs took 4 ms.
Total runtime 55678 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
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-06"
export BK_EXAMINATION="LTLCardinality"
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-06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337700067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;