Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017400956.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400956
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 7.1K Apr 30 13:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 13:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 30 13:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 13:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 55K May 10 09:34 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-02-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652992517516

Running Version 202205111006
[2022-05-19 20:35:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 20:35:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:35:18] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2022-05-19 20:35:18] [INFO ] Transformed 86 places.
[2022-05-19 20:35:18] [INFO ] Transformed 56 transitions.
[2022-05-19 20:35:18] [INFO ] Parsed PT model containing 86 places and 56 transitions in 168 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 2 formulas.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 76 transition count 56
Applied a total of 10 rules in 10 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:19] [INFO ] Computed 22 place invariants in 24 ms
[2022-05-19 20:35:19] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:19] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-19 20:35:19] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:19] [INFO ] Computed 22 place invariants in 7 ms
[2022-05-19 20:35:19] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/86 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/86 places, 56/56 transitions.
Support contains 61 out of 76 places after structural reductions.
[2022-05-19 20:35:19] [INFO ] Flatten gal took : 23 ms
[2022-05-19 20:35:19] [INFO ] Flatten gal took : 10 ms
[2022-05-19 20:35:19] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1638 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 26) seen :8
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 56 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 58 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 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 58 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 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 27 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 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 25 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 27 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :11
Running SMT prover for 5 properties.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:20] [INFO ] Computed 22 place invariants in 12 ms
[2022-05-19 20:35:20] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 3 ms returned sat
[2022-05-19 20:35:20] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2022-05-19 20:35:20] [INFO ] After 55ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-19 20:35:20] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:3
[2022-05-19 20:35:20] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 2 ms returned sat
[2022-05-19 20:35:20] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-19 20:35:20] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-19 20:35:20] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 28 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 4 properties in 4 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 76 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 56
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((((F(p1) U !p2)||X(!p2))&&p2))||p0)))'
Support contains 7 out of 76 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 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 69 transition count 51
Applied a total of 5 rules in 23 ms. Remains 69 /76 variables (removed 7) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 20:35:21] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:21] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 20:35:21] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 20:35:21] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [40, 41, 47, 52, 58, 59]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 158 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/76 places, 51/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/76 places, 51/56 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s18 1)) (AND (GEQ s0 1) (GEQ s15 1)) (AND (GEQ s0 1) (GEQ s17 1))), p2:(OR (AND (GEQ s0 1) (GEQ s1 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-00 finished in 461 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 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 70 transition count 52
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 70 transition count 52
Applied a total of 4 rules in 13 ms. Remains 70 /76 variables (removed 6) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 70 cols
[2022-05-19 20:35:21] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:21] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 52 rows 70 cols
[2022-05-19 20:35:21] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 20:35:21] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [41, 42, 48, 53, 59, 60]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 140 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/76 places, 52/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/76 places, 52/56 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s16 1) (LT s63 1)) (OR (LT s14 1) (LT s57 1)) (OR (LT s13 1) (LT s58 1)))], nbAcceptance=1, 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 18762 reset in 243 ms.
Product exploration explored 100000 steps with 18757 reset in 151 ms.
Computed a total of 64 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 52
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 :(F (G p0))
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-01 finished in 746 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((F(p1)&&p0)))))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:22] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-19 20:35:22] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:22] [INFO ] Computed 22 place invariants in 7 ms
[2022-05-19 20:35:22] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [43, 44, 50]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 131 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-03 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:(GEQ s21 1), p0:(AND (GEQ s28 1) (GEQ s53 1) (GEQ s54 1) (GEQ s55 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][false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-03 finished in 263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F((p0 U (G(p0)&&p1)))))'
Support contains 13 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 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 70 transition count 52
Applied a total of 5 rules in 5 ms. Remains 70 /76 variables (removed 6) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 70 cols
[2022-05-19 20:35:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:22] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 52 rows 70 cols
[2022-05-19 20:35:22] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-19 20:35:22] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [40, 41, 47]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 123 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/76 places, 52/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 67/76 places, 52/56 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s25 1), p0:(OR (AND (GEQ s9 1) (GEQ s42 1) (GEQ s46 1) (GEQ s54 1)) (AND (GEQ s8 1) (GEQ s43 1) (GEQ s47 1) (GEQ s53 1)) (AND (GEQ s7 1) (GEQ s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-04 finished in 227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U G(p0))&&(F(X(G(p2)))||p1))))'
Support contains 13 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 47 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 46 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 45 transition count 38
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 45 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 44 transition count 37
Applied a total of 11 rules in 11 ms. Remains 44 /76 variables (removed 32) and now considering 37/56 (removed 19) transitions.
// Phase 1: matrix 37 rows 44 cols
[2022-05-19 20:35:22] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 20:35:22] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 37 rows 44 cols
[2022-05-19 20:35:22] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 20:35:22] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [29, 33, 34]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 70 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/76 places, 37/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 41/76 places, 37/56 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s15 1), p1:(OR (AND (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s25 1)) (AND (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1)) (AND (GEQ s20 1) (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-06 finished in 272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 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 69 transition count 51
Applied a total of 5 rules in 10 ms. Remains 69 /76 variables (removed 7) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 20:35:23] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 20:35:23] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 20:35:23] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:23] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [40, 41, 47, 52, 58, 59]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 112 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/76 places, 51/56 transitions.
Applied a total of 0 rules in 8 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/76 places, 51/56 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s28 1) (GEQ s31 1) (GEQ s32 1)) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s24 1) (GEQ s26 1)) (AND (GEQ s2 1) (GEQ s27 1) (GEQ s29 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 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-07 finished in 187 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F((G(p0)||p1)) U G(!X(p2))))'
Support contains 7 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:23] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-19 20:35:23] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:23] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-19 20:35:23] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [43, 44, 50]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 111 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s28 1) (GEQ s53 1) (GEQ s54 1) (GEQ s55 1)), p2:(GEQ s72 1), p0:(AND (GEQ s0 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 64 steps with 13 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-09 finished in 294 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p1))||p0)))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 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 69 transition count 51
Applied a total of 5 rules in 9 ms. Remains 69 /76 variables (removed 7) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 20:35:23] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:23] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 20:35:23] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-19 20:35:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [40, 41, 47, 52, 58, 59]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 115 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/76 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/76 places, 51/56 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s9 1)), p1:(AND (GEQ s0 1) (GEQ s9 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 18708 reset in 162 ms.
Product exploration explored 100000 steps with 18723 reset in 110 ms.
Computed a total of 63 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1881 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Finished Best-First random walk after 1034 steps, including 27 resets, run visited all 2 properties in 3 ms. (steps per millisecond=344 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 615 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 20:35:25] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-19 20:35:25] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 20:35:25] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-19 20:35:25] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-19 20:35:25] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 20:35:25] [INFO ] Computed 16 place invariants in 6 ms
[2022-05-19 20:35:25] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 51/51 transitions.
Computed a total of 63 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1880 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Finished Best-First random walk after 6823 steps, including 201 resets, run visited all 2 properties in 17 ms. (steps per millisecond=401 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 427 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 18754 reset in 73 ms.
Product exploration explored 100000 steps with 18729 reset in 78 ms.
Built C files in :
/tmp/ltsmin1285024285663493135
[2022-05-19 20:35:26] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2022-05-19 20:35:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:35:26] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2022-05-19 20:35:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:35:26] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2022-05-19 20:35:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:35:26] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1285024285663493135
Running compilation step : cd /tmp/ltsmin1285024285663493135;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 230 ms.
Running link step : cd /tmp/ltsmin1285024285663493135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1285024285663493135;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12129512885381013365.hoa' '--buchi-type=spotba'
LTSmin run took 131 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-10 finished in 3575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(F(p0))||(p0 U G(p1))))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 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 70 transition count 52
Applied a total of 5 rules in 4 ms. Remains 70 /76 variables (removed 6) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 70 cols
[2022-05-19 20:35:27] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:27] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 52 rows 70 cols
[2022-05-19 20:35:27] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-19 20:35:27] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [40, 41, 47]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 107 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/76 places, 52/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 67/76 places, 52/56 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 1), p1:(GEQ s66 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-11 finished in 205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((G(((G(p0)&&p1)||G(p0)))&&F(X(p0))))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:27] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 20:35:27] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:27] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 20:35:27] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [43, 44, 50]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 116 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 0 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s16 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 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-12 finished in 210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(G(p1))&&G(p1))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:27] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-19 20:35:27] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:27] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-19 20:35:27] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [43, 44, 50]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 119 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s23 1) (GEQ s17 1) (GEQ s66 1)), p1:(GEQ s23 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, null][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-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-13 finished in 274 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U !X(F((X(p0)||p1)))))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:27] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-19 20:35:27] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 20:35:27] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 20:35:27] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [43, 44, 50]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 123 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR p0 p1), true, (OR p0 p1), (OR p0 p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(OR p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s28 1) (GEQ s53 1) (GEQ s54 1) (GEQ s55 1)) (GEQ s24 1)), p0:(AND (GEQ s28 1) (GEQ s53 1) (GEQ s54 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 95 steps with 15 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-14 finished in 289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 69 transition count 51
Applied a total of 5 rules in 3 ms. Remains 69 /76 variables (removed 7) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 20:35:28] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:28] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 20:35:28] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:35:28] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [40, 41, 47, 52, 58, 59]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 109 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/76 places, 51/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/76 places, 51/56 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-15 finished in 148 ms.
All properties solved by simple procedures.
Total runtime 9556 ms.

BK_STOP 1652992528634

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-02, 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 r168-tall-165277017400956"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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