About the Execution of GreatSPN+red for QuasiCertifProtocol-PT-32
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
12821.376 | 3087616.00 | 6825948.00 | 5085.60 | T?TFFFFFTTFT?TT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r311-tall-171662335900107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is QuasiCertifProtocol-PT-32, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335900107
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 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 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K 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 942K 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-32-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716664134074
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 19:08:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 19:08:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:08:55] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-25 19:08:55] [INFO ] Transformed 3806 places.
[2024-05-25 19:08:55] [INFO ] Transformed 506 transitions.
[2024-05-25 19:08:55] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1340 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3805 transition count 506
Applied a total of 1 rules in 264 ms. Remains 3805 /3806 variables (removed 1) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3805 cols
[2024-05-25 19:08:56] [INFO ] Computed 3300 invariants in 117 ms
[2024-05-25 19:09:00] [INFO ] Implicit Places using invariants in 4845 ms returned []
[2024-05-25 19:09:00] [INFO ] Invariant cache hit.
[2024-05-25 19:09:18] [INFO ] Implicit Places using invariants and state equation in 17796 ms returned [2316, 2317, 2320, 2321, 2322, 2323, 2328, 2329, 2332, 2333, 2334, 2335, 2336, 2337, 2338, 2339, 2340, 2341, 2342, 2343, 2344, 2345, 2346, 2347, 2356, 2357, 2358, 2359, 2360, 2361, 2362]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 22702 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3774/3806 places, 506/506 transitions.
Applied a total of 0 rules in 241 ms. Remains 3774 /3774 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23225 ms. Remains : 3774/3806 places, 506/506 transitions.
Support contains 1340 out of 3774 places after structural reductions.
[2024-05-25 19:09:19] [INFO ] Flatten gal took : 231 ms
[2024-05-25 19:09:19] [INFO ] Flatten gal took : 135 ms
[2024-05-25 19:09:19] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 1338 out of 3774 places (down from 1340) after GAL structural reductions.
RANDOM walk for 40000 steps (1071 resets) in 2672 ms. (14 steps per ms) remains 19/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
// Phase 1: matrix 506 rows 3774 cols
[2024-05-25 19:09:20] [INFO ] Computed 3269 invariants in 50 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1334 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1334 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/1337 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1337 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1380/2717 variables, 2213/2246 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2717 variables, 0/2246 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 991/3708 variables, 991/3237 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3708/4280 variables, and 3237 constraints, problems are : Problem set: 2 solved, 17 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3236/3268 constraints, State Equation: 0/3774 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1333 variables, 32/32 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1333 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 4/1337 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1337 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1380/2717 variables, 2213/2246 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2717 variables, 0/2246 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 991/3708 variables, 991/3237 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3708/4280 variables, and 3237 constraints, problems are : Problem set: 2 solved, 17 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3236/3268 constraints, State Equation: 0/3774 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 10247ms problems are : Problem set: 2 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1333 out of 3774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 42221 edges and 3774 vertex of which 3773 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 164 rules applied. Total rules applied 165 place count 3740 transition count 375
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 165 place count 3740 transition count 346
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 1 with 58 rules applied. Total rules applied 223 place count 3711 transition count 346
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 224 place count 3710 transition count 345
Ensure Unique test removed 32 places
Iterating post reduction 1 with 32 rules applied. Total rules applied 256 place count 3678 transition count 345
Applied a total of 256 rules in 503 ms. Remains 3678 /3774 variables (removed 96) and now considering 345/506 (removed 161) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 503 ms. Remains : 3678/3774 places, 345/506 transitions.
RANDOM walk for 40000 steps (649 resets) in 1796 ms. (22 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 365651 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 16
Probabilistic random walk after 365651 steps, saw 50088 distinct states, run finished after 3004 ms. (steps per millisecond=121 ) properties seen :0
// Phase 1: matrix 345 rows 3678 cols
[2024-05-25 19:09:35] [INFO ] Computed 3333 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1332 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1332 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/1335 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1335 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2310/3645 variables, 3267/3301 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3645 variables, 0/3301 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 32/3677 variables, 32/3333 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3677 variables, 0/3333 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 8 (OVERLAPS) 344/4021 variables, 3677/7010 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4021 variables, 0/7010 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 2/4023 variables, 1/7011 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4023 variables, 0/7011 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/4023 variables, 0/7011 constraints. Problems are: Problem set: 3 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4023/4023 variables, and 7011 constraints, problems are : Problem set: 3 solved, 13 unsolved in 18423 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3331/3331 constraints, State Equation: 3678/3678 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1330 variables, 32/32 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1330 variables, 0/32 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 4/1334 variables, 2/34 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 2311/3645 variables, 3267/3301 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3645 variables, 0/3301 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 32/3677 variables, 32/3333 constraints. Problems are: Problem set: 3 solved, 13 unsolved
[2024-05-25 19:10:05] [INFO ] Deduced a trap composed of 4 places in 1169 ms of which 111 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3677 variables, 1/3334 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3677 variables, 0/3334 constraints. Problems are: Problem set: 3 solved, 13 unsolved
SMT process timed out in 63551ms, After SMT, problems are : Problem set: 3 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1330 out of 3678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3678/3678 places, 345/345 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3678 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3677 transition count 343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 3677 transition count 342
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 3676 transition count 342
Applied a total of 5 rules in 220 ms. Remains 3676 /3678 variables (removed 2) and now considering 342/345 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 3676/3678 places, 342/345 transitions.
RANDOM walk for 40000 steps (661 resets) in 1311 ms. (30 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (36 resets) in 199 ms. (200 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 187 ms. (212 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (36 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 809 ms. (49 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 184 ms. (216 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (36 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (27 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (28 resets) in 87 ms. (454 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 412647 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 13
Probabilistic random walk after 412647 steps, saw 55967 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
// Phase 1: matrix 342 rows 3676 cols
[2024-05-25 19:10:43] [INFO ] Computed 3334 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1330 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1330 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 3/1333 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1333 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 2310/3643 variables, 3267/3301 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3643 variables, 0/3301 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 33/3676 variables, 33/3334 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3676 variables, 0/3334 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 342/4018 variables, 3676/7010 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4018 variables, 0/7010 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/4018 variables, 0/7010 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4018/4018 variables, and 7010 constraints, problems are : Problem set: 0 solved, 13 unsolved in 21467 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3332/3332 constraints, State Equation: 3676/3676 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1330 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1330 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 3/1333 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1333 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 2310/3643 variables, 3267/3301 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3643 variables, 0/3301 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 33/3676 variables, 33/3334 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3676 variables, 0/3334 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 342/4018 variables, 3676/7010 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4018 variables, 13/7023 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4018 variables, 0/7023 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4018/4018 variables, and 7023 constraints, problems are : Problem set: 0 solved, 13 unsolved in 75041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3332/3332 constraints, State Equation: 3676/3676 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 96584ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1330 out of 3676 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3676/3676 places, 342/342 transitions.
Applied a total of 0 rules in 159 ms. Remains 3676 /3676 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 3676/3676 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3676/3676 places, 342/342 transitions.
Applied a total of 0 rules in 137 ms. Remains 3676 /3676 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2024-05-25 19:12:20] [INFO ] Invariant cache hit.
[2024-05-25 19:12:25] [INFO ] Implicit Places using invariants in 5774 ms returned [38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 76, 138, 152]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 5778 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3642/3676 places, 342/342 transitions.
Applied a total of 0 rules in 132 ms. Remains 3642 /3642 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6050 ms. Remains : 3642/3676 places, 342/342 transitions.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3774 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3774 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)||G(p1))))'
Support contains 99 out of 3774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 42221 edges and 3774 vertex of which 2584 are kept as prefixes of interest. Removing 1190 places using SCC suffix rule.28 ms
Discarding 1190 places :
Also discarding 33 output transitions
Drop transitions (Output transitions of discarded places.) removed 33 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2583 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2582 transition count 440
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2582 transition count 440
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 35 place count 2581 transition count 439
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 36 place count 2581 transition count 439
Applied a total of 36 rules in 784 ms. Remains 2581 /3774 variables (removed 1193) and now considering 439/506 (removed 67) transitions.
// Phase 1: matrix 439 rows 2581 cols
[2024-05-25 19:12:26] [INFO ] Computed 2145 invariants in 11 ms
[2024-05-25 19:12:31] [INFO ] Implicit Places using invariants in 4511 ms returned []
[2024-05-25 19:12:31] [INFO ] Invariant cache hit.
[2024-05-25 19:12:38] [INFO ] Implicit Places using invariants and state equation in 6878 ms returned [1158, 1159, 2191, 2192, 2193, 2194, 2195, 2196, 2197, 2198, 2554, 2557, 2558, 2559, 2560, 2561, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2575, 2576, 2577, 2578, 2579, 2580]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 11396 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2546/3774 places, 439/506 transitions.
Applied a total of 0 rules in 136 ms. Remains 2546 /2546 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12316 ms. Remains : 2546/3774 places, 439/506 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-01
Product exploration explored 100000 steps with 2440 reset in 964 ms.
Product exploration explored 100000 steps with 2440 reset in 912 ms.
Computed a total of 2546 stabilizing places and 439 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2546 transition count 439
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 p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 307 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
RANDOM walk for 40005 steps (900 resets) in 915 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 232 ms. (171 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (24 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (24 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (24 resets) in 145 ms. (273 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 472152 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 6
Probabilistic random walk after 472152 steps, saw 59828 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
// Phase 1: matrix 439 rows 2546 cols
[2024-05-25 19:12:45] [INFO ] Computed 2112 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 102/201 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 469/670 variables, 201/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 33/703 variables, 32/332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 33/365 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2280/2983 variables, 2212/2577 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2983 variables, 2080/4657 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2983 variables, 0/4657 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/2985 variables, 1/4658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2985 variables, 0/4658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2985 variables, 0/4658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2985/2985 variables, and 4658 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2498 ms.
Refiners :[Generalized P Invariants (flows): 2112/2112 constraints, State Equation: 2546/2546 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 102/201 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 469/670 variables, 201/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/670 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/670 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 33/703 variables, 32/338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 33/371 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2280/2983 variables, 2212/2583 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2983 variables, 2080/4663 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2983 variables, 0/4663 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/2985 variables, 1/4664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2985 variables, 0/4664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/2985 variables, 0/4664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2985/2985 variables, and 4664 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 2112/2112 constraints, State Equation: 2546/2546 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 7575ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 99 out of 2546 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2546/2546 places, 439/439 transitions.
Graph (complete) has 39767 edges and 2546 vertex of which 2544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 2478 transition count 202
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 334 place count 2445 transition count 202
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 334 place count 2445 transition count 135
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 167 rules applied. Total rules applied 501 place count 2345 transition count 135
Applied a total of 501 rules in 203 ms. Remains 2345 /2546 variables (removed 201) and now considering 135/439 (removed 304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 2345/2546 places, 135/439 transitions.
RANDOM walk for 40000 steps (471 resets) in 1089 ms. (36 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 503 ms. (79 steps per ms) remains 1/1 properties
// Phase 1: matrix 135 rows 2345 cols
[2024-05-25 19:12:53] [INFO ] Computed 2210 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2244/2343 variables, 2209/2209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2343 variables, 0/2209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/2344 variables, 1/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2344 variables, 0/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/2479 variables, 2344/4554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2479 variables, 0/4554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/2480 variables, 1/4555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2480 variables, 0/4555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2480 variables, 0/4555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2480/2480 variables, and 4555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2603 ms.
Refiners :[Generalized P Invariants (flows): 2210/2210 constraints, State Equation: 2345/2345 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2244/2343 variables, 2209/2209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2343 variables, 0/2209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/2344 variables, 1/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2344 variables, 0/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/2479 variables, 2344/4554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2479 variables, 0/4554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 2480/2480 variables, and 4555 constraints, problems are : Problem set: 1 solved, 0 unsolved in 3880 ms.
Refiners :[Generalized P Invariants (flows): 2210/2210 constraints, State Equation: 2345/2345 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 6515ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 16 factoid took 434 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Support contains 33 out of 2546 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 : 2546/2546 places, 439/439 transitions.
Applied a total of 0 rules in 134 ms. Remains 2546 /2546 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 2546 cols
[2024-05-25 19:13:00] [INFO ] Computed 2112 invariants in 19 ms
[2024-05-25 19:13:05] [INFO ] Implicit Places using invariants in 4504 ms returned []
[2024-05-25 19:13:05] [INFO ] Invariant cache hit.
[2024-05-25 19:13:11] [INFO ] Implicit Places using invariants and state equation in 6733 ms returned []
Implicit Place search using SMT with State Equation took 11239 ms to find 0 implicit places.
[2024-05-25 19:13:11] [INFO ] Redundant transitions in 48 ms returned [419]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 370 sub problems to find dead transitions.
// Phase 1: matrix 438 rows 2546 cols
[2024-05-25 19:13:11] [INFO ] Computed 2112 invariants in 18 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 2112/2112 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2480/2984 variables, and 2112 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 2112/2112 constraints, State Equation: 0/2546 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 2112/2112 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2480 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 438/2918 variables, 2480/4592 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2918 variables, 304/4896 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2918/2984 variables, and 4896 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 2112/2112 constraints, State Equation: 2480/2546 constraints, PredecessorRefiner: 304/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 60905ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 60910ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2546/2546 places, 438/439 transitions.
Graph (complete) has 39767 edges and 2546 vertex of which 2545 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 130 ms. Remains 2545 /2546 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 2545 cols
[2024-05-25 19:14:12] [INFO ] Computed 2112 invariants in 33 ms
[2024-05-25 19:14:17] [INFO ] Implicit Places using invariants in 4546 ms returned []
[2024-05-25 19:14:17] [INFO ] Invariant cache hit.
[2024-05-25 19:14:23] [INFO ] Implicit Places using invariants and state equation in 6294 ms returned []
Implicit Place search using SMT with State Equation took 10853 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2545/2546 places, 437/439 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83330 ms. Remains : 2545/2546 places, 437/439 transitions.
Computed a total of 2545 stabilizing places and 437 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2545 transition count 437
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 : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 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 32 ms :[(NOT p1)]
RANDOM walk for 40010 steps (899 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (24 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1819203 steps, run timeout after 3001 ms. (steps per millisecond=606 ) properties seen :0 out of 1
Probabilistic random walk after 1819203 steps, saw 217668 distinct states, run finished after 3001 ms. (steps per millisecond=606 ) properties seen :0
[2024-05-25 19:14:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/66 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/165 variables, 33/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1355/1520 variables, 1123/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1520 variables, 1024/2213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 0/2213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1089/2609 variables, 1056/3269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2609 variables, 1089/4358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2609 variables, 0/4358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 231/2840 variables, 132/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2840 variables, 0/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 137/2977 variables, 132/4622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2977 variables, 32/4654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2977 variables, 0/4654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/2982 variables, 3/4657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2982 variables, 0/4657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2982 variables, 0/4657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2982/2982 variables, and 4657 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1331 ms.
Refiners :[Generalized P Invariants (flows): 2112/2112 constraints, State Equation: 2545/2545 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/66 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 99/165 variables, 33/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1355/1520 variables, 1123/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 1024/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1520 variables, 0/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1089/2609 variables, 1056/3270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2609 variables, 1089/4359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2609 variables, 0/4359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 231/2840 variables, 132/4491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2840 variables, 0/4491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 137/2977 variables, 132/4623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2977 variables, 32/4655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2977 variables, 0/4655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/2982 variables, 3/4658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2982 variables, 0/4658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2982 variables, 0/4658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2982/2982 variables, and 4658 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1449 ms.
Refiners :[Generalized P Invariants (flows): 2112/2112 constraints, State Equation: 2545/2545 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2801ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 191 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 28 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 102 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 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2442 reset in 511 ms.
Product exploration explored 100000 steps with 2446 reset in 510 ms.
Support contains 33 out of 2545 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2545/2545 places, 437/437 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2545 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2544 transition count 436
Applied a total of 2 rules in 157 ms. Remains 2544 /2545 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 2544 cols
[2024-05-25 19:14:31] [INFO ] Computed 2112 invariants in 19 ms
[2024-05-25 19:14:36] [INFO ] Implicit Places using invariants in 4913 ms returned []
[2024-05-25 19:14:36] [INFO ] Invariant cache hit.
[2024-05-25 19:14:43] [INFO ] Implicit Places using invariants and state equation in 6457 ms returned []
Implicit Place search using SMT with State Equation took 11373 ms to find 0 implicit places.
[2024-05-25 19:14:43] [INFO ] Redundant transitions in 32 ms returned []
Running 368 sub problems to find dead transitions.
[2024-05-25 19:14:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2478 variables, 2112/2112 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2478/2980 variables, and 2112 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 2112/2112 constraints, State Equation: 0/2544 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2478 variables, 2112/2112 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2478 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 436/2914 variables, 2478/4590 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2914 variables, 302/4892 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/2980 variables, and 4892 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 2112/2112 constraints, State Equation: 2478/2544 constraints, PredecessorRefiner: 302/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 60726ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60730ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2544/2545 places, 436/437 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72303 ms. Remains : 2544/2545 places, 436/437 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-01 finished in 197971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 100 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3738 transition count 506
Applied a total of 36 rules in 278 ms. Remains 3738 /3774 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3738 cols
[2024-05-25 19:15:44] [INFO ] Computed 3234 invariants in 34 ms
[2024-05-25 19:15:54] [INFO ] Implicit Places using invariants in 9699 ms returned []
[2024-05-25 19:15:54] [INFO ] Invariant cache hit.
[2024-05-25 19:16:07] [INFO ] Implicit Places using invariants and state equation in 13428 ms returned [2314, 2315]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 23134 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3736/3774 places, 506/506 transitions.
Applied a total of 0 rules in 264 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23677 ms. Remains : 3736/3774 places, 506/506 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-02
Product exploration explored 100000 steps with 2670 reset in 372 ms.
Product exploration explored 100000 steps with 2676 reset in 413 ms.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 205 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (1073 resets) in 322 ms. (123 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (47 resets) in 262 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (50 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
// Phase 1: matrix 506 rows 3736 cols
[2024-05-25 19:16:09] [INFO ] Computed 3232 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1122/1222 variables, 1088/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1222 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 170/1392 variables, 1222/2310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1392 variables, 0/2310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 571/1963 variables, 269/2579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1963 variables, 64/2643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1963 variables, 0/2643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2279/4242 variables, 2245/4888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4242 variables, 2080/6968 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4242 variables, 0/6968 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/4242 variables, 0/6968 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4242/4242 variables, and 6968 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1869 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3736/3736 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1122/1222 variables, 1088/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1222 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 170/1392 variables, 1222/2310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1392 variables, 0/2310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 5 (OVERLAPS) 571/1963 variables, 269/2579 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1963 variables, 64/2643 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1963 variables, 1/2644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1963 variables, 0/2644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2279/4242 variables, 2245/4889 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4242 variables, 2080/6969 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4242 variables, 0/6969 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4242 variables, 0/6969 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4242/4242 variables, and 6969 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2018 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3736/3736 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3948ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 71 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-02 finished in 29723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(G(p1)))))))'
Support contains 1123 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3738 transition count 506
Applied a total of 36 rules in 118 ms. Remains 3738 /3774 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3738 cols
[2024-05-25 19:16:13] [INFO ] Computed 3234 invariants in 29 ms
[2024-05-25 19:16:20] [INFO ] Implicit Places using invariants in 6567 ms returned []
[2024-05-25 19:16:20] [INFO ] Invariant cache hit.
[2024-05-25 19:16:28] [INFO ] Implicit Places using invariants and state equation in 7864 ms returned [2314, 2315]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14441 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3736/3774 places, 506/506 transitions.
Applied a total of 0 rules in 114 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14674 ms. Remains : 3736/3774 places, 506/506 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-03
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-03 finished in 14898 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))'
Support contains 34 out of 3774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 42221 edges and 3774 vertex of which 3640 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.8 ms
Discarding 134 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3638 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3638 transition count 503
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 7 place count 3636 transition count 501
Applied a total of 7 rules in 743 ms. Remains 3636 /3774 variables (removed 138) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3636 cols
[2024-05-25 19:16:29] [INFO ] Computed 3137 invariants in 18 ms
[2024-05-25 19:16:36] [INFO ] Implicit Places using invariants in 7048 ms returned []
[2024-05-25 19:16:36] [INFO ] Invariant cache hit.
[2024-05-25 19:16:49] [INFO ] Implicit Places using invariants and state equation in 12939 ms returned [2212, 2213, 3245, 3246, 3247, 3248, 3249, 3250, 3251, 3252, 3609, 3612, 3613, 3614, 3615, 3616, 3617, 3618, 3619, 3620, 3621, 3622, 3623, 3624, 3625, 3626, 3627, 3628, 3629, 3630, 3631, 3632, 3633, 3634, 3635]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 19995 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3601/3774 places, 501/506 transitions.
Applied a total of 0 rules in 256 ms. Remains 3601 /3601 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20994 ms. Remains : 3601/3774 places, 501/506 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-05
Product exploration explored 100000 steps with 2461 reset in 487 ms.
Product exploration explored 100000 steps with 2459 reset in 485 ms.
Computed a total of 3601 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3601 transition count 501
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 93 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 64 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (984 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (36 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1709085 steps, run timeout after 3001 ms. (steps per millisecond=569 ) properties seen :0 out of 1
Probabilistic random walk after 1709085 steps, saw 205301 distinct states, run finished after 3001 ms. (steps per millisecond=569 ) properties seen :0
// Phase 1: matrix 501 rows 3601 cols
[2024-05-25 19:16:54] [INFO ] Computed 3104 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/134 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 435/569 variables, 200/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 32/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/602 variables, 32/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 33/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 299/901 variables, 133/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/901 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3201/4102 variables, 3201/3665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4102 variables, 3040/6705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4102 variables, 0/6705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4102 variables, 0/6705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4102/4102 variables, and 6705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1284 ms.
Refiners :[Generalized P Invariants (flows): 3104/3104 constraints, State Equation: 3601/3601 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/134 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 435/569 variables, 200/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 32/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/602 variables, 32/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 33/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 299/901 variables, 133/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/901 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3201/4102 variables, 3201/3666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4102 variables, 3040/6706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4102 variables, 0/6706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4102 variables, 0/6706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4102/4102 variables, and 6706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1678 ms.
Refiners :[Generalized P Invariants (flows): 3104/3104 constraints, State Equation: 3601/3601 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3017ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 102 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 126 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-32-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-05 finished in 29021 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' '!((p0 U G(!p0)))'
Support contains 66 out of 3774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 42221 edges and 3774 vertex of which 2585 are kept as prefixes of interest. Removing 1189 places using SCC suffix rule.14 ms
Discarding 1189 places :
Also discarding 31 output transitions
Drop transitions (Output transitions of discarded places.) removed 31 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2584 transition count 444
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 65 place count 2550 transition count 376
Iterating global reduction 1 with 34 rules applied. Total rules applied 99 place count 2550 transition count 376
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 101 place count 2549 transition count 375
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 102 place count 2549 transition count 375
Applied a total of 102 rules in 519 ms. Remains 2549 /3774 variables (removed 1225) and now considering 375/506 (removed 131) transitions.
// Phase 1: matrix 375 rows 2549 cols
[2024-05-25 19:16:58] [INFO ] Computed 2177 invariants in 21 ms
[2024-05-25 19:17:02] [INFO ] Implicit Places using invariants in 4307 ms returned []
[2024-05-25 19:17:02] [INFO ] Invariant cache hit.
[2024-05-25 19:17:10] [INFO ] Implicit Places using invariants and state equation in 7875 ms returned [1126, 1127, 2159, 2160, 2161, 2162, 2163, 2164, 2165, 2166, 2522, 2525, 2526, 2527, 2528, 2529, 2530, 2531, 2532, 2533, 2534, 2535, 2536, 2537, 2538, 2539, 2540, 2541, 2542, 2543, 2544, 2545, 2546, 2547, 2548]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 12186 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2514/3774 places, 375/506 transitions.
Applied a total of 0 rules in 137 ms. Remains 2514 /2514 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12842 ms. Remains : 2514/3774 places, 375/506 transitions.
Stuttering acceptance computed with spot in 83 ms :[p0, true, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-06
Product exploration explored 100000 steps with 2443 reset in 561 ms.
Product exploration explored 100000 steps with 2443 reset in 588 ms.
Computed a total of 2514 stabilizing places and 375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2514 transition count 375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, p0]
RANDOM walk for 40001 steps (898 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (23 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1865092 steps, run timeout after 3001 ms. (steps per millisecond=621 ) properties seen :0 out of 1
Probabilistic random walk after 1865092 steps, saw 223144 distinct states, run finished after 3001 ms. (steps per millisecond=621 ) properties seen :0
// Phase 1: matrix 375 rows 2514 cols
[2024-05-25 19:17:15] [INFO ] Computed 2144 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 35/101 variables, 66/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 202/303 variables, 68/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1426/1729 variables, 1223/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1729 variables, 32/1421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1729 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/1780 variables, 1056/2477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1780 variables, 51/2528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1780 variables, 0/2528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1038/2818 variables, 1024/3552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2818 variables, 1038/4590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2818 variables, 0/4590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 71/2889 variables, 68/4658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2889 variables, 0/4658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2889 variables, 0/4658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2889/2889 variables, and 4658 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1266 ms.
Refiners :[Generalized P Invariants (flows): 2144/2144 constraints, State Equation: 2514/2514 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 35/101 variables, 66/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 202/303 variables, 68/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1426/1729 variables, 1223/1390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1729 variables, 32/1422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1729 variables, 0/1422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/1780 variables, 1056/2478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1780 variables, 51/2529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1780 variables, 0/2529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1038/2818 variables, 1024/3553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2818 variables, 1038/4591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2818 variables, 0/4591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 71/2889 variables, 68/4659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2889 variables, 0/4659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2889 variables, 0/4659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2889/2889 variables, and 4659 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1454 ms.
Refiners :[Generalized P Invariants (flows): 2144/2144 constraints, State Equation: 2514/2514 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2761ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 108 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-32-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-06 finished in 20651 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(p1)))))'
Support contains 68 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3738 transition count 506
Applied a total of 36 rules in 265 ms. Remains 3738 /3774 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3738 cols
[2024-05-25 19:17:18] [INFO ] Computed 3234 invariants in 54 ms
[2024-05-25 19:17:28] [INFO ] Implicit Places using invariants in 9745 ms returned []
[2024-05-25 19:17:28] [INFO ] Invariant cache hit.
[2024-05-25 19:17:41] [INFO ] Implicit Places using invariants and state equation in 13584 ms returned [2314, 2315]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 23344 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3736/3774 places, 506/506 transitions.
Applied a total of 0 rules in 285 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23896 ms. Remains : 3736/3774 places, 506/506 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-07
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-07 finished in 24046 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 2 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 3706 transition count 506
Applied a total of 68 rules in 263 ms. Remains 3706 /3774 variables (removed 68) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3706 cols
[2024-05-25 19:17:42] [INFO ] Computed 3201 invariants in 63 ms
[2024-05-25 19:17:49] [INFO ] Implicit Places using invariants in 7346 ms returned []
[2024-05-25 19:17:49] [INFO ] Invariant cache hit.
[2024-05-25 19:18:06] [INFO ] Implicit Places using invariants and state equation in 16152 ms returned [2282, 2283]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 23506 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3774 places, 506/506 transitions.
Applied a total of 0 rules in 267 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24037 ms. Remains : 3704/3774 places, 506/506 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 796 ms.
Product exploration explored 100000 steps with 50000 reset in 783 ms.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
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 37 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-32-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-08 finished in 26383 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 3774 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 42221 edges and 3774 vertex of which 3671 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.15 ms
Discarding 103 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 3668 transition count 501
Applied a total of 5 rules in 452 ms. Remains 3668 /3774 variables (removed 106) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3668 cols
[2024-05-25 19:18:09] [INFO ] Computed 3169 invariants in 47 ms
[2024-05-25 19:18:16] [INFO ] Implicit Places using invariants in 7032 ms returned []
[2024-05-25 19:18:16] [INFO ] Invariant cache hit.
[2024-05-25 19:18:28] [INFO ] Implicit Places using invariants and state equation in 11910 ms returned [2278, 2279, 3311, 3312, 3313, 3314, 3315, 3316, 3317, 3318, 3641, 3644, 3645, 3646, 3647, 3648, 3649, 3650, 3651, 3652, 3653, 3654, 3655, 3656, 3657, 3658, 3659, 3660, 3661, 3662, 3663, 3664, 3665, 3666, 3667]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 18948 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3633/3774 places, 501/506 transitions.
Applied a total of 0 rules in 224 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19630 ms. Remains : 3633/3774 places, 501/506 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-12
Product exploration explored 100000 steps with 2931 reset in 429 ms.
Product exploration explored 100000 steps with 2942 reset in 461 ms.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 136 steps (0 resets) in 8 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 121 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 501 rows 3633 cols
[2024-05-25 19:18:31] [INFO ] Computed 3136 invariants in 552 ms
[2024-05-25 19:18:44] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 11521 ms returned sat
[2024-05-25 19:18:46] [INFO ] [Real]Absence check using state equation in 1980 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 3633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3633/3633 places, 501/501 transitions.
Applied a total of 0 rules in 242 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-25 19:18:46] [INFO ] Invariant cache hit.
[2024-05-25 19:18:53] [INFO ] Implicit Places using invariants in 6983 ms returned []
[2024-05-25 19:18:53] [INFO ] Invariant cache hit.
[2024-05-25 19:19:04] [INFO ] Implicit Places using invariants and state equation in 10730 ms returned []
Implicit Place search using SMT with State Equation took 17716 ms to find 0 implicit places.
[2024-05-25 19:19:04] [INFO ] Redundant transitions in 31 ms returned []
Running 434 sub problems to find dead transitions.
[2024-05-25 19:19:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3600 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3600/4134 variables, and 3136 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3633 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3600 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3600 variables, 0/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 501/4101 variables, 3600/6736 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4101 variables, 434/7170 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4101/4134 variables, and 7170 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3600/3633 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints]
After SMT, in 60965ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60971ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78971 ms. Remains : 3633/3633 places, 501/501 transitions.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 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 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 128 steps (0 resets) in 6 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 115 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
[2024-05-25 19:20:06] [INFO ] Invariant cache hit.
[2024-05-25 19:20:19] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 11688 ms returned sat
[2024-05-25 19:20:21] [INFO ] [Real]Absence check using state equation in 1901 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2945 reset in 453 ms.
Product exploration explored 100000 steps with 2949 reset in 439 ms.
Support contains 1 out of 3633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3633/3633 places, 501/501 transitions.
Applied a total of 0 rules in 215 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-25 19:20:22] [INFO ] Invariant cache hit.
[2024-05-25 19:20:28] [INFO ] Implicit Places using invariants in 6550 ms returned []
[2024-05-25 19:20:28] [INFO ] Invariant cache hit.
[2024-05-25 19:20:39] [INFO ] Implicit Places using invariants and state equation in 10915 ms returned []
Implicit Place search using SMT with State Equation took 17477 ms to find 0 implicit places.
[2024-05-25 19:20:39] [INFO ] Redundant transitions in 29 ms returned []
Running 434 sub problems to find dead transitions.
[2024-05-25 19:20:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3600 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3600/4134 variables, and 3136 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3633 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3600 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3600 variables, 0/3136 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 501/4101 variables, 3600/6736 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4101 variables, 434/7170 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4101/4134 variables, and 7170 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3600/3633 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints]
After SMT, in 60876ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60881ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78618 ms. Remains : 3633/3633 places, 501/501 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-12 finished in 212068 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(p0))||F(p1)))'
Support contains 3 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 3707 transition count 506
Applied a total of 67 rules in 221 ms. Remains 3707 /3774 variables (removed 67) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3707 cols
[2024-05-25 19:21:41] [INFO ] Computed 3202 invariants in 88 ms
[2024-05-25 19:21:48] [INFO ] Implicit Places using invariants in 7019 ms returned []
[2024-05-25 19:21:48] [INFO ] Invariant cache hit.
[2024-05-25 19:22:01] [INFO ] Implicit Places using invariants and state equation in 13054 ms returned [2282, 2283]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 20082 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3705/3774 places, 506/506 transitions.
Applied a total of 0 rules in 211 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20516 ms. Remains : 3705/3774 places, 506/506 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-13
Product exploration explored 100000 steps with 5234 reset in 382 ms.
Product exploration explored 100000 steps with 5138 reset in 414 ms.
Computed a total of 3705 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3705 transition count 506
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 p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 325 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 109 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 4 factoid took 312 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 p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 506 rows 3705 cols
[2024-05-25 19:22:03] [INFO ] Computed 3200 invariants in 35 ms
[2024-05-25 19:22:13] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 8594 ms returned sat
[2024-05-25 19:22:18] [INFO ] [Real]Absence check using state equation in 4993 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 3705 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 : 3705/3705 places, 506/506 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 4 place count 3702 transition count 503
Applied a total of 4 rules in 460 ms. Remains 3702 /3705 variables (removed 3) and now considering 503/506 (removed 3) transitions.
// Phase 1: matrix 503 rows 3702 cols
[2024-05-25 19:22:19] [INFO ] Computed 3200 invariants in 44 ms
[2024-05-25 19:22:25] [INFO ] Implicit Places using invariants in 6480 ms returned []
[2024-05-25 19:22:25] [INFO ] Invariant cache hit.
[2024-05-25 19:22:37] [INFO ] Implicit Places using invariants and state equation in 11741 ms returned [3311, 3312, 3313, 3314, 3315, 3316, 3317, 3318, 3675, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699, 3700, 3701]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 18227 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3669/3705 places, 503/506 transitions.
Applied a total of 0 rules in 228 ms. Remains 3669 /3669 variables (removed 0) and now considering 503/503 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18915 ms. Remains : 3669/3705 places, 503/506 transitions.
Computed a total of 3669 stabilizing places and 503 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3669 transition count 503
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-13 finished in 57467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 6 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 3706 transition count 506
Applied a total of 68 rules in 219 ms. Remains 3706 /3774 variables (removed 68) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3706 cols
[2024-05-25 19:22:38] [INFO ] Computed 3201 invariants in 33 ms
[2024-05-25 19:22:45] [INFO ] Implicit Places using invariants in 6880 ms returned []
[2024-05-25 19:22:45] [INFO ] Invariant cache hit.
[2024-05-25 19:22:58] [INFO ] Implicit Places using invariants and state equation in 13591 ms returned [2282, 2283]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 20474 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3774 places, 506/506 transitions.
Applied a total of 0 rules in 210 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20904 ms. Remains : 3704/3774 places, 506/506 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-15
Product exploration explored 100000 steps with 2676 reset in 303 ms.
Product exploration explored 100000 steps with 2672 reset in 328 ms.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
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)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 372 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (1070 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (44 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1408524 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :0 out of 1
Probabilistic random walk after 1408524 steps, saw 169474 distinct states, run finished after 3003 ms. (steps per millisecond=469 ) properties seen :0
// Phase 1: matrix 506 rows 3704 cols
[2024-05-25 19:23:04] [INFO ] Computed 3200 invariants in 105 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1473/1481 variables, 1380/1381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 699/2180 variables, 699/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2180 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/2282 variables, 2180/4260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2282 variables, 0/4260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 491/2773 variables, 164/4424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2773 variables, 0/4424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/2806 variables, 32/4456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2806 variables, 33/4489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2806 variables, 0/4489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1023/3829 variables, 992/5481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3829 variables, 1023/6504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3829 variables, 0/6504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 233/4062 variables, 165/6669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4062 variables, 32/6701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4062 variables, 0/6701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 140/4202 variables, 134/6835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4202 variables, 64/6899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4202 variables, 0/6899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 8/4210 variables, 5/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4210 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/4210 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4210/4210 variables, and 6904 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1955 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3704/3704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1473/1481 variables, 1380/1381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 699/2180 variables, 699/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2180 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/2282 variables, 2180/4260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2282 variables, 0/4260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 491/2773 variables, 164/4424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2773 variables, 1/4425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2773 variables, 0/4425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 33/2806 variables, 32/4457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2806 variables, 33/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2806 variables, 0/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1023/3829 variables, 992/5482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3829 variables, 1023/6505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3829 variables, 0/6505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 233/4062 variables, 165/6670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4062 variables, 32/6702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4062 variables, 0/6702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 140/4202 variables, 134/6836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4202 variables, 64/6900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4202 variables, 0/6900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 8/4210 variables, 5/6905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4210 variables, 0/6905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/4210 variables, 0/6905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4210/4210 variables, and 6905 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3763 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3704/3704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5847ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 116 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 462 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 3704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3704/3704 places, 506/506 transitions.
Applied a total of 0 rules in 206 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 19:23:11] [INFO ] Invariant cache hit.
[2024-05-25 19:23:18] [INFO ] Implicit Places using invariants in 7858 ms returned []
[2024-05-25 19:23:18] [INFO ] Invariant cache hit.
[2024-05-25 19:23:32] [INFO ] Implicit Places using invariants and state equation in 13221 ms returned []
Implicit Place search using SMT with State Equation took 21082 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-05-25 19:23:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4210 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3704 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3702 variables, 0/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4208/4210 variables, and 6902 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3702/3704 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 60845ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60849ms
Finished structural reductions in LTL mode , in 1 iterations and 82140 ms. Remains : 3704/3704 places, 506/506 transitions.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
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 : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (1071 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (46 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1377445 steps, run timeout after 3001 ms. (steps per millisecond=458 ) properties seen :0 out of 1
Probabilistic random walk after 1377445 steps, saw 165926 distinct states, run finished after 3001 ms. (steps per millisecond=458 ) properties seen :0
[2024-05-25 19:24:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1473/1481 variables, 1380/1381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 699/2180 variables, 699/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2180 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/2282 variables, 2180/4260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2282 variables, 0/4260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 491/2773 variables, 164/4424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2773 variables, 0/4424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/2806 variables, 32/4456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2806 variables, 33/4489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2806 variables, 0/4489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1023/3829 variables, 992/5481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3829 variables, 1023/6504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3829 variables, 0/6504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 233/4062 variables, 165/6669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4062 variables, 32/6701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4062 variables, 0/6701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 140/4202 variables, 134/6835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4202 variables, 64/6899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4202 variables, 0/6899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 8/4210 variables, 5/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4210 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/4210 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4210/4210 variables, and 6904 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1990 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3704/3704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1473/1481 variables, 1380/1381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 699/2180 variables, 699/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2180 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/2282 variables, 2180/4260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2282 variables, 0/4260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 491/2773 variables, 164/4424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2773 variables, 1/4425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2773 variables, 0/4425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 33/2806 variables, 32/4457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2806 variables, 33/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2806 variables, 0/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1023/3829 variables, 992/5482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3829 variables, 1023/6505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3829 variables, 0/6505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 233/4062 variables, 165/6670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4062 variables, 32/6702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4062 variables, 0/6702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 140/4202 variables, 134/6836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4202 variables, 64/6900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4202 variables, 0/6900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 8/4210 variables, 5/6905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4210 variables, 0/6905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/4210 variables, 0/6905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4210/4210 variables, and 6905 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3657 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3704/3704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5660ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 130 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2675 reset in 331 ms.
Product exploration explored 100000 steps with 2673 reset in 366 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 3704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3704/3704 places, 506/506 transitions.
Graph (complete) has 40930 edges and 3704 vertex of which 3636 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.14 ms
Discarding 68 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3636 transition count 506
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 697 ms. Remains 3636 /3704 variables (removed 68) and now considering 506/506 (removed 0) transitions.
[2024-05-25 19:24:44] [INFO ] Redundant transitions in 29 ms returned []
Running 472 sub problems to find dead transitions.
// Phase 1: matrix 506 rows 3636 cols
[2024-05-25 19:24:44] [INFO ] Computed 3136 invariants in 24 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3635 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3635/4142 variables, and 3136 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3636 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3635 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3635 variables, 0/3136 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4141/4142 variables, and 6771 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3635/3636 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 61025ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 61031ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3636/3704 places, 506/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61768 ms. Remains : 3636/3704 places, 506/506 transitions.
Support contains 3 out of 3704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3704/3704 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3703 transition count 506
Applied a total of 1 rules in 401 ms. Remains 3703 /3704 variables (removed 1) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2024-05-25 19:25:46] [INFO ] Computed 3200 invariants in 428 ms
[2024-05-25 19:25:53] [INFO ] Implicit Places using invariants in 7193 ms returned []
[2024-05-25 19:25:53] [INFO ] Invariant cache hit.
[2024-05-25 19:26:06] [INFO ] Implicit Places using invariants and state equation in 13089 ms returned []
Implicit Place search using SMT with State Equation took 20287 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-05-25 19:26:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3702/4209 variables, and 3200 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 0/3703 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3702 variables, 3200/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3702 variables, 0/3200 constraints. Problems are: Problem set: 0 solved, 472 unsolved
SMT process timed out in 60908ms, After SMT, problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60915ms
Starting structural reductions in LTL mode, iteration 1 : 3703/3704 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81605 ms. Remains : 3703/3704 places, 506/506 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-15 finished in 269276 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)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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)||X(G(p1)))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-32-LTLCardinality-15
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 3774 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3774/3774 places, 506/506 transitions.
Graph (complete) has 42221 edges and 3774 vertex of which 3673 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.16 ms
Discarding 101 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3672 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 3671 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 3671 transition count 504
Applied a total of 5 rules in 771 ms. Remains 3671 /3774 variables (removed 103) and now considering 504/506 (removed 2) transitions.
// Phase 1: matrix 504 rows 3671 cols
[2024-05-25 19:27:08] [INFO ] Computed 3169 invariants in 20 ms
[2024-05-25 19:27:15] [INFO ] Implicit Places using invariants in 6505 ms returned []
[2024-05-25 19:27:15] [INFO ] Invariant cache hit.
[2024-05-25 19:27:27] [INFO ] Implicit Places using invariants and state equation in 12570 ms returned [2248, 2249, 3281, 3282, 3283, 3284, 3285, 3286, 3287, 3288, 3644, 3647, 3648, 3649, 3650, 3651, 3652, 3653, 3654, 3655, 3656, 3657, 3658, 3659, 3660, 3661, 3662, 3663, 3664, 3665, 3666, 3667, 3668, 3669, 3670]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 19089 ms to find 35 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3636/3774 places, 504/506 transitions.
Applied a total of 0 rules in 244 ms. Remains 3636 /3636 variables (removed 0) and now considering 504/504 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 20105 ms. Remains : 3636/3774 places, 504/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLCardinality-15
Product exploration explored 100000 steps with 2465 reset in 387 ms.
Product exploration explored 100000 steps with 2468 reset in 390 ms.
Computed a total of 3636 stabilizing places and 504 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3636 transition count 504
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)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 6 factoid took 525 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (982 resets) in 362 ms. (110 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (24 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 219 ms. (181 steps per ms) remains 3/3 properties
// Phase 1: matrix 504 rows 3636 cols
[2024-05-25 19:27:30] [INFO ] Computed 3136 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1454/1465 variables, 1361/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1465 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 718/2183 variables, 718/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2183 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 111/2294 variables, 2183/4263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2294 variables, 0/4263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 532/2826 variables, 203/4466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2826 variables, 0/4466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 854/3680 variables, 853/5319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3680 variables, 852/6171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3680 variables, 0/6171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 202/3882 variables, 171/6342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3882 variables, 140/6482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3882 variables, 0/6482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 258/4140 variables, 258/6740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4140 variables, 32/6772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4140 variables, 0/6772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/4140 variables, 0/6772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4140/4140 variables, and 6772 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2885 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3636/3636 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1454/1465 variables, 1361/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1465 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 718/2183 variables, 718/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2183 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 111/2294 variables, 2183/4263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2294 variables, 0/4263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 532/2826 variables, 203/4466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2826 variables, 3/4469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2826 variables, 0/4469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 854/3680 variables, 853/5322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3680 variables, 852/6174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3680 variables, 0/6174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 202/3882 variables, 171/6345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3882 variables, 140/6485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3882 variables, 0/6485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 258/4140 variables, 258/6743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4140 variables, 32/6775 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4140 variables, 0/6775 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/4140 variables, 0/6775 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4140/4140 variables, and 6775 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4735 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3636/3636 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 7659ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 74 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=24 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 770 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 3636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3636/3636 places, 504/504 transitions.
Applied a total of 0 rules in 215 ms. Remains 3636 /3636 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-05-25 19:27:39] [INFO ] Invariant cache hit.
[2024-05-25 19:27:46] [INFO ] Implicit Places using invariants in 7175 ms returned []
[2024-05-25 19:27:46] [INFO ] Invariant cache hit.
[2024-05-25 19:28:00] [INFO ] Implicit Places using invariants and state equation in 13277 ms returned []
Implicit Place search using SMT with State Equation took 20456 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-05-25 19:28:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3602 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3602/4140 variables, and 3136 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3636 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3602 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3602 variables, 0/3136 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 504/4106 variables, 3602/6738 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4106 variables, 429/7167 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4106/4140 variables, and 7167 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3602/3636 constraints, PredecessorRefiner: 429/437 constraints, Known Traps: 0/0 constraints]
After SMT, in 60888ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 60893ms
Finished structural reductions in LTL mode , in 1 iterations and 81568 ms. Remains : 3636/3636 places, 504/504 transitions.
Computed a total of 3636 stabilizing places and 504 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3636 transition count 504
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)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 6 factoid took 548 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (985 resets) in 1088 ms. (36 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (24 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (24 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
[2024-05-25 19:29:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1454/1465 variables, 1361/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1465 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 718/2183 variables, 718/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2183 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 111/2294 variables, 2183/4263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2294 variables, 0/4263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 532/2826 variables, 203/4466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2826 variables, 0/4466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 854/3680 variables, 853/5319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3680 variables, 852/6171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3680 variables, 0/6171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 202/3882 variables, 171/6342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3882 variables, 140/6482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3882 variables, 0/6482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 258/4140 variables, 258/6740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4140 variables, 32/6772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4140 variables, 0/6772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/4140 variables, 0/6772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4140/4140 variables, and 6772 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2902 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3636/3636 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1454/1465 variables, 1361/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1465 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 718/2183 variables, 718/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2183 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 111/2294 variables, 2183/4263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2294 variables, 0/4263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 532/2826 variables, 203/4466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2826 variables, 3/4469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2826 variables, 0/4469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 854/3680 variables, 853/5322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3680 variables, 852/6174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3680 variables, 0/6174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 202/3882 variables, 171/6345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3882 variables, 140/6485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3882 variables, 0/6485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 258/4140 variables, 258/6743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4140 variables, 32/6775 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4140 variables, 0/6775 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/4140 variables, 0/6775 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4140/4140 variables, and 6775 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4866 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3636/3636 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 7780ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 148 steps, including 1 resets, run visited all 3 properties in 9 ms. (steps per millisecond=16 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 10 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 730 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2462 reset in 380 ms.
Product exploration explored 100000 steps with 2462 reset in 385 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 3636 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3636/3636 places, 504/504 transitions.
Applied a total of 0 rules in 227 ms. Remains 3636 /3636 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-05-25 19:29:13] [INFO ] Redundant transitions in 7 ms returned []
Running 437 sub problems to find dead transitions.
[2024-05-25 19:29:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3602 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3602/4140 variables, and 3136 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3636 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3602 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3602 variables, 0/3136 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 504/4106 variables, 3602/6738 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4106 variables, 429/7167 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4106/4140 variables, and 7167 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3602/3636 constraints, PredecessorRefiner: 429/437 constraints, Known Traps: 0/0 constraints]
After SMT, in 60912ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 60916ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61167 ms. Remains : 3636/3636 places, 504/504 transitions.
Support contains 6 out of 3636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3636/3636 places, 504/504 transitions.
Applied a total of 0 rules in 200 ms. Remains 3636 /3636 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-05-25 19:30:14] [INFO ] Invariant cache hit.
[2024-05-25 19:30:21] [INFO ] Implicit Places using invariants in 6833 ms returned []
[2024-05-25 19:30:21] [INFO ] Invariant cache hit.
[2024-05-25 19:30:34] [INFO ] Implicit Places using invariants and state equation in 12945 ms returned []
Implicit Place search using SMT with State Equation took 19794 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-05-25 19:30:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3602 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3602/4140 variables, and 3136 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 0/3636 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3602 variables, 3136/3136 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3602 variables, 0/3136 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 504/4106 variables, 3602/6738 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4106 variables, 429/7167 constraints. Problems are: Problem set: 0 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4106/4140 variables, and 7167 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3602/3636 constraints, PredecessorRefiner: 429/437 constraints, Known Traps: 0/0 constraints]
After SMT, in 60837ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 60845ms
Finished structural reductions in LTL mode , in 1 iterations and 80842 ms. Remains : 3636/3636 places, 504/504 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLCardinality-15 finished in 267396 ms.
[2024-05-25 19:31:35] [INFO ] Flatten gal took : 106 ms
[2024-05-25 19:31:35] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-25 19:31:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3774 places, 506 transitions and 7944 arcs took 9 ms.
Total runtime 1360071 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running QuasiCertifProtocol-PT-32
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 3774
TRANSITIONS: 506
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.044s, Sys 0.004s]
SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1962
MODEL NAME: /home/mcc/execution/410/model
3774 places, 506 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716667221690
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is QuasiCertifProtocol-PT-32, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335900107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 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 ;