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.r329-tall-171662361500068.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 gold2023
Input is QuasiCertifProtocol-PT-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361500068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 942K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716773709976

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 01:35:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 01:35:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 01:35:11] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-05-27 01:35:11] [INFO ] Transformed 3806 places.
[2024-05-27 01:35:11] [INFO ] Transformed 506 transitions.
[2024-05-27 01:35:11] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2457 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 164 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-27 01:35:12] [INFO ] Computed 3232 invariants in 155 ms
[2024-05-27 01:35:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 01:35:14] [INFO ] Implicit Places using invariants in 1789 ms returned []
[2024-05-27 01:35:14] [INFO ] Invariant cache hit.
[2024-05-27 01:35:19] [INFO ] Implicit Places using invariants and state equation in 5202 ms returned []
Implicit Place search using SMT with State Equation took 7015 ms to find 0 implicit places.
[2024-05-27 01:35:19] [INFO ] Invariant cache hit.
[2024-05-27 01:35:20] [INFO ] Dead Transitions using invariants and state equation in 1483 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8664 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 2457 out of 3736 places after structural reductions.
[2024-05-27 01:35:21] [INFO ] Flatten gal took : 235 ms
[2024-05-27 01:35:21] [INFO ] Flatten gal took : 136 ms
[2024-05-27 01:35:21] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 2456 out of 3736 places (down from 2457) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-27 01:35:22] [INFO ] Invariant cache hit.
[2024-05-27 01:35:24] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 753 ms returned sat
[2024-05-27 01:35:26] [INFO ] After 3875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-27 01:35:28] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 795 ms returned sat
[2024-05-27 01:35:36] [INFO ] After 7106ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :14
[2024-05-27 01:35:42] [INFO ] After 13218ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :14
Attempting to minimize the solution found.
Minimization took 4132 ms.
[2024-05-27 01:35:47] [INFO ] After 20334ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :14
Fused 16 Parikh solutions to 12 different solutions.
Finished Parikh walk after 184 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=36 )
Parikh walk visited 13 properties in 50 ms.
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 1460 are kept as prefixes of interest. Removing 2276 places using SCC suffix rule.13 ms
Discarding 2276 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 333 rules applied. Total rules applied 334 place count 1394 transition count 140
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 368 place count 1360 transition count 140
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 368 place count 1360 transition count 41
Deduced a syphon composed of 99 places in 3 ms
Ensure Unique test removed 1187 places
Reduce places removed 1286 places and 0 transitions.
Iterating global reduction 2 with 1385 rules applied. Total rules applied 1753 place count 74 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 1754 place count 74 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1755 place count 73 transition count 40
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 1755 place count 73 transition count 6
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 101 rules applied. Total rules applied 1856 place count 6 transition count 6
Applied a total of 1856 rules in 109 ms. Remains 6 /3736 variables (removed 3730) and now considering 6/506 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 6/3736 places, 6/506 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||F(p2)))))))'
Support contains 68 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.34 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions 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 3700 transition count 502
Applied a total of 3 rules in 614 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-27 01:35:48] [INFO ] Computed 3200 invariants in 69 ms
[2024-05-27 01:35:51] [INFO ] Implicit Places using invariants in 2973 ms returned []
[2024-05-27 01:35:51] [INFO ] Invariant cache hit.
[2024-05-27 01:36:00] [INFO ] Implicit Places using invariants and state equation in 9423 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 12400 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 224 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13239 ms. Remains : 3634/3736 places, 502/506 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s247 1), p1:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s20 1)) (OR (LT s0 1) (LT s23 1)) (OR (LT s0 1) (LT s22 1)) (OR (LT s0 1) (LT s17 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2467 reset in 673 ms.
Product exploration explored 100000 steps with 2465 reset in 582 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 23 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-00 finished in 15408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&F(p1))) U X((F(p2) U (p3 U p1)))))'
Support contains 1222 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 98 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-27 01:36:03] [INFO ] Computed 3232 invariants in 40 ms
[2024-05-27 01:36:07] [INFO ] Implicit Places using invariants in 4611 ms returned []
[2024-05-27 01:36:07] [INFO ] Invariant cache hit.
[2024-05-27 01:36:15] [INFO ] Implicit Places using invariants and state equation in 7586 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 12201 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 95 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12396 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s20 1)) (OR (LT s0 1) (LT s23 1)) (OR (LT s0 1) (LT s22 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 4 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-01 finished in 12706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((!p1&&X(!p1)))))'
Support contains 35 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.13 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions 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 3700 transition count 502
Applied a total of 3 rules in 710 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-27 01:36:16] [INFO ] Computed 3200 invariants in 41 ms
[2024-05-27 01:36:22] [INFO ] Implicit Places using invariants in 5727 ms returned []
[2024-05-27 01:36:22] [INFO ] Invariant cache hit.
[2024-05-27 01:36:30] [INFO ] Implicit Places using invariants and state equation in 8746 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 14480 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 263 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15453 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 133 ms :[p1, true, p1, p1]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s84 1)) (AND (GEQ s0 1) (GEQ s85 1)) (AND (GEQ s0 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s83 1)) (AND (GEQ s0 1) (GEQ s80 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2468 reset in 800 ms.
Product exploration explored 100000 steps with 2468 reset in 777 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 194 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, p1]
Incomplete random walk after 10000 steps, including 247 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1765814 steps, run timeout after 3001 ms. (steps per millisecond=588 ) properties seen :{}
Probabilistic random walk after 1765814 steps, saw 211774 distinct states, run finished after 3003 ms. (steps per millisecond=588 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 502 rows 3634 cols
[2024-05-27 01:36:37] [INFO ] Computed 3136 invariants in 791 ms
[2024-05-27 01:36:38] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 724 ms returned sat
[2024-05-27 01:36:40] [INFO ] After 2597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 01:36:41] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 725 ms returned sat
[2024-05-27 01:36:42] [INFO ] After 1439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 01:36:42] [INFO ] After 1688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 200 ms.
[2024-05-27 01:36:43] [INFO ] After 3002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 14 factoid took 233 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-02 finished in 27790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0))||(G(p1) U !p2))))))'
Support contains 3 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 238 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-27 01:36:43] [INFO ] Computed 3232 invariants in 39 ms
[2024-05-27 01:36:49] [INFO ] Implicit Places using invariants in 6133 ms returned []
[2024-05-27 01:36:49] [INFO ] Invariant cache hit.
[2024-05-27 01:37:02] [INFO ] Implicit Places using invariants and state equation in 13061 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 19197 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 267 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19703 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 423 ms :[true, (OR (NOT p1) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 2}], [{ cond=true, acceptance={} source=8 dest: 7}], [{ cond=true, acceptance={} source=9 dest: 8}]], initial=9, aps=[p1:(LT s246 1), p2:(LT s249 1), p0:(GEQ s3512 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-03 finished in 20157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 101 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 285 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-27 01:37:03] [INFO ] Invariant cache hit.
[2024-05-27 01:37:07] [INFO ] Implicit Places using invariants in 3245 ms returned []
[2024-05-27 01:37:07] [INFO ] Invariant cache hit.
[2024-05-27 01:37:17] [INFO ] Implicit Places using invariants and state equation in 10060 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13306 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 255 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13848 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s246 1) (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s22 1)) (AND (GEQ s0 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-04 finished in 13992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&G(((!p1 U p2) U !p0)))))'
Support contains 69 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.15 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 580 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-27 01:37:18] [INFO ] Computed 3200 invariants in 37 ms
[2024-05-27 01:37:24] [INFO ] Implicit Places using invariants in 5962 ms returned []
[2024-05-27 01:37:24] [INFO ] Invariant cache hit.
[2024-05-27 01:37:34] [INFO ] Implicit Places using invariants and state equation in 9982 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 15949 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 268 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16798 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 170 ms :[p0, p0, (AND p0 (NOT p2)), p0]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s219 1) (GEQ s3531 1) (GEQ s3532 1) (GEQ s3533 1) (GEQ s3534 1) (GEQ s3539 1) (GEQ s3540 1) (GEQ s3541 1) (GEQ s3542 1) (GEQ s3543 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2460 reset in 369 ms.
Product exploration explored 100000 steps with 2463 reset in 389 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
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) (NOT p2) p1), (X (OR (NOT p0) p2 (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p0)), (X (X (OR (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 25 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-06 finished in 18311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1122 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 2582 are kept as prefixes of interest. Removing 1154 places using SCC suffix rule.8 ms
Discarding 1154 places :
Also discarding 33 output transitions
Drop transitions removed 33 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2581 transition count 442
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 65 place count 2547 transition count 374
Iterating global reduction 1 with 34 rules applied. Total rules applied 99 place count 2547 transition count 374
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 2545 transition count 372
Applied a total of 103 rules in 203 ms. Remains 2545 /3736 variables (removed 1191) and now considering 372/506 (removed 134) transitions.
// Phase 1: matrix 372 rows 2545 cols
[2024-05-27 01:37:36] [INFO ] Computed 2176 invariants in 17 ms
[2024-05-27 01:37:38] [INFO ] Implicit Places using invariants in 2094 ms returned []
[2024-05-27 01:37:38] [INFO ] Invariant cache hit.
[2024-05-27 01:37:41] [INFO ] Implicit Places using invariants and state equation in 3186 ms returned [2188, 2189, 2190, 2191, 2192, 2193, 2194, 2195, 2518, 2521, 2522, 2523, 2524, 2525, 2526, 2527, 2528, 2529, 2530, 2531, 2532, 2533, 2534, 2535, 2536, 2537, 2538, 2539, 2540, 2541, 2542, 2543, 2544]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 5282 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2512/3736 places, 372/506 transitions.
Applied a total of 0 rules in 75 ms. Remains 2512 /2512 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5561 ms. Remains : 2512/3736 places, 372/506 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s281 1) (GEQ s284 1) (GEQ s285 1) (GEQ s286 1) (GEQ s287 1) (GEQ s288 1) (GEQ s289 1) (GEQ s290 1) (GEQ s291 1) (GEQ s308 1) (GEQ s309 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-07 finished in 5661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 36 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 236 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-27 01:37:41] [INFO ] Computed 3232 invariants in 35 ms
[2024-05-27 01:37:47] [INFO ] Implicit Places using invariants in 5931 ms returned []
[2024-05-27 01:37:47] [INFO ] Invariant cache hit.
[2024-05-27 01:37:59] [INFO ] Implicit Places using invariants and state equation in 11711 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17645 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 232 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18114 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s246 1) (GEQ s3645 1) (GEQ s3646 1) (GEQ s3647 1) (GEQ s3648 1) (GEQ s3649 1) (GEQ s3650 1) (GEQ s3651 1) (GEQ s3652 1) (GEQ s3653 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-09 finished in 18230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 36 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 234 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-27 01:38:00] [INFO ] Invariant cache hit.
[2024-05-27 01:38:06] [INFO ] Implicit Places using invariants in 6224 ms returned []
[2024-05-27 01:38:06] [INFO ] Invariant cache hit.
[2024-05-27 01:38:18] [INFO ] Implicit Places using invariants and state equation in 12537 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 18768 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 222 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19224 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s201 1) (GEQ s3618 1)), p1:(AND (GEQ s219 1) (GEQ s3575 1) (GEQ s3576 1) (GEQ s3577 1) (GEQ s3578 1) (GEQ s3583 1) (GEQ s3584 1) (GEQ s3585 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-10 finished in 19343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.12 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 3700 transition count 502
Applied a total of 5 rules in 488 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-05-27 01:38:19] [INFO ] Computed 3200 invariants in 43 ms
[2024-05-27 01:38:22] [INFO ] Implicit Places using invariants in 3309 ms returned []
[2024-05-27 01:38:22] [INFO ] Invariant cache hit.
[2024-05-27 01:38:34] [INFO ] Implicit Places using invariants and state equation in 11544 ms returned [2278, 2279, 2280, 2281, 2282, 2283, 2284, 2285, 2290, 2291, 2294, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2318, 2319, 2320, 2321, 2322, 2323, 2324]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 14862 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3667/3736 places, 502/506 transitions.
Applied a total of 0 rules in 256 ms. Remains 3667 /3667 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15606 ms. Remains : 3667/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s50 1) (LT s221 1) (LT s3645 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2674 reset in 357 ms.
Product exploration explored 100000 steps with 2675 reset in 353 ms.
Computed a total of 3667 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3667 transition count 502
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 23 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-11 finished in 16956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&F(!p1)))'
Support contains 3 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 224 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-05-27 01:38:36] [INFO ] Computed 3232 invariants in 40 ms
[2024-05-27 01:38:39] [INFO ] Implicit Places using invariants in 3281 ms returned []
[2024-05-27 01:38:39] [INFO ] Invariant cache hit.
[2024-05-27 01:38:49] [INFO ] Implicit Places using invariants and state equation in 9905 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 13192 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 208 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13625 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) p1), (NOT p0), p1, (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s248 1), p0:(OR (LT s0 1) (LT s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-13 finished in 13847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 230 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-27 01:38:50] [INFO ] Invariant cache hit.
[2024-05-27 01:38:56] [INFO ] Implicit Places using invariants in 6108 ms returned []
[2024-05-27 01:38:56] [INFO ] Invariant cache hit.
[2024-05-27 01:39:08] [INFO ] Implicit Places using invariants and state equation in 12639 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 18752 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 222 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19205 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s3512 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-14 finished in 19303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (p1||G(p0))))))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 215 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-27 01:39:09] [INFO ] Invariant cache hit.
[2024-05-27 01:39:15] [INFO ] Implicit Places using invariants in 6043 ms returned []
[2024-05-27 01:39:15] [INFO ] Invariant cache hit.
[2024-05-27 01:39:29] [INFO ] Implicit Places using invariants and state equation in 13514 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 19564 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 218 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19998 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (LT s249 1) (LT s33 1)), p0:(LT s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1989 ms.
Product exploration explored 100000 steps with 33333 reset in 1943 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 109 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-PT-32-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-15 finished in 24737 ms.
All properties solved by simple procedures.
Total runtime 262530 ms.

BK_STOP 1716773975322

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is QuasiCertifProtocol-PT-32, 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 r329-tall-171662361500068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 execution
cd execution
if [ "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 ;