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-171662335700020.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-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335700020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.7K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 04:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 72K 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-COL-10-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716646447108

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:14:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 14:14:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:14:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 14:14:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 14:14:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 616 ms
[2024-05-25 14:14:09] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 14:14:09] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-25 14:14:09] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40010 steps (2226 resets) in 951 ms. (42 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40002 steps (703 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 14:14:09] [INFO ] Computed 5 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/43 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/55 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/56 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/43 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/55 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 36 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 33 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 7 ms.
[2024-05-25 14:14:10] [INFO ] Flatten gal took : 18 ms
[2024-05-25 14:14:10] [INFO ] Flatten gal took : 6 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2024-05-25 14:14:10] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 18 ms.
[2024-05-25 14:14:10] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 358 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 23 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-25 14:14:10] [INFO ] Computed 350 invariants in 45 ms
[2024-05-25 14:14:10] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-25 14:14:10] [INFO ] Invariant cache hit.
[2024-05-25 14:14:10] [INFO ] Implicit Places using invariants and state equation in 408 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 742 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/550 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 786 ms. Remains : 513/550 places, 176/176 transitions.
Support contains 358 out of 513 places after structural reductions.
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 45 ms
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 30 ms
[2024-05-25 14:14:11] [INFO ] Input system was already deterministic with 176 transitions.
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 40000 steps (2769 resets) in 1838 ms. (21 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40004 steps (326 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (307 resets) in 314 ms. (126 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (245 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (310 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (240 resets) in 687 ms. (58 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (318 resets) in 218 ms. (182 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (315 resets) in 172 ms. (231 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (237 resets) in 87 ms. (454 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (315 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (323 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (323 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (312 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (324 resets) in 72 ms. (547 steps per ms) remains 13/13 properties
// Phase 1: matrix 176 rows 513 cols
[2024-05-25 14:14:12] [INFO ] Computed 340 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 132/467 variables, 120/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 174/641 variables, 467/797 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 47/688 variables, 45/842 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 10/852 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1869 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 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/335 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 132/467 variables, 120/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 174/641 variables, 467/797 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 9/806 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 47/688 variables, 45/851 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/688 variables, 10/861 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 1/689 variables, 1/866 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/689 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/689 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 866 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 6981ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 3 different solutions.
Parikh walk visited 5 properties in 186 ms.
Support contains 312 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 513 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 513 transition count 173
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 4 place count 512 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 511 transition count 172
Applied a total of 5 rules in 40 ms. Remains 511 /513 variables (removed 2) and now considering 172/176 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 511/513 places, 172/176 transitions.
RANDOM walk for 40000 steps (2897 resets) in 427 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (229 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (227 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (227 resets) in 42 ms. (930 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (205 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (229 resets) in 32 ms. (1212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (229 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (228 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (226 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 1659 steps, run visited all 8 properties in 27 ms. (steps per millisecond=61 )
Probabilistic random walk after 1659 steps, saw 1581 distinct states, run finished after 30 ms. (steps per millisecond=55 ) properties seen :8
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-25 14:14:20] [INFO ] Invariant cache hit.
[2024-05-25 14:14:20] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-25 14:14:20] [INFO ] Invariant cache hit.
[2024-05-25 14:14:21] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-25 14:14:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11572 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 18659 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 30367ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 30371ms
Finished structural reductions in LTL mode , in 1 iterations and 31379 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-03
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-03 finished in 31648 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(F(!p0))&&F(p1))))'
Support contains 23 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-25 14:14:51] [INFO ] Invariant cache hit.
[2024-05-25 14:14:52] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-25 14:14:52] [INFO ] Invariant cache hit.
[2024-05-25 14:14:52] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-25 14:14:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11083 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 18349 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 29535ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 29537ms
Finished structural reductions in LTL mode , in 1 iterations and 30502 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 352 ms.
Product exploration explored 100000 steps with 33333 reset in 227 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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 p1), (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-04 finished in 31406 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(X(X(X(G(!p1))))))))'
Support contains 34 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-25 14:15:23] [INFO ] Invariant cache hit.
[2024-05-25 14:15:23] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-25 14:15:23] [INFO ] Invariant cache hit.
[2024-05-25 14:15:24] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-25 14:15:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11400 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 18532 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 30059ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 30062ms
Finished structural reductions in LTL mode , in 1 iterations and 30916 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 404 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), p1, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-05 finished in 31346 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))))'
Support contains 34 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.6 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 499 transition count 172
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 499 transition count 172
Applied a total of 4 rules in 121 ms. Remains 499 /513 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 499 cols
[2024-05-25 14:15:54] [INFO ] Computed 330 invariants in 23 ms
[2024-05-25 14:15:55] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-05-25 14:15:55] [INFO ] Invariant cache hit.
[2024-05-25 14:15:56] [INFO ] Implicit Places using invariants and state equation in 502 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1338 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/513 places, 172/176 transitions.
Applied a total of 0 rules in 29 ms. Remains 488 /488 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1488 ms. Remains : 488/513 places, 172/176 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-06
Product exploration explored 100000 steps with 6780 reset in 624 ms.
Product exploration explored 100000 steps with 6773 reset in 533 ms.
Computed a total of 488 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 172
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 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 14 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-06 finished in 2886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 145 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 511 transition count 174
Applied a total of 3 rules in 31 ms. Remains 511 /513 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 511 cols
[2024-05-25 14:15:57] [INFO ] Computed 340 invariants in 15 ms
[2024-05-25 14:15:57] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-25 14:15:57] [INFO ] Invariant cache hit.
[2024-05-25 14:15:58] [INFO ] Implicit Places using invariants and state equation in 389 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 704 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/513 places, 174/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 746 ms. Remains : 500/513 places, 174/176 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-07
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-07 finished in 901 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||G(F(!p1))||(X(F(!p1))&&p2)))))'
Support contains 12 out of 513 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 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 499 transition count 172
Applied a total of 3 rules in 27 ms. Remains 499 /513 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 499 cols
[2024-05-25 14:15:58] [INFO ] Computed 330 invariants in 17 ms
[2024-05-25 14:15:58] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-25 14:15:58] [INFO ] Invariant cache hit.
[2024-05-25 14:15:59] [INFO ] Implicit Places using invariants and state equation in 510 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 848 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/513 places, 172/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 488 /488 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 886 ms. Remains : 488/513 places, 172/176 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-11
Product exploration explored 100000 steps with 6776 reset in 145 ms.
Product exploration explored 100000 steps with 6776 reset in 164 ms.
Computed a total of 488 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 172
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) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 12 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-COL-10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-11 finished in 1395 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(F(p0)) U G((p1&&(F(p3)||p2))))))'
Support contains 156 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2024-05-25 14:15:59] [INFO ] Computed 340 invariants in 22 ms
[2024-05-25 14:16:00] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-25 14:16:00] [INFO ] Invariant cache hit.
[2024-05-25 14:16:00] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-25 14:16:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11468 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 18966 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 30542ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 30544ms
Finished structural reductions in LTL mode , in 1 iterations and 31265 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-13
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-13 finished in 31669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(!p0))) U (X(X(G(!p0)))&&p1))))'
Support contains 144 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-25 14:16:31] [INFO ] Invariant cache hit.
[2024-05-25 14:16:31] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-25 14:16:31] [INFO ] Invariant cache hit.
[2024-05-25 14:16:32] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-25 14:16:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11809 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19830 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 31768ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 31770ms
Finished structural reductions in LTL mode , in 1 iterations and 32635 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-14
Stuttering criterion allowed to conclude after 37642 steps with 2605 reset in 76 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-14 finished in 32884 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))) U (((p1 U X(p0)) U p2) U X(p1))))'
Support contains 24 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-25 14:17:04] [INFO ] Invariant cache hit.
[2024-05-25 14:17:04] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-25 14:17:04] [INFO ] Invariant cache hit.
[2024-05-25 14:17:05] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-25 14:17:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11304 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19936 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 31330ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 31332ms
Finished structural reductions in LTL mode , in 1 iterations and 32312 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 623 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) p2 (NOT p1)), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-15
Product exploration explored 100000 steps with 15999 reset in 199 ms.
Product exploration explored 100000 steps with 15951 reset in 206 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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 p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 1019 ms. Reduced automaton from 15 states, 31 edges and 3 AP (stutter sensitive) to 11 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 487 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
RANDOM walk for 40000 steps (2766 resets) in 166 ms. (239 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40003 steps (327 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (436 resets) in 754 ms. (52 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (319 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (193 resets) in 526 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (323 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (436 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (436 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (315 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
[2024-05-25 14:17:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/35 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 29/64 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf4 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 5 (OVERLAPS) 141/205 variables, 49/94 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 10/104 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/104 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 11/216 variables, 10/114 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 11/125 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/125 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 110/326 variables, 55/180 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 363/689 variables, 363/543 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/689 variables, 310/853 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 3 solved, 5 unsolved in 442 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/35 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 29/64 variables, 35/45 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 141/205 variables, 49/94 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 10/104 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 5/109 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/109 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 11/216 variables, 10/119 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 11/130 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/130 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 110/326 variables, 55/185 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 363/689 variables, 363/548 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/689 variables, 310/858 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/689 variables, 0/858 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/689 variables, 0/858 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 858 constraints, problems are : Problem set: 3 solved, 5 unsolved in 552 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1013ms problems are : Problem set: 3 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=8 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 2 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0))), (G (OR p1 p2 (NOT p0))), (G (OR p2 (NOT p0))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p2))), (F (NOT (OR p2 p0))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 17 factoid took 893 ms. Reduced automaton from 11 states, 23 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 356 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2))]
[2024-05-25 14:17:42] [INFO ] Invariant cache hit.
[2024-05-25 14:17:43] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 170 ms returned sat
[2024-05-25 14:17:43] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2024-05-25 14:17:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:17:44] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 185 ms returned sat
[2024-05-25 14:17:45] [INFO ] [Nat]Absence check using state equation in 958 ms returned sat
[2024-05-25 14:17:45] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2024-05-25 14:17:45] [INFO ] Added : 0 causal constraints over 0 iterations in 121 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 24 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-25 14:17:45] [INFO ] Invariant cache hit.
[2024-05-25 14:17:45] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-25 14:17:45] [INFO ] Invariant cache hit.
[2024-05-25 14:17:46] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-25 14:17:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11513 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 18634 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 30253ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 30255ms
Finished structural reductions in LTL mode , in 1 iterations and 31287 ms. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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) p2), (X p2), (X (X p2)), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 551 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (2768 resets) in 288 ms. (138 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (328 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (319 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
[2024-05-25 14:18:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/68 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/79 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 102/181 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/192 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 211/403 variables, 145/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 11/414 variables, 110/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 11/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/414 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 110/524 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/524 variables, 110/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/524 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 44/568 variables, 22/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/568 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 121/689 variables, 121/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/689 variables, 100/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 2 unsolved in 417 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/68 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/79 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 102/181 variables, 45/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 11/192 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 211/403 variables, 145/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/403 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 11/414 variables, 110/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/414 variables, 11/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/414 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 110/524 variables, 100/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/524 variables, 110/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/524 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 44/568 variables, 22/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/568 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 121/689 variables, 121/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/689 variables, 100/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/689 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/689 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 855 constraints, problems are : Problem set: 0 solved, 2 unsolved in 331 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 754ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 30 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=15 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (X p2)), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p2))), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 793 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 352 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2))]
[2024-05-25 14:18:19] [INFO ] Invariant cache hit.
[2024-05-25 14:18:20] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 171 ms returned sat
[2024-05-25 14:18:20] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2024-05-25 14:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:18:21] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 165 ms returned sat
[2024-05-25 14:18:22] [INFO ] [Nat]Absence check using state equation in 878 ms returned sat
[2024-05-25 14:18:22] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2024-05-25 14:18:22] [INFO ] Added : 0 causal constraints over 0 iterations in 94 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 374 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 15975 reset in 272 ms.
Product exploration explored 100000 steps with 15992 reset in 249 ms.
Applying partial POR strategy [false, true, false, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 378 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 24 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 36 ms. Remains 501 /513 variables (removed 12) and now considering 174/176 (removed 2) transitions.
[2024-05-25 14:18:23] [INFO ] Redundant transitions in 4 ms returned []
Running 162 sub problems to find dead transitions.
// Phase 1: matrix 174 rows 501 cols
[2024-05-25 14:18:23] [INFO ] Computed 330 invariants in 18 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 174/674 variables, 500/830 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/674 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 1/675 variables, 1/831 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/675 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/675 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 831 constraints, problems are : Problem set: 0 solved, 162 unsolved in 11091 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 174/674 variables, 500/830 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/674 variables, 162/992 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 1/675 variables, 1/993 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/675 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 993 constraints, problems are : Problem set: 0 solved, 162 unsolved in 17429 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
After SMT, in 28645ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 28648ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/513 places, 174/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28696 ms. Remains : 501/513 places, 174/176 transitions.
Support contains 24 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2024-05-25 14:18:52] [INFO ] Computed 340 invariants in 14 ms
[2024-05-25 14:18:52] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-25 14:18:52] [INFO ] Invariant cache hit.
[2024-05-25 14:18:53] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-25 14:18:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11230 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/689 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19185 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 30516ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 30518ms
Finished structural reductions in LTL mode , in 1 iterations and 31544 ms. Remains : 513/513 places, 176/176 transitions.
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-15 finished in 139624 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))) U (((p1 U X(p0)) U p2) U X(p1))))'
[2024-05-25 14:19:24] [INFO ] Flatten gal took : 23 ms
[2024-05-25 14:19:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-25 14:19:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 513 places, 176 transitions and 1171 arcs took 5 ms.
Total runtime 315981 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-COL-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 513
TRANSITIONS: 176
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 1426
MODEL NAME: /home/mcc/execution/412/model
513 places, 176 transitions.

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.
Building monolithic NSF...
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716647515203

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is QuasiCertifProtocol-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335700020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;