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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 13 03:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 03:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 11K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 03:53 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 61K 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-06-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716646342082

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:12:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 14:12:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:12:23] [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:12:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 14:12:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 587 ms
[2024-05-25 14:12:23] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 14:12:24] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 14:12:24] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-14 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 10 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 19 to 18
RANDOM walk for 40005 steps (3050 resets) in 864 ms. (46 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40001 steps (994 resets) in 376 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1048 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1055 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1375 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 14:12:24] [INFO ] Computed 5 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/50 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/56 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 4 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/50 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 6/56 variables, 6/35 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 3/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 38 constraints, problems are : Problem set: 1 solved, 3 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 486ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 33 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=16 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 7 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:12:25] [INFO ] Flatten gal took : 18 ms
[2024-05-25 14:12:25] [INFO ] Flatten gal took : 4 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2024-05-25 14:12:25] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 13 ms.
[2024-05-25 14:12:25] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 188 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 14 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 14:12:25] [INFO ] Computed 138 invariants in 10 ms
[2024-05-25 14:12:25] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-25 14:12:25] [INFO ] Invariant cache hit.
[2024-05-25 14:12:25] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-25 14:12:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/367 variables, 251/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/368 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 390 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4524 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/367 variables, 251/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 108/497 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 1/368 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 498 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6091 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 10713ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10716ms
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11064 ms. Remains : 252/270 places, 116/116 transitions.
Support contains 188 out of 252 places after structural reductions.
[2024-05-25 14:12:36] [INFO ] Flatten gal took : 19 ms
[2024-05-25 14:12:36] [INFO ] Flatten gal took : 17 ms
[2024-05-25 14:12:36] [INFO ] Input system was already deterministic with 116 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (3933 resets) in 603 ms. (66 steps per ms) remains 14/18 properties
BEST_FIRST walk for 40004 steps (704 resets) in 243 ms. (163 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (717 resets) in 117 ms. (339 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (435 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (703 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (710 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (709 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (431 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (694 resets) in 145 ms. (273 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (693 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (707 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (373 resets) in 387 ms. (103 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (711 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
[2024-05-25 14:12:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 14/166 variables, 12/96 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 108/274 variables, 166/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 94/368 variables, 86/348 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 42/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 390 constraints, problems are : Problem set: 0 solved, 10 unsolved in 644 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 14/166 variables, 12/96 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 108/274 variables, 166/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 94/368 variables, 86/355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 42/397 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/368 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 400 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1176 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 1841ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=43 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 279 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 252 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(p1)))))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 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 242 transition count 112
Applied a total of 3 rules in 50 ms. Remains 242 /252 variables (removed 10) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 242 cols
[2024-05-25 14:12:40] [INFO ] Computed 132 invariants in 12 ms
[2024-05-25 14:12:40] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-25 14:12:40] [INFO ] Invariant cache hit.
[2024-05-25 14:12:40] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 374 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/252 places, 112/116 transitions.
Applied a total of 0 rules in 10 ms. Remains 228 /228 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 434 ms. Remains : 228/252 places, 112/116 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-01
Product exploration explored 100000 steps with 10252 reset in 349 ms.
Product exploration explored 100000 steps with 10254 reset in 273 ms.
Computed a total of 228 stabilizing places and 112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 228 transition count 112
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 150 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-01 finished in 1621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&(F(p2) U p3))))'
Support contains 25 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 14:12:41] [INFO ] Computed 138 invariants in 4 ms
[2024-05-25 14:12:41] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-25 14:12:41] [INFO ] Invariant cache hit.
[2024-05-25 14:12:41] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 358 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 362 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-03
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-03 finished in 675 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(p1)||p0)))'
Support contains 64 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 17 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-25 14:12:42] [INFO ] Computed 132 invariants in 7 ms
[2024-05-25 14:12:42] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-25 14:12:42] [INFO ] Invariant cache hit.
[2024-05-25 14:12:42] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [176, 177, 178, 179, 180, 181, 182]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 317 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/252 places, 111/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 340 ms. Remains : 234/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-04
Product exploration explored 100000 steps with 10253 reset in 222 ms.
Product exploration explored 100000 steps with 10249 reset in 265 ms.
Computed a total of 234 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 41 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-04 finished in 1007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 25 are kept as prefixes of interest. Removing 227 places using SCC suffix rule.1 ms
Discarding 227 places :
Also discarding 55 output transitions
Drop transitions (Output transitions of discarded places.) removed 55 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 24 transition count 18
Applied a total of 43 rules in 9 ms. Remains 24 /252 variables (removed 228) and now considering 18/116 (removed 98) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-25 14:12:43] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 14:12:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-25 14:12:43] [INFO ] Invariant cache hit.
[2024-05-25 14:12:43] [INFO ] Implicit Places using invariants and state equation in 32 ms returned [8, 9, 10, 11, 12, 13, 14]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 64 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/252 places, 18/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 17/252 places, 18/116 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-05
Product exploration explored 100000 steps with 10323 reset in 158 ms.
Product exploration explored 100000 steps with 10303 reset in 132 ms.
Computed a total of 17 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-05 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 14:12:43] [INFO ] Computed 138 invariants in 6 ms
[2024-05-25 14:12:43] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-25 14:12:43] [INFO ] Invariant cache hit.
[2024-05-25 14:12:44] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 377 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 388 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (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 7 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-06 finished in 1045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 17 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-25 14:12:44] [INFO ] Computed 132 invariants in 9 ms
[2024-05-25 14:12:44] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-25 14:12:44] [INFO ] Invariant cache hit.
[2024-05-25 14:12:45] [INFO ] Implicit Places using invariants and state equation in 279 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 443 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/252 places, 111/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 467 ms. Remains : 227/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-08
Product exploration explored 100000 steps with 10251 reset in 158 ms.
Product exploration explored 100000 steps with 10256 reset in 168 ms.
Computed a total of 227 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 227 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-08 finished in 917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(!p1 U (p2||G(!p1))))))'
Support contains 65 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 14:12:45] [INFO ] Computed 138 invariants in 2 ms
[2024-05-25 14:12:45] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-25 14:12:45] [INFO ] Invariant cache hit.
[2024-05-25 14:12:46] [INFO ] Implicit Places using invariants and state equation in 180 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 341 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 345 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-09 finished in 945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U X(!p1)))||G(p2)))'
Support contains 30 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-25 14:12:46] [INFO ] Invariant cache hit.
[2024-05-25 14:12:46] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-25 14:12:46] [INFO ] Invariant cache hit.
[2024-05-25 14:12:47] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 374 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 381 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1), p1, true, p1, p1, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-10
Product exploration explored 100000 steps with 9834 reset in 197 ms.
Product exploration explored 100000 steps with 9834 reset in 203 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (F (G p2)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 128 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[true, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (3933 resets) in 395 ms. (101 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40002 steps (708 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (696 resets) in 355 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (686 resets) in 457 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (436 resets) in 484 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (714 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (432 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
// Phase 1: matrix 116 rows 245 cols
[2024-05-25 14:12:49] [INFO ] Computed 132 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 80/110 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
At refinement iteration 4 (OVERLAPS) 231/341 variables, 198/234 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 120/354 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/354 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 20/361 variables, 17/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 6/377 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/377 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/361 variables, 0/377 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 377 constraints, problems are : Problem set: 1 solved, 5 unsolved in 585 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 80/110 variables, 30/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 231/341 variables, 198/234 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 120/354 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 5/359 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/359 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 20/361 variables, 17/376 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 6/382 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/361 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 382 constraints, problems are : Problem set: 1 solved, 5 unsolved in 512 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1136ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 5 properties in 7 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (F (G p2)), (F (G (NOT p0))), (F (G p1)), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p2 p1))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F p0), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 22 factoid took 566 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[true, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 358 ms :[true, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 30 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-25 14:12:51] [INFO ] Invariant cache hit.
[2024-05-25 14:12:51] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-25 14:12:51] [INFO ] Invariant cache hit.
[2024-05-25 14:12:51] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-25 14:12:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/360 variables, 244/376 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 377 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4227 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/360 variables, 244/376 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 108/484 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 1/361 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 485 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6140 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 10415ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10416ms
Finished structural reductions in LTL mode , in 1 iterations and 10748 ms. Remains : 245/245 places, 116/116 transitions.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (AND (NOT p0) p2 p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 261 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[true, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (3933 resets) in 171 ms. (232 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40002 steps (714 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (694 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (437 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (435 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
[2024-05-25 14:13:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 73/96 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 230/326 variables, 191/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 114/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 34/360 variables, 30/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/361 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/361 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 377 constraints, problems are : Problem set: 0 solved, 4 unsolved in 300 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 73/96 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 230/326 variables, 191/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 114/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 34/360 variables, 30/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 12/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/361 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/361 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 381 constraints, problems are : Problem set: 0 solved, 4 unsolved in 453 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 763ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 4 properties in 9 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X (AND (NOT p0) p2 p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p1) p2))), (F p0), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 913 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[true, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 324 ms :[true, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 299 ms :[true, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 9825 reset in 202 ms.
Product exploration explored 100000 steps with 9830 reset in 208 ms.
Applying partial POR strategy [true, false, true, true, false, true, false, false]
Stuttering acceptance computed with spot in 300 ms :[true, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 30 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Graph (complete) has 677 edges and 245 vertex of which 237 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 16 ms. Remains 237 /245 variables (removed 8) and now considering 115/116 (removed 1) transitions.
[2024-05-25 14:13:06] [INFO ] Redundant transitions in 16 ms returned []
Running 107 sub problems to find dead transitions.
// Phase 1: matrix 115 rows 237 cols
[2024-05-25 14:13:06] [INFO ] Computed 126 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD109 is UNSAT
At refinement iteration 2 (OVERLAPS) 115/351 variables, 236/362 constraints. Problems are: Problem set: 2 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/362 constraints. Problems are: Problem set: 2 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/352 variables, 1/363 constraints. Problems are: Problem set: 2 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/363 constraints. Problems are: Problem set: 2 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/352 variables, 0/363 constraints. Problems are: Problem set: 2 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 363 constraints, problems are : Problem set: 2 solved, 105 unsolved in 3858 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 126/126 constraints. Problems are: Problem set: 2 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/126 constraints. Problems are: Problem set: 2 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/349 variables, 235/361 constraints. Problems are: Problem set: 2 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 105/466 constraints. Problems are: Problem set: 2 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/466 constraints. Problems are: Problem set: 2 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 3/352 variables, 2/468 constraints. Problems are: Problem set: 2 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/468 constraints. Problems are: Problem set: 2 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/352 variables, 0/468 constraints. Problems are: Problem set: 2 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 468 constraints, problems are : Problem set: 2 solved, 105 unsolved in 6133 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 105/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 10045ms problems are : Problem set: 2 solved, 105 unsolved
Search for dead transitions found 2 dead transitions in 10048ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 237/245 places, 113/116 transitions.
Graph (complete) has 703 edges and 237 vertex of which 236 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 236 /237 variables (removed 1) and now considering 113/113 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 236/245 places, 113/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10106 ms. Remains : 236/245 places, 113/116 transitions.
Support contains 30 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2024-05-25 14:13:16] [INFO ] Computed 132 invariants in 13 ms
[2024-05-25 14:13:16] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-25 14:13:16] [INFO ] Invariant cache hit.
[2024-05-25 14:13:17] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-25 14:13:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/360 variables, 244/376 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 377 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4066 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/360 variables, 244/376 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 108/484 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 1/361 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 485 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6145 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 10259ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10260ms
Finished structural reductions in LTL mode , in 1 iterations and 10639 ms. Remains : 245/245 places, 116/116 transitions.
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-10 finished in 40770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F((!p1||G(p2))))&&p0))))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 14:13:27] [INFO ] Computed 138 invariants in 3 ms
[2024-05-25 14:13:27] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-25 14:13:27] [INFO ] Invariant cache hit.
[2024-05-25 14:13:27] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 362 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 371 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p2) p1), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-13
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-13 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U X(!p1)))||G(p2)))'
[2024-05-25 14:13:28] [INFO ] Flatten gal took : 16 ms
[2024-05-25 14:13:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-25 14:13:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 252 places, 116 transitions and 590 arcs took 4 ms.
Total runtime 64886 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-COL-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 252
TRANSITIONS: 116
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.003s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 1203
MODEL NAME: /home/mcc/execution/411/model
252 places, 116 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-06-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716646457933

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-06"
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-06, 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-171662335700012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 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 ;