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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 03:56 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 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 429K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 13 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K 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 149K 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-10-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716769604016

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-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 00:26:45] [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 00:26:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:26:45] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-05-27 00:26:45] [INFO ] Transformed 550 places.
[2024-05-27 00:26:45] [INFO ] Transformed 176 transitions.
[2024-05-27 00:26:45] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 217 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 240 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-27 00:26:46] [INFO ] Computed 350 invariants in 37 ms
[2024-05-27 00:26:46] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-27 00:26:46] [INFO ] Invariant cache hit.
[2024-05-27 00:26:46] [INFO ] Implicit Places using invariants and state equation in 502 ms returned [303, 304, 311, 312, 313, 315, 316, 317, 318, 355]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 994 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/550 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1246 ms. Remains : 514/550 places, 176/176 transitions.
Support contains 217 out of 514 places after structural reductions.
[2024-05-27 00:26:47] [INFO ] Flatten gal took : 62 ms
[2024-05-27 00:26:47] [INFO ] Flatten gal took : 29 ms
[2024-05-27 00:26:47] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 695 resets, run finished after 679 ms. (steps per millisecond=14 ) properties (out of 17) seen :3
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 176 rows 514 cols
[2024-05-27 00:26:48] [INFO ] Computed 340 invariants in 8 ms
[2024-05-27 00:26:48] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 47 ms returned sat
[2024-05-27 00:26:49] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-27 00:26:49] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 49 ms returned sat
[2024-05-27 00:26:49] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2024-05-27 00:26:50] [INFO ] After 1061ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 442 ms.
[2024-05-27 00:26:50] [INFO ] After 1875ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 13 different solutions.
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=15 )
Parikh walk visited 12 properties in 21 ms.
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 381 are kept as prefixes of interest. Removing 133 places using SCC suffix rule.2 ms
Discarding 133 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 381 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 379 transition count 147
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 50 place count 359 transition count 127
Iterating global reduction 2 with 20 rules applied. Total rules applied 70 place count 359 transition count 127
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 359 transition count 116
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 92 place count 348 transition count 116
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 102 place count 348 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 347 transition count 115
Applied a total of 103 rules in 85 ms. Remains 347 /514 variables (removed 167) and now considering 115/176 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 347/514 places, 115/176 transitions.
Incomplete random walk after 10000 steps, including 726 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 906 steps, run visited all 1 properties in 13 ms. (steps per millisecond=69 )
Probabilistic random walk after 906 steps, saw 862 distinct states, run finished after 13 ms. (steps per millisecond=69 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-27 00:26:51] [INFO ] Invariant cache hit.
[2024-05-27 00:26:51] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-27 00:26:51] [INFO ] Invariant cache hit.
[2024-05-27 00:26:52] [INFO ] Implicit Places using invariants and state equation in 600 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 938 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 955 ms. Remains : 513/514 places, 176/176 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 166 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s76 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][false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-03 finished in 1176 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(F(!p0))&&F(p1))))'
Support contains 23 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-27 00:26:52] [INFO ] Invariant cache hit.
[2024-05-27 00:26:52] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-27 00:26:52] [INFO ] Invariant cache hit.
[2024-05-27 00:26:53] [INFO ] Implicit Places using invariants and state equation in 639 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 950 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 969 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s62 1) (LT s458 1)) (OR (LT s66 1) (LT s462 1)) (OR (LT s61 1) (LT s457 1)) (OR (LT s65 1) (LT s461 1)) (OR (LT s60 1) (LT s456 1)) (OR (L...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 424 ms.
Product exploration explored 100000 steps with 33333 reset in 297 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 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-10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-04 finished in 2019 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)||X(X(X(X(G(!p1))))))))'
Support contains 34 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-27 00:26:54] [INFO ] Invariant cache hit.
[2024-05-27 00:26:54] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-27 00:26:54] [INFO ] Invariant cache hit.
[2024-05-27 00:26:55] [INFO ] Implicit Places using invariants and state equation in 513 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 829 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 849 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 462 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), p1, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={} source=8 dest: 6}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 7}], [{ cond=true, acceptance={} source=10 dest: 11}], [{ cond=(NOT p0), acceptance={} source=11 dest: 8}, { cond=p0, acceptance={} source=11 dest: 9}]], initial=10, aps=[p1:(AND (OR (LT s62 1) (LT s458 1)) (OR (LT s66 1) (LT s462 1)) (OR (LT s61 1) (LT s457 1)) (OR (LT s65 1) (LT s461 1)) (OR (LT s60 1) (LT s456 1)) (OR (L...], 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, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-05 finished in 1332 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)||G(p1))))'
Support contains 34 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.8 ms
Discarding 12 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 500 transition count 172
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 500 transition count 172
Applied a total of 4 rules in 55 ms. Remains 500 /514 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 500 cols
[2024-05-27 00:26:55] [INFO ] Computed 330 invariants in 8 ms
[2024-05-27 00:26:56] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-27 00:26:56] [INFO ] Invariant cache hit.
[2024-05-27 00:26:56] [INFO ] Implicit Places using invariants and state equation in 529 ms returned [307, 419, 420, 421, 422, 423, 424, 476, 479, 480, 481, 482]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 959 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/514 places, 172/176 transitions.
Applied a total of 0 rules in 22 ms. Remains 488 /488 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1036 ms. Remains : 488/514 places, 172/176 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s52 1) (LT s481 1)) (OR (LT s43 1) (LT s474 1)) (OR (LT s51 1) (LT s482 1)) (OR (LT s53 1) (LT s480 1)) (OR (LT s44 1) (LT s473 1)) (OR (L...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6772 reset in 538 ms.
Product exploration explored 100000 steps with 6775 reset in 494 ms.
Computed a total of 488 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (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 11 factoid took 17 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-06 finished in 2251 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)&&F(G(p1)))))'
Support contains 145 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 512 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 512 transition count 174
Applied a total of 3 rules in 36 ms. Remains 512 /514 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 512 cols
[2024-05-27 00:26:58] [INFO ] Computed 340 invariants in 10 ms
[2024-05-27 00:26:58] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-27 00:26:58] [INFO ] Invariant cache hit.
[2024-05-27 00:26:58] [INFO ] Implicit Places using invariants and state equation in 459 ms returned [308, 420, 421, 422, 423, 424, 425, 477, 480, 481, 482, 483]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 712 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/514 places, 174/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 762 ms. Remains : 500/514 places, 174/176 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s26 1) (GEQ s336 1) (GEQ s346 1) (GEQ s349 1) (GEQ s355 1) (GEQ s375 1) (GEQ s386 1) (GEQ s390 1) (GEQ s395 1) (GEQ s415 1) (GEQ s428 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-07 finished in 906 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 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions 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 499 transition count 171
Applied a total of 5 rules in 31 ms. Remains 499 /514 variables (removed 15) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 499 cols
[2024-05-27 00:26:59] [INFO ] Computed 330 invariants in 8 ms
[2024-05-27 00:26:59] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-27 00:26:59] [INFO ] Invariant cache hit.
[2024-05-27 00:26:59] [INFO ] Implicit Places using invariants and state equation in 591 ms returned [306, 418, 419, 420, 421, 422, 423, 475, 478, 479, 480, 481]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 891 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/514 places, 171/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 937 ms. Remains : 487/514 places, 171/176 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-08 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:(GEQ s17 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 15 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-08 finished in 1025 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)))'
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 1 are kept as prefixes of interest. Removing 513 places using SCC suffix rule.2 ms
Discarding 513 places :
Also discarding 175 output transitions
Drop transitions removed 175 transitions
Applied a total of 1 rules in 4 ms. Remains 1 /514 variables (removed 513) and now considering 1/176 (removed 175) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-27 00:27:00] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 00:27:00] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-27 00:27:00] [INFO ] Invariant cache hit.
[2024-05-27 00:27:00] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-27 00:27:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 00:27:00] [INFO ] Invariant cache hit.
[2024-05-27 00:27:00] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/514 places, 1/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 1/514 places, 1/176 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-09 finished in 107 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(G(p1)))))'
Support contains 13 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2024-05-27 00:27:00] [INFO ] Computed 340 invariants in 10 ms
[2024-05-27 00:27:00] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-27 00:27:00] [INFO ] Invariant cache hit.
[2024-05-27 00:27:01] [INFO ] Implicit Places using invariants and state equation in 607 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 943 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 958 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s114 1) (GEQ s115 1) (GEQ s116 1) (GEQ s117 1) (GEQ s118 1) (GEQ s119 1) (GEQ s130 1) (GEQ s131 1) (GEQ s132 1) (GEQ s133 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-10 finished in 1137 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 12 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions 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 499 transition count 171
Applied a total of 5 rules in 28 ms. Remains 499 /514 variables (removed 15) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 499 cols
[2024-05-27 00:27:01] [INFO ] Computed 330 invariants in 8 ms
[2024-05-27 00:27:01] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-27 00:27:01] [INFO ] Invariant cache hit.
[2024-05-27 00:27:02] [INFO ] Implicit Places using invariants and state equation in 581 ms returned [306, 418, 419, 420, 421, 422, 423, 475, 478, 479, 480, 481]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 907 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/514 places, 171/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 947 ms. Remains : 487/514 places, 171/176 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-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:(AND (GEQ s26 1) (GEQ s334 1) (GEQ s344 1) (GEQ s347 1) (GEQ s353 1) (GEQ s373 1) (GEQ s384 1) (GEQ s388 1) (GEQ s393 1) (GEQ s413 1) (GEQ s426 1) (GEQ...], 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 12 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-11 finished in 1042 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||(p1 U (p2||G(p1)))))))'
Support contains 16 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 502 transition count 174
Applied a total of 2 rules in 38 ms. Remains 502 /514 variables (removed 12) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 502 cols
[2024-05-27 00:27:02] [INFO ] Computed 330 invariants in 7 ms
[2024-05-27 00:27:02] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-27 00:27:02] [INFO ] Invariant cache hit.
[2024-05-27 00:27:03] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
[2024-05-27 00:27:03] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-27 00:27:03] [INFO ] Invariant cache hit.
[2024-05-27 00:27:03] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 502/514 places, 174/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1225 ms. Remains : 502/514 places, 174/176 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (LT s77 1) (NOT (AND (GEQ s250 1) (GEQ s286 1) (GEQ s287 1) (GEQ s288 1) (GEQ s289 1) (GEQ s290 1) (GEQ s291 1) (GEQ s292 1) (GEQ s293 1) (GEQ s29...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6925 reset in 154 ms.
Product exploration explored 100000 steps with 6926 reset in 182 ms.
Computed a total of 502 stabilizing places and 174 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 502 transition count 174
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 (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (G p2)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 22 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-13 finished in 1778 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||G(!p1)))&&X(X(F(p2))))))'
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2024-05-27 00:27:04] [INFO ] Computed 340 invariants in 7 ms
[2024-05-27 00:27:04] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-27 00:27:04] [INFO ] Invariant cache hit.
[2024-05-27 00:27:04] [INFO ] Implicit Places using invariants and state equation in 558 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 878 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 901 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), true, p1, (AND p1 (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s10 1)), p1:(LT s77 1), p2:(AND (GEQ s0 1) (GEQ s22 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-15 finished in 1153 ms.
All properties solved by simple procedures.
Total runtime 19779 ms.

BK_STOP 1716769626484

--------------------
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-10"
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-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361400048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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