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.r312-tall-171662337700059.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 itstools
Input is QuasiCertifProtocol-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337700059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 9.0K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 03:44 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 3.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 13 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.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 58K 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-02-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716663623138

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-25 19:00:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 19:00:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:00:24] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-25 19:00:24] [INFO ] Transformed 86 places.
[2024-05-25 19:00:24] [INFO ] Transformed 56 transitions.
[2024-05-25 19:00:24] [INFO ] Found NUPN structural information;
[2024-05-25 19:00:24] [INFO ] Parsed PT model containing 86 places and 56 transitions and 223 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 83 transition count 56
Applied a total of 3 rules in 14 ms. Remains 83 /86 variables (removed 3) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 83 cols
[2024-05-25 19:00:24] [INFO ] Computed 28 invariants in 13 ms
[2024-05-25 19:00:24] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-25 19:00:24] [INFO ] Invariant cache hit.
[2024-05-25 19:00:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [46, 47, 53]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 297 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/86 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 327 ms. Remains : 80/86 places, 56/56 transitions.
Support contains 58 out of 80 places after structural reductions.
[2024-05-25 19:00:25] [INFO ] Flatten gal took : 25 ms
[2024-05-25 19:00:25] [INFO ] Flatten gal took : 9 ms
[2024-05-25 19:00:25] [INFO ] Input system was already deterministic with 56 transitions.
RANDOM walk for 40000 steps (6562 resets) in 1624 ms. (24 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4004 steps (212 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (264 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (264 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (225 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (224 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (220 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (226 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (217 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (225 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (219 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (233 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (221 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (221 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (220 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (225 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
// Phase 1: matrix 56 rows 80 cols
[2024-05-25 19:00:26] [INFO ] Computed 25 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 2 (OVERLAPS) 14/60 variables, 3/13 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 20/80 variables, 12/25 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 6 (OVERLAPS) 56/136 variables, 80/105 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/105 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/105 constraints. Problems are: Problem set: 5 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 105 constraints, problems are : Problem set: 5 solved, 10 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 10/10 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 15/57 variables, 3/13 constraints. Problems are: Problem set: 5 solved, 10 unsolved
[2024-05-25 19:00:26] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 14 ms to minimize.
[2024-05-25 19:00:26] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-25 19:00:26] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/16 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 20/77 variables, 11/27 constraints. Problems are: Problem set: 5 solved, 10 unsolved
[2024-05-25 19:00:26] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-25 19:00:27] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-25 19:00:27] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-25 19:00:27] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-25 19:00:27] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-25 19:00:27] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-25 19:00:27] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-25 19:00:27] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 8/35 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2/79 variables, 1/36 constraints. Problems are: Problem set: 5 solved, 10 unsolved
[2024-05-25 19:00:27] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 1/37 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/37 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 56/135 variables, 79/116 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 8/124 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/124 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 1/136 variables, 1/125 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 2/127 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/136 variables, 0/127 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/136 variables, 0/127 constraints. Problems are: Problem set: 5 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 127 constraints, problems are : Problem set: 5 solved, 10 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 10/15 constraints, Known Traps: 12/12 constraints]
After SMT, in 1677ms problems are : Problem set: 5 solved, 10 unsolved
Finished Parikh walk after 396 steps, including 16 resets, run visited all 1 properties in 2 ms. (steps per millisecond=198 )
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 10 properties in 35 ms.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 80 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 80 transition count 56
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(G(p0))&&F(p1)))'
Support contains 14 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 56
Applied a total of 7 rules in 3 ms. Remains 73 /80 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-25 19:00:28] [INFO ] Computed 20 invariants in 6 ms
[2024-05-25 19:00:28] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 19:00:28] [INFO ] Invariant cache hit.
[2024-05-25 19:00:28] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 19:00:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 821 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1079 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1923ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1926ms
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2050 ms. Remains : 73/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-01
Product exploration explored 100000 steps with 16423 reset in 220 ms.
Product exploration explored 100000 steps with 16425 reset in 160 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 199 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (6571 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 474 steps, run visited all 1 properties in 13 ms. (steps per millisecond=36 )
Probabilistic random walk after 474 steps, saw 194 distinct states, run finished after 21 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 11 factoid took 355 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-01 finished in 3559 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 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 40 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 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 39 transition count 39
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 37 transition count 35
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 37 transition count 35
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 36 transition count 33
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 36 transition count 33
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 15 place count 35 transition count 32
Applied a total of 15 rules in 24 ms. Remains 35 /80 variables (removed 45) and now considering 32/56 (removed 24) transitions.
// Phase 1: matrix 32 rows 35 cols
[2024-05-25 19:00:31] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 19:00:31] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 19:00:31] [INFO ] Invariant cache hit.
[2024-05-25 19:00:31] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [16, 20, 21]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 76 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/80 places, 32/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 32/80 places, 32/56 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-02
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-02 finished in 146 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||X((G(p1) U (p0&&G(p1)))))))))'
Support contains 7 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 56
Applied a total of 7 rules in 4 ms. Remains 73 /80 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-25 19:00:31] [INFO ] Computed 20 invariants in 3 ms
[2024-05-25 19:00:31] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-25 19:00:31] [INFO ] Invariant cache hit.
[2024-05-25 19:00:31] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 19:00:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 729 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1087 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1833ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1834ms
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1972 ms. Remains : 73/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-03 finished in 2243 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 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 69 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 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 66 transition count 51
Applied a total of 5 rules in 8 ms. Remains 66 /80 variables (removed 14) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 66 cols
[2024-05-25 19:00:34] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 19:00:34] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-25 19:00:34] [INFO ] Invariant cache hit.
[2024-05-25 19:00:34] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [49, 55, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 118 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/80 places, 51/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 63/80 places, 51/56 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-04 finished in 202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((F(p1)&&X((F(p2) U !p0)))))))'
Support contains 13 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 77 transition count 56
Applied a total of 3 rules in 2 ms. Remains 77 /80 variables (removed 3) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 77 cols
[2024-05-25 19:00:34] [INFO ] Computed 23 invariants in 3 ms
[2024-05-25 19:00:34] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-25 19:00:34] [INFO ] Invariant cache hit.
[2024-05-25 19:00:34] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 19:00:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/132 variables, 76/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 100 constraints, problems are : Problem set: 0 solved, 52 unsolved in 911 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/132 variables, 76/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 52/151 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 152 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1126 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 2049ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 2051ms
Starting structural reductions in LTL mode, iteration 1 : 77/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2170 ms. Remains : 77/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 546 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p1), p0, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-05
Product exploration explored 100000 steps with 17488 reset in 217 ms.
Product exploration explored 100000 steps with 17484 reset in 173 ms.
Computed a total of 77 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 351 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
RANDOM walk for 40000 steps (6568 resets) in 217 ms. (183 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (2233 resets) in 58 ms. (677 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2257 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
[2024-05-25 19:00:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/74 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 48/122 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 11/133 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 100 constraints, problems are : Problem set: 0 solved, 3 unsolved in 77 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/74 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 6 (OVERLAPS) 48/122 variables, 39/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 16/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/133 variables, 6/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 102 constraints, problems are : Problem set: 1 solved, 2 unsolved in 109 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 192ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p2 p0))), (F (NOT (OR p2 p0))), (F (NOT p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 14 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-05 finished in 4237 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 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 69 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 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 66 transition count 51
Applied a total of 5 rules in 6 ms. Remains 66 /80 variables (removed 14) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 66 cols
[2024-05-25 19:00:38] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 19:00:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 19:00:38] [INFO ] Invariant cache hit.
[2024-05-25 19:00:38] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [49, 55, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 119 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/80 places, 51/56 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 132 ms. Remains : 63/80 places, 51/56 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-06
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-06 finished in 216 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 9 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 44 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 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 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 42 transition count 38
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 42 transition count 38
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 1 with 4 rules applied. Total rules applied 13 place count 40 transition count 36
Applied a total of 13 rules in 5 ms. Remains 40 /80 variables (removed 40) and now considering 36/56 (removed 20) transitions.
// Phase 1: matrix 36 rows 40 cols
[2024-05-25 19:00:38] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 19:00:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-25 19:00:38] [INFO ] Invariant cache hit.
[2024-05-25 19:00:38] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [25, 29, 30]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 77 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/80 places, 36/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 37/80 places, 36/56 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-07
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-07 finished in 138 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||G(!p1))))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 74 transition count 56
Applied a total of 6 rules in 4 ms. Remains 74 /80 variables (removed 6) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2024-05-25 19:00:38] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 19:00:38] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-25 19:00:38] [INFO ] Invariant cache hit.
[2024-05-25 19:00:38] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 19:00:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 2/130 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 94 constraints, problems are : Problem set: 0 solved, 52 unsolved in 735 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 16/108 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 2/130 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 36/146 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 146 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1053 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1810ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1812ms
Starting structural reductions in LTL mode, iteration 1 : 74/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1931 ms. Remains : 74/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-08 finished in 2162 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(G((p0||X(G(p1))))))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 56
Applied a total of 7 rules in 4 ms. Remains 73 /80 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-25 19:00:40] [INFO ] Computed 20 invariants in 0 ms
[2024-05-25 19:00:41] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 19:00:41] [INFO ] Invariant cache hit.
[2024-05-25 19:00:41] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 19:00:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 732 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1034 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1783ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1785ms
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1897 ms. Remains : 73/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-09
Product exploration explored 100000 steps with 16425 reset in 110 ms.
Product exploration explored 100000 steps with 16406 reset in 110 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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 116 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (6564 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2232 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2277 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 475 steps, run visited all 2 properties in 6 ms. (steps per millisecond=79 )
Probabilistic random walk after 475 steps, saw 195 distinct states, run finished after 6 ms. (steps per millisecond=79 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-25 19:00:44] [INFO ] Invariant cache hit.
[2024-05-25 19:00:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-25 19:00:44] [INFO ] Invariant cache hit.
[2024-05-25 19:00:44] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 19:00:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 788 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1045 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1844ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1845ms
Finished structural reductions in LTL mode , in 1 iterations and 1966 ms. Remains : 73/73 places, 56/56 transitions.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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 93 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (6564 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2258 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2283 resets) in 20 ms. (1904 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 475 steps, run visited all 2 properties in 6 ms. (steps per millisecond=79 )
Probabilistic random walk after 475 steps, saw 195 distinct states, run finished after 6 ms. (steps per millisecond=79 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Entered a terminal (fully accepting) state of product in 22793 steps with 3745 reset in 21 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-09 finished in 6673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 69 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 67 transition count 52
Applied a total of 3 rules in 6 ms. Remains 67 /80 variables (removed 13) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 67 cols
[2024-05-25 19:00:47] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 19:00:47] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-25 19:00:47] [INFO ] Invariant cache hit.
[2024-05-25 19:00:47] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [50, 56, 57]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 101 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/80 places, 52/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 109 ms. Remains : 64/80 places, 52/56 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-15
Product exploration explored 100000 steps with 18772 reset in 74 ms.
Product exploration explored 100000 steps with 18764 reset in 80 ms.
Computed a total of 64 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 52
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (7536 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1875 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 214 steps, run visited all 1 properties in 3 ms. (steps per millisecond=71 )
Probabilistic random walk after 214 steps, saw 114 distinct states, run finished after 3 ms. (steps per millisecond=71 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 52/52 transitions.
Applied a total of 0 rules in 7 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 64 cols
[2024-05-25 19:00:48] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 19:00:48] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-25 19:00:48] [INFO ] Invariant cache hit.
[2024-05-25 19:00:48] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-25 19:00:48] [INFO ] Redundant transitions in 12 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-25 19:00:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 52/113 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 3/116 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 80 constraints, problems are : Problem set: 0 solved, 45 unsolved in 611 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 52/113 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 45/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 125 constraints, problems are : Problem set: 0 solved, 45 unsolved in 840 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1463ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1464ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1585 ms. Remains : 64/64 places, 52/52 transitions.
Computed a total of 64 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 52
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 40000 steps (7510 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 214 steps, run visited all 1 properties in 4 ms. (steps per millisecond=53 )
Probabilistic random walk after 214 steps, saw 114 distinct states, run finished after 4 ms. (steps per millisecond=53 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18727 reset in 72 ms.
Product exploration explored 100000 steps with 18737 reset in 73 ms.
Built C files in :
/tmp/ltsmin10225035635062575907
[2024-05-25 19:00:50] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-05-25 19:00:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:00:50] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-05-25 19:00:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:00:50] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-05-25 19:00:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:00:50] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10225035635062575907
Running compilation step : cd /tmp/ltsmin10225035635062575907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 279 ms.
Running link step : cd /tmp/ltsmin10225035635062575907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10225035635062575907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2467795459434684429.hoa' '--buchi-type=spotba'
LTSmin run took 211 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-15 finished in 3483 ms.
All properties solved by simple procedures.
Total runtime 26857 ms.

BK_STOP 1716663651466

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is QuasiCertifProtocol-PT-02, 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 r312-tall-171662337700059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;