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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 119K Apr 30 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 720K Apr 30 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 30 13:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 165K Apr 30 13:18 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 69K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 281K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K May 9 08:31 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 942K 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-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653002112605

Running Version 202205111006
[2022-05-19 23:15:13] [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 23:15:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 23:15:14] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2022-05-19 23:15:14] [INFO ] Transformed 3806 places.
[2022-05-19 23:15:14] [INFO ] Transformed 506 transitions.
[2022-05-19 23:15:14] [INFO ] Parsed PT model containing 3806 places and 506 transitions in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2553 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 169 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2022-05-19 23:15:14] [INFO ] Computed 3232 place invariants in 200 ms
[2022-05-19 23:15:16] [INFO ] Implicit Places using invariants in 1961 ms returned []
// Phase 1: matrix 506 rows 3736 cols
[2022-05-19 23:15:16] [INFO ] Computed 3232 place invariants in 178 ms
[2022-05-19 23:15:21] [INFO ] Implicit Places using invariants and state equation in 4751 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2305, 2306, 2307, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 6770 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3705/3806 places, 506/506 transitions.
Applied a total of 0 rules in 41 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3705/3806 places, 506/506 transitions.
Support contains 2553 out of 3705 places after structural reductions.
[2022-05-19 23:15:21] [INFO ] Flatten gal took : 268 ms
[2022-05-19 23:15:21] [INFO ] Flatten gal took : 159 ms
[2022-05-19 23:15:22] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:15:23] [INFO ] Computed 3201 place invariants in 46 ms
[2022-05-19 23:15:26] [INFO ] [Real]Absence check using 0 positive and 3201 generalized place invariants in 702 ms returned sat
[2022-05-19 23:15:30] [INFO ] After 2870ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:24
[2022-05-19 23:15:31] [INFO ] After 4602ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:24
Attempting to minimize the solution found.
Minimization took 2602 ms.
[2022-05-19 23:15:34] [INFO ] After 10503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:24
[2022-05-19 23:15:36] [INFO ] [Nat]Absence check using 0 positive and 3201 generalized place invariants in 703 ms returned sat
[2022-05-19 23:15:49] [INFO ] After 11017ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :25
[2022-05-19 23:15:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:15:59] [INFO ] After 25171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3 real:24
Fused 27 Parikh solutions to 24 different solutions.
Finished Parikh walk after 130 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
Parikh walk visited 25 properties in 72 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Computed a total of 3705 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3705 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((false U p0)||X(G(X(p1))))))'
Support contains 1123 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 270 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:16:00] [INFO ] Computed 3201 place invariants in 39 ms
[2022-05-19 23:16:02] [INFO ] Implicit Places using invariants in 2453 ms returned []
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:16:02] [INFO ] Computed 3201 place invariants in 39 ms
[2022-05-19 23:16:10] [INFO ] Implicit Places using invariants and state equation in 7322 ms returned [2287, 2288]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9779 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3705 places, 506/506 transitions.
Applied a total of 0 rules in 121 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3705 places, 506/506 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LT s219 1), p1:(OR (AND (GEQ s8 1) (GEQ s442 1) (GEQ s443 1) (GEQ s444 1) (GEQ s445 1) (GEQ s446 1) (GEQ s447 1) (GEQ s478 1) (GEQ s479 1) (GEQ s480 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]]
Product exploration explored 100000 steps with 50000 reset in 1119 ms.
Product exploration explored 100000 steps with 50000 reset in 1031 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-00 finished in 13385 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(X((G(p0)||p0)))||X(p1)))||G(!p0))))'
Support contains 1123 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 182 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:16:13] [INFO ] Computed 3201 place invariants in 35 ms
[2022-05-19 23:16:17] [INFO ] Implicit Places using invariants in 3719 ms returned []
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:16:17] [INFO ] Computed 3201 place invariants in 33 ms
[2022-05-19 23:16:22] [INFO ] Implicit Places using invariants and state equation in 5450 ms returned [2287, 2288]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9174 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3705 places, 506/506 transitions.
Applied a total of 0 rules in 108 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3705 places, 506/506 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), false, false, false, false, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 3}], [{ cond=p0, acceptance={} source=7 dest: 0}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=5, aps=[p0:(LT s248 1), p1:(OR (AND (GEQ s8 1) (GEQ s442 1) (GEQ s443 1) (GEQ s444 1) (GEQ s445 1) (GEQ s446 1) (GEQ s447 1) (GEQ s478 1) (GEQ s479 1) (GEQ s480 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2676 reset in 611 ms.
Product exploration explored 100000 steps with 2678 reset in 545 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 339 ms. Reduced automaton from 8 states, 18 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 264 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 543282 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 543282 steps, saw 67748 distinct states, run finished after 3006 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 23:16:30] [INFO ] Computed 3200 place invariants in 424 ms
[2022-05-19 23:16:31] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 732 ms returned sat
[2022-05-19 23:16:31] [INFO ] After 1347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 23:16:32] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 734 ms returned sat
[2022-05-19 23:16:49] [INFO ] After 16260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 23:16:56] [INFO ] After 23486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-19 23:16:56] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 240 steps, including 0 resets, run visited all 2 properties in 18 ms. (steps per millisecond=13 )
Parikh walk visited 4 properties in 43 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 464 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1123 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 105 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 23:16:57] [INFO ] Computed 3200 place invariants in 428 ms
[2022-05-19 23:17:00] [INFO ] Implicit Places using invariants in 2741 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 23:17:00] [INFO ] Computed 3200 place invariants in 461 ms
[2022-05-19 23:17:07] [INFO ] Implicit Places using invariants and state equation in 7650 ms returned []
Implicit Place search using SMT with State Equation took 10393 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 23:17:08] [INFO ] Computed 3200 place invariants in 436 ms
[2022-05-19 23:17:09] [INFO ] Dead Transitions using invariants and state equation in 1855 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 529294 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 529294 steps, saw 66127 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 23:17:15] [INFO ] Computed 3200 place invariants in 473 ms
[2022-05-19 23:17:16] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 707 ms returned sat
[2022-05-19 23:17:16] [INFO ] After 1334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 23:17:17] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 731 ms returned sat
[2022-05-19 23:17:34] [INFO ] After 15994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 23:17:41] [INFO ] After 23486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-19 23:17:41] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 240 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=16 )
Parikh walk visited 4 properties in 32 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2673 reset in 558 ms.
Product exploration explored 100000 steps with 2677 reset in 562 ms.
Built C files in :
/tmp/ltsmin9162586577057819107
[2022-05-19 23:17:43] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9162586577057819107
Running compilation step : cd /tmp/ltsmin9162586577057819107;'/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 2413 ms.
Running link step : cd /tmp/ltsmin9162586577057819107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9162586577057819107;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11992551624273732523.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1123 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 114 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 23:17:59] [INFO ] Computed 3200 place invariants in 475 ms
[2022-05-19 23:18:01] [INFO ] Implicit Places using invariants in 2684 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 23:18:02] [INFO ] Computed 3200 place invariants in 435 ms
[2022-05-19 23:18:07] [INFO ] Implicit Places using invariants and state equation in 5918 ms returned []
Implicit Place search using SMT with State Equation took 8607 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2022-05-19 23:18:08] [INFO ] Computed 3200 place invariants in 435 ms
[2022-05-19 23:18:09] [INFO ] Dead Transitions using invariants and state equation in 1851 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin16390204134410739931
[2022-05-19 23:18:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16390204134410739931
Running compilation step : cd /tmp/ltsmin16390204134410739931;'/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 2270 ms.
Running link step : cd /tmp/ltsmin16390204134410739931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16390204134410739931;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17654004294301848773.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 23:18:24] [INFO ] Flatten gal took : 96 ms
[2022-05-19 23:18:25] [INFO ] Flatten gal took : 93 ms
[2022-05-19 23:18:25] [INFO ] Time to serialize gal into /tmp/LTL14536180794804182783.gal : 22 ms
[2022-05-19 23:18:25] [INFO ] Time to serialize properties into /tmp/LTL4358716914641398347.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14536180794804182783.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4358716914641398347.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1453618...267
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(a4<1)"))||("(a4<1)"))))||(X("(((((((((((((c1_7>=1)&&(n9_4_7>=1))&&((n9_5_7>=1)&&(n9_2_7>=1)))&&(((n9_3_7>=1)&&(n9_0_...18393
Formula 0 simplified : !X(G(XX("(a4<1)" | G"(a4<1)") | X"(((((((((((((c1_7>=1)&&(n9_4_7>=1))&&((n9_5_7>=1)&&(n9_2_7>=1)))&&(((n9_3_7>=1)&&(n9_0_7>=1))&&((n...18374
Detected timeout of ITS tools.
[2022-05-19 23:18:40] [INFO ] Flatten gal took : 96 ms
[2022-05-19 23:18:40] [INFO ] Applying decomposition
[2022-05-19 23:18:40] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13329235523776255009.txt' '-o' '/tmp/graph13329235523776255009.bin' '-w' '/tmp/graph13329235523776255009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13329235523776255009.bin' '-l' '-1' '-v' '-w' '/tmp/graph13329235523776255009.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:18:40] [INFO ] Decomposing Gal with order
[2022-05-19 23:18:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:18:41] [INFO ] Removed a total of 327 redundant transitions.
[2022-05-19 23:18:41] [INFO ] Flatten gal took : 523 ms
[2022-05-19 23:18:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 170 ms.
[2022-05-19 23:18:41] [INFO ] Time to serialize gal into /tmp/LTL9713773939361006536.gal : 33 ms
[2022-05-19 23:18:41] [INFO ] Time to serialize properties into /tmp/LTL15292786653900208639.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9713773939361006536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15292786653900208639.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9713773...246
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(i41.u91.a4<1)"))||("(i41.u91.a4<1)"))))||(X("(((((((((((((i54.i1.u43.c1_7>=1)&&(u3.n9_4_7>=1))&&((u4.n9_5_7>=1)&&(u5...22817
Formula 0 simplified : !X(G(XX("(i41.u91.a4<1)" | G"(i41.u91.a4<1)") | X"(((((((((((((i54.i1.u43.c1_7>=1)&&(u3.n9_4_7>=1))&&((u4.n9_5_7>=1)&&(u5.n9_2_7>=1)...22798
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16069814683390722450
[2022-05-19 23:18:56] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16069814683390722450
Running compilation step : cd /tmp/ltsmin16069814683390722450;'/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 2326 ms.
Running link step : cd /tmp/ltsmin16069814683390722450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16069814683390722450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-01 finished in 178473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&X(F((F((F(p1)||p2))||(p3 U !p0))))))'
Support contains 35 out of 3705 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 256 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:19:12] [INFO ] Computed 3201 place invariants in 34 ms
[2022-05-19 23:19:15] [INFO ] Implicit Places using invariants in 3095 ms returned []
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:19:15] [INFO ] Computed 3201 place invariants in 29 ms
[2022-05-19 23:19:25] [INFO ] Implicit Places using invariants and state equation in 9979 ms returned [2287, 2288]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13079 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3705 places, 506/506 transitions.
Applied a total of 0 rules in 227 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3705 places, 506/506 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) p0 (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(GEQ s248 1), p0:(LT s220 1), p1:(OR (GEQ s63 1) (GEQ s65 1) (GEQ s64 1) (GEQ s66 1) (GEQ s33 1) (GEQ s34 1) (GEQ s36 1) (GEQ s38 1) (GEQ s37 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-02 finished in 13722 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(G(p0)) U !X(p1))&&X(p2))))'
Support contains 1190 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 397 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:19:26] [INFO ] Computed 3201 place invariants in 38 ms
[2022-05-19 23:19:29] [INFO ] Implicit Places using invariants in 3910 ms returned []
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:19:30] [INFO ] Computed 3201 place invariants in 30 ms
[2022-05-19 23:19:36] [INFO ] Implicit Places using invariants and state equation in 6501 ms returned [2287, 2288]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10414 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3705 places, 506/506 transitions.
Applied a total of 0 rules in 112 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3705 places, 506/506 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, (NOT p0), p1]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p2) (AND p1 (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s246 1), p1:(OR (AND (GEQ s8 1) (GEQ s442 1) (GEQ s443 1) (GEQ s444 1) (GEQ s445 1) (GEQ s446 1) (GEQ s447 1) (GEQ s478 1) (GEQ s479 1) (GEQ s480 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-03 finished in 11102 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F((G(p0)||p0))||F(p0))))&&F(p1)))'
Support contains 35 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 257 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:19:37] [INFO ] Computed 3201 place invariants in 35 ms
[2022-05-19 23:19:42] [INFO ] Implicit Places using invariants in 5901 ms returned []
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:19:42] [INFO ] Computed 3201 place invariants in 33 ms
[2022-05-19 23:19:55] [INFO ] Implicit Places using invariants and state equation in 12301 ms returned [2287, 2288]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18208 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3705 places, 506/506 transitions.
Applied a total of 0 rules in 258 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3705 places, 506/506 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s155 1)) (OR (LT s0 1) (LT s198 1)) (OR (LT s0 1) (LT s199 1)) (OR (LT s0 1) (LT s200 1)) (OR (LT s0 1) (LT s201 1)) (OR (LT s0 ...], 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 6513 reset in 362 ms.
Product exploration explored 100000 steps with 6498 reset in 399 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-04 finished in 20309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((G(X(p0))&&F(p0))))||(F(p2)&&p1))))'
Support contains 1190 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 117 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:19:57] [INFO ] Computed 3201 place invariants in 39 ms
[2022-05-19 23:20:01] [INFO ] Implicit Places using invariants in 4673 ms returned []
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:20:01] [INFO ] Computed 3201 place invariants in 33 ms
[2022-05-19 23:20:12] [INFO ] Implicit Places using invariants and state equation in 10127 ms returned [2287, 2288]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14808 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3705 places, 506/506 transitions.
Applied a total of 0 rules in 124 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3705 places, 506/506 transitions.
Stuttering acceptance computed with spot in 370 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 9}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=true, acceptance={} source=7 dest: 3}], [{ cond=(NOT p2), acceptance={} source=8 dest: 4}], [{ cond=(NOT p2), acceptance={} source=9 dest: 8}]], initial=6, aps=[p2:(AND (GEQ s219 1) (GEQ s3575 1) (GEQ s3576 1) (GEQ s3577 1) (GEQ s3578 1) (GEQ s3583 1) (GEQ s3584 1) (GEQ s3585 1) (GEQ s3586 1) (GEQ s3587 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-05 finished in 15442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 34 out of 3705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Graph (complete) has 40993 edges and 3705 vertex of which 3671 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.54 ms
Discarding 34 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 3668 transition count 501
Applied a total of 5 rules in 664 ms. Remains 3668 /3705 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3668 cols
[2022-05-19 23:20:13] [INFO ] Computed 3169 place invariants in 36 ms
[2022-05-19 23:20:19] [INFO ] Implicit Places using invariants in 5840 ms returned []
// Phase 1: matrix 501 rows 3668 cols
[2022-05-19 23:20:19] [INFO ] Computed 3169 place invariants in 47 ms
[2022-05-19 23:20:29] [INFO ] Implicit Places using invariants and state equation in 9976 ms returned [2284, 2285, 3311, 3312, 3313, 3314, 3315, 3316, 3317, 3318, 3641, 3644, 3645, 3646, 3647, 3648, 3649, 3650, 3651, 3652, 3653, 3654, 3655, 3656, 3657, 3658, 3659, 3660, 3661, 3662, 3663, 3664, 3665, 3666, 3667]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 15820 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3633/3705 places, 501/506 transitions.
Applied a total of 0 rules in 259 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3633/3705 places, 501/506 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s84 1)) (AND (GEQ s0 1) (GEQ s85 1)) (AND (GEQ s0 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s83 1)) (AND (GEQ s0 1) (GEQ s80 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-06 finished in 16791 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0) U p0))||(X(p1)&&G(p2))))'
Support contains 68 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 240 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:20:29] [INFO ] Computed 3201 place invariants in 35 ms
[2022-05-19 23:20:35] [INFO ] Implicit Places using invariants in 5946 ms returned []
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:20:35] [INFO ] Computed 3201 place invariants in 30 ms
[2022-05-19 23:20:49] [INFO ] Implicit Places using invariants and state equation in 14100 ms returned [2287, 2288]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 20050 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3705 places, 506/506 transitions.
Applied a total of 0 rules in 235 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3705 places, 506/506 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s84 1)) (AND (GEQ s0 1) (GEQ s85 1)) (AND (GEQ s0 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s83 1)) (AND (GEQ s0 1) (GEQ s80 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-32-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-07 finished in 20720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((!(p1 U p2)||G(!G(X(p3)))))))'
Support contains 38 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 233 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:20:50] [INFO ] Computed 3201 place invariants in 35 ms
[2022-05-19 23:20:53] [INFO ] Implicit Places using invariants in 3144 ms returned []
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:20:53] [INFO ] Computed 3201 place invariants in 28 ms
[2022-05-19 23:21:04] [INFO ] Implicit Places using invariants and state equation in 11494 ms returned [2287]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 14640 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3705 places, 506/506 transitions.
Applied a total of 0 rules in 227 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3704/3705 places, 506/506 transitions.
Stuttering acceptance computed with spot in 295 ms :[(AND p2 p3), (AND (NOT p0) p2 p3), (AND p2 p3), (AND (NOT p0) p3), (AND (NOT p0) p3), (AND (NOT p0) p3 p2), (AND p2 p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 p3), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2 p3), acceptance={} source=5 dest: 4}], [{ cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p2 p3)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=6 dest: 6}, { cond=(AND p2 p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LT s248 1), p2:(GEQ s101 1), p3:(AND (GEQ s1625 1) (GEQ s1626 1) (GEQ s1627 1) (GEQ s1629 1) (GEQ s1630 1) (GEQ s1631 1) (GEQ s1632 1) (GEQ s1633 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1034 ms.
Product exploration explored 100000 steps with 50000 reset in 1031 ms.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p0) p2))), (X (NOT (OR p1 p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p2 p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p2 p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR p1 p2)))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR p1 p2)))
Knowledge based reduction with 19 factoid took 338 ms. Reduced automaton from 7 states, 14 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-09 finished in 18351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p0)||p1))&&X(!(G(p0) U X(p1))))))'
Support contains 3 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 254 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:21:08] [INFO ] Computed 3201 place invariants in 30 ms
[2022-05-19 23:21:14] [INFO ] Implicit Places using invariants in 6000 ms returned []
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:21:14] [INFO ] Computed 3201 place invariants in 29 ms
[2022-05-19 23:21:26] [INFO ] Implicit Places using invariants and state equation in 11582 ms returned [2287, 2288]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17587 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3705 places, 506/506 transitions.
Applied a total of 0 rules in 248 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3705 places, 506/506 transitions.
Stuttering acceptance computed with spot in 478 ms :[(OR (NOT p0) p1), (NOT p0), (AND (NOT p1) (NOT p0)), p1, (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), false, (AND p0 p1), p1, false, (AND p1 (NOT p0)), (AND p1 p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(OR p1 p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 7}, { cond=(OR p1 p0), acceptance={0} source=3 dest: 8}, { cond=p0, acceptance={} source=3 dest: 9}, { cond=(OR p1 p0), acceptance={0, 1} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=5 dest: 10}, { cond=(AND p1 p0), acceptance={} source=5 dest: 11}, { cond=(AND p1 p0), acceptance={1} source=5 dest: 12}], [{ cond=p1, acceptance={0} source=6 dest: 2}, { cond=p1, acceptance={0, 1} source=6 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p1 p0), acceptance={} source=7 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=7 dest: 5}], [{ cond=p1, acceptance={0} source=8 dest: 2}], [{ cond=p0, acceptance={0} source=9 dest: 9}, { cond=p0, acceptance={0, 1} source=9 dest: 13}], [{ cond=p1, acceptance={0} source=10 dest: 8}, { cond=(AND p1 p0), acceptance={} source=10 dest: 9}, { cond=p1, acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=11 dest: 2}, { cond=(AND p1 p0), acceptance={} source=11 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=12 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=12 dest: 10}, { cond=(AND p1 p0), acceptance={} source=12 dest: 11}, { cond=(AND p1 p0), acceptance={1} source=12 dest: 12}], [{ cond=(AND p1 p0), acceptance={0} source=13 dest: 9}, { cond=(AND p1 p0), acceptance={0, 1} source=13 dest: 13}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s57 1)), p0:(GEQ s220 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-11 finished in 18591 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Graph (complete) has 40993 edges and 3705 vertex of which 3671 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.14 ms
Discarding 34 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 3668 transition count 501
Applied a total of 5 rules in 518 ms. Remains 3668 /3705 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3668 cols
[2022-05-19 23:21:27] [INFO ] Computed 3169 place invariants in 26 ms
[2022-05-19 23:21:33] [INFO ] Implicit Places using invariants in 5605 ms returned []
// Phase 1: matrix 501 rows 3668 cols
[2022-05-19 23:21:33] [INFO ] Computed 3169 place invariants in 29 ms
[2022-05-19 23:21:44] [INFO ] Implicit Places using invariants and state equation in 11811 ms returned [2284, 2285, 3311, 3312, 3313, 3314, 3315, 3316, 3317, 3318, 3641, 3644, 3645, 3646, 3647, 3648, 3649, 3650, 3651, 3652, 3653, 3654, 3655, 3656, 3657, 3658, 3659, 3660, 3661, 3662, 3663, 3664, 3665, 3666, 3667]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 17420 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3633/3705 places, 501/506 transitions.
Applied a total of 0 rules in 282 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3633/3705 places, 501/506 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-12 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 (LT s0 1) (LT s46 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 2459 reset in 352 ms.
Product exploration explored 100000 steps with 2465 reset in 389 ms.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
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 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-12 finished in 19639 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(G(p0))&&(p1 U p0)) U p2)))'
Support contains 37 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 226 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:21:46] [INFO ] Computed 3201 place invariants in 34 ms
[2022-05-19 23:21:52] [INFO ] Implicit Places using invariants in 5975 ms returned []
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:21:52] [INFO ] Computed 3201 place invariants in 33 ms
[2022-05-19 23:22:04] [INFO ] Implicit Places using invariants and state equation in 11630 ms returned [2288]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 17610 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3705 places, 506/506 transitions.
Applied a total of 0 rules in 235 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3704/3705 places, 506/506 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p2), true, (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p2 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1)), p2:(AND (GEQ s0 1) (GEQ s98 1)), p1:(AND (GEQ s2025 1) (GEQ s2026 1) (GEQ s2027 1) (GEQ s2028 1) (GEQ s2029 1) (GEQ s2030...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-32-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-13 finished in 18254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U p1) U (X(p2)&&(X(G(!p1))||G(!p1)))))'
Support contains 36 out of 3705 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Applied a total of 0 rules in 235 ms. Remains 3705 /3705 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:22:05] [INFO ] Computed 3201 place invariants in 37 ms
[2022-05-19 23:22:11] [INFO ] Implicit Places using invariants in 5953 ms returned []
// Phase 1: matrix 506 rows 3705 cols
[2022-05-19 23:22:11] [INFO ] Computed 3201 place invariants in 32 ms
[2022-05-19 23:22:23] [INFO ] Implicit Places using invariants and state equation in 12283 ms returned [2287, 2288]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18238 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3705 places, 506/506 transitions.
Applied a total of 0 rules in 232 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3703/3705 places, 506/506 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p2) p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 p1)), (OR (NOT p2) p1), true, (AND p1 (NOT p0)), (OR (NOT p1) p0), p1]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p1 p0) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 2}, { cond=(AND p1 p0), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LT s113 1), p0:(LT s220 1), p2:(AND (GEQ s83 1) (GEQ s2299 1) (GEQ s2328 1) (GEQ s2501 1) (GEQ s2534 1) (GEQ s2567 1) (GEQ s2596 1) (GEQ s2641 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-14 finished in 18956 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(G(p0))||X(F((F(p1)||p2))))))'
Support contains 37 out of 3705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3705/3705 places, 506/506 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 3703 transition count 504
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 3703 transition count 504
Applied a total of 3 rules in 770 ms. Remains 3703 /3705 variables (removed 2) and now considering 504/506 (removed 2) transitions.
// Phase 1: matrix 504 rows 3703 cols
[2022-05-19 23:22:24] [INFO ] Computed 3201 place invariants in 38 ms
[2022-05-19 23:22:30] [INFO ] Implicit Places using invariants in 5908 ms returned []
// Phase 1: matrix 504 rows 3703 cols
[2022-05-19 23:22:30] [INFO ] Computed 3201 place invariants in 32 ms
[2022-05-19 23:22:41] [INFO ] Implicit Places using invariants and state equation in 10567 ms returned [2286, 2287, 3313, 3314, 3315, 3316, 3317, 3318, 3319, 3320, 3676, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699, 3700, 3701, 3702]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 16482 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3668/3705 places, 504/506 transitions.
Applied a total of 0 rules in 265 ms. Remains 3668 /3668 variables (removed 0) and now considering 504/504 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3668/3705 places, 504/506 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s99 1)), p1:(AND (GEQ s220 1) (GEQ s3503 1) (GEQ s3504 1) (GEQ s3505 1) (GEQ s3506 1) (GEQ s3507 1) (GEQ s3508 1) (GEQ s3509 1) (G...], 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 43 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-15 finished in 17601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(X((G(p0)||p0)))||X(p1)))||G(!p0))))'
Found a SL insensitive property : QuasiCertifProtocol-PT-32-LTLFireability-01
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), false, false, false, false, p0]
Support contains 1123 out of 3705 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3705/3705 places, 506/506 transitions.
Graph (complete) has 40993 edges and 3705 vertex of which 3671 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.16 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3669 transition count 502
Applied a total of 3 rules in 274 ms. Remains 3669 /3705 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3669 cols
[2022-05-19 23:22:42] [INFO ] Computed 3169 place invariants in 42 ms
[2022-05-19 23:22:45] [INFO ] Implicit Places using invariants in 3907 ms returned []
// Phase 1: matrix 502 rows 3669 cols
[2022-05-19 23:22:45] [INFO ] Computed 3169 place invariants in 35 ms
[2022-05-19 23:22:53] [INFO ] Implicit Places using invariants and state equation in 7593 ms returned [2285, 2286, 3312, 3313, 3314, 3315, 3316, 3317, 3318, 3319, 3642, 3645, 3646, 3647, 3648, 3649, 3650, 3651, 3652, 3653, 3654, 3655, 3656, 3657, 3658, 3659, 3660, 3661, 3662, 3663, 3664, 3665, 3666, 3667, 3668]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 11509 ms to find 35 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3634/3705 places, 502/506 transitions.
Applied a total of 0 rules in 140 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 3634/3705 places, 502/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 3}], [{ cond=p0, acceptance={} source=7 dest: 0}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=5, aps=[p0:(LT s247 1), p1:(OR (AND (GEQ s8 1) (GEQ s440 1) (GEQ s441 1) (GEQ s442 1) (GEQ s443 1) (GEQ s444 1) (GEQ s445 1) (GEQ s476 1) (GEQ s477 1) (GEQ s478 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2462 reset in 583 ms.
Product exploration explored 100000 steps with 2465 reset in 594 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 343 ms. Reduced automaton from 8 states, 18 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 636168 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 636168 steps, saw 78323 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 23:23:00] [INFO ] Computed 3136 place invariants in 743 ms
[2022-05-19 23:23:02] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 726 ms returned sat
[2022-05-19 23:23:02] [INFO ] After 1340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 23:23:03] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 719 ms returned sat
[2022-05-19 23:23:11] [INFO ] After 8272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 23:23:20] [INFO ] After 16461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6945 ms.
[2022-05-19 23:23:27] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 253 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=25 )
Parikh walk visited 4 properties in 24 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 377 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1123 out of 3634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 106 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 23:23:28] [INFO ] Computed 3136 place invariants in 745 ms
[2022-05-19 23:23:32] [INFO ] Implicit Places using invariants in 4498 ms returned []
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 23:23:33] [INFO ] Computed 3136 place invariants in 760 ms
[2022-05-19 23:23:39] [INFO ] Implicit Places using invariants and state equation in 7068 ms returned []
Implicit Place search using SMT with State Equation took 11568 ms to find 0 implicit places.
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 23:23:40] [INFO ] Computed 3136 place invariants in 743 ms
[2022-05-19 23:23:41] [INFO ] Dead Transitions using invariants and state equation in 2121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3634/3634 places, 502/502 transitions.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 731250 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 731250 steps, saw 90271 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 23:23:47] [INFO ] Computed 3136 place invariants in 763 ms
[2022-05-19 23:23:48] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 730 ms returned sat
[2022-05-19 23:23:48] [INFO ] After 1335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 23:23:50] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 726 ms returned sat
[2022-05-19 23:23:58] [INFO ] After 8460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 23:24:06] [INFO ] After 16592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6902 ms.
[2022-05-19 23:24:13] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 253 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=23 )
Parikh walk visited 4 properties in 18 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2458 reset in 587 ms.
Product exploration explored 100000 steps with 2469 reset in 610 ms.
Built C files in :
/tmp/ltsmin1480428489962255812
[2022-05-19 23:24:15] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1480428489962255812
Running compilation step : cd /tmp/ltsmin1480428489962255812;'/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 2242 ms.
Running link step : cd /tmp/ltsmin1480428489962255812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1480428489962255812;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8584080444366398691.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1123 out of 3634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 112 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 23:24:31] [INFO ] Computed 3136 place invariants in 831 ms
[2022-05-19 23:24:33] [INFO ] Implicit Places using invariants in 2916 ms returned []
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 23:24:34] [INFO ] Computed 3136 place invariants in 763 ms
[2022-05-19 23:24:39] [INFO ] Implicit Places using invariants and state equation in 5733 ms returned []
Implicit Place search using SMT with State Equation took 8653 ms to find 0 implicit places.
// Phase 1: matrix 502 rows 3634 cols
[2022-05-19 23:24:40] [INFO ] Computed 3136 place invariants in 743 ms
[2022-05-19 23:24:41] [INFO ] Dead Transitions using invariants and state equation in 2107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3634/3634 places, 502/502 transitions.
Built C files in :
/tmp/ltsmin8996080872761718068
[2022-05-19 23:24:41] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8996080872761718068
Running compilation step : cd /tmp/ltsmin8996080872761718068;'/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 2259 ms.
Running link step : cd /tmp/ltsmin8996080872761718068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8996080872761718068;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14751943135247340258.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 23:24:57] [INFO ] Flatten gal took : 89 ms
[2022-05-19 23:24:57] [INFO ] Flatten gal took : 85 ms
[2022-05-19 23:24:57] [INFO ] Time to serialize gal into /tmp/LTL2262259681991461046.gal : 8 ms
[2022-05-19 23:24:57] [INFO ] Time to serialize properties into /tmp/LTL16793078251822608376.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2262259681991461046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16793078251822608376.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2262259...267
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(a4<1)"))||("(a4<1)"))))||(X("(((((((((((((c1_7>=1)&&(n9_4_7>=1))&&((n9_5_7>=1)&&(n9_2_7>=1)))&&(((n9_3_7>=1)&&(n9_0_...18393
Formula 0 simplified : !X(G(XX("(a4<1)" | G"(a4<1)") | X"(((((((((((((c1_7>=1)&&(n9_4_7>=1))&&((n9_5_7>=1)&&(n9_2_7>=1)))&&(((n9_3_7>=1)&&(n9_0_7>=1))&&((n...18374
Detected timeout of ITS tools.
[2022-05-19 23:25:12] [INFO ] Flatten gal took : 84 ms
[2022-05-19 23:25:12] [INFO ] Applying decomposition
[2022-05-19 23:25:12] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12954097525535250821.txt' '-o' '/tmp/graph12954097525535250821.bin' '-w' '/tmp/graph12954097525535250821.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12954097525535250821.bin' '-l' '-1' '-v' '-w' '/tmp/graph12954097525535250821.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:25:12] [INFO ] Decomposing Gal with order
[2022-05-19 23:25:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:25:13] [INFO ] Removed a total of 329 redundant transitions.
[2022-05-19 23:25:13] [INFO ] Flatten gal took : 302 ms
[2022-05-19 23:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 67 ms.
[2022-05-19 23:25:13] [INFO ] Time to serialize gal into /tmp/LTL14739714327552918047.gal : 17 ms
[2022-05-19 23:25:13] [INFO ] Time to serialize properties into /tmp/LTL6048728484255914422.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14739714327552918047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6048728484255914422.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1473971...246
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(i55.u73.a4<1)"))||("(i55.u73.a4<1)"))))||(X("(((((((((((((i62.u39.c1_7>=1)&&(u3.n9_4_7>=1))&&((u4.n9_5_7>=1)&&(u5.n9...22740
Formula 0 simplified : !X(G(XX("(i55.u73.a4<1)" | G"(i55.u73.a4<1)") | X"(((((((((((((i62.u39.c1_7>=1)&&(u3.n9_4_7>=1))&&((u4.n9_5_7>=1)&&(u5.n9_2_7>=1)))&...22721
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10796146035190974973
[2022-05-19 23:25:28] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10796146035190974973
Running compilation step : cd /tmp/ltsmin10796146035190974973;'/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 2269 ms.
Running link step : cd /tmp/ltsmin10796146035190974973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10796146035190974973;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-01 finished in 181983 ms.
[2022-05-19 23:25:43] [INFO ] Flatten gal took : 82 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6685627197405218920
[2022-05-19 23:25:43] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2022-05-19 23:25:43] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:25:43] [INFO ] Applying decomposition
[2022-05-19 23:25:43] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2022-05-19 23:25:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:25:43] [INFO ] Flatten gal took : 117 ms
[2022-05-19 23:25:43] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2022-05-19 23:25:43] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:25:43] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6685627197405218920
Running compilation step : cd /tmp/ltsmin6685627197405218920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14181491009421412179.txt' '-o' '/tmp/graph14181491009421412179.bin' '-w' '/tmp/graph14181491009421412179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14181491009421412179.bin' '-l' '-1' '-v' '-w' '/tmp/graph14181491009421412179.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:25:43] [INFO ] Decomposing Gal with order
[2022-05-19 23:25:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:25:44] [INFO ] Removed a total of 328 redundant transitions.
[2022-05-19 23:25:44] [INFO ] Flatten gal took : 277 ms
[2022-05-19 23:25:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 75 ms.
[2022-05-19 23:25:44] [INFO ] Time to serialize gal into /tmp/LTLFireability11698425326323198367.gal : 22 ms
[2022-05-19 23:25:44] [INFO ] Time to serialize properties into /tmp/LTLFireability13702812889276097538.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11698425326323198367.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13702812889276097538.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(i26.i1.u102.a4<1)"))||("(i26.i1.u102.a4<1)"))))||(X("(((((((((((((i40.u136.c1_7>=1)&&(u4.n9_4_7>=1))&&((u5.n9_5_7>=1...23116
Formula 0 simplified : !X(G(XX("(i26.i1.u102.a4<1)" | G"(i26.i1.u102.a4<1)") | X"(((((((((((((i40.u136.c1_7>=1)&&(u4.n9_4_7>=1))&&((u5.n9_5_7>=1)&&(u6.n9_2...23097
Compilation finished in 2763 ms.
Running link step : cd /tmp/ltsmin6685627197405218920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin6685627197405218920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: LTL layer: formula: X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))
pins2lts-mc-linux64( 5/ 8), 0.023: "X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.036: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.063: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.261: DFS-FIFO for weak LTL, using special progress label 509
pins2lts-mc-linux64( 0/ 8), 0.261: There are 510 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.262: State length is 3706, there are 524 groups
pins2lts-mc-linux64( 0/ 8), 0.262: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.262: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.262: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.262: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.702: ~1 levels ~960 states ~30360 transitions
pins2lts-mc-linux64( 3/ 8), 0.947: ~1 levels ~1920 states ~60120 transitions
pins2lts-mc-linux64( 0/ 8), 1.446: ~1 levels ~3840 states ~126896 transitions
pins2lts-mc-linux64( 6/ 8), 2.353: ~1 levels ~7680 states ~253600 transitions
pins2lts-mc-linux64( 6/ 8), 3.950: ~1 levels ~15360 states ~524120 transitions
pins2lts-mc-linux64( 1/ 8), 6.893: ~1 levels ~30720 states ~1015432 transitions
pins2lts-mc-linux64( 1/ 8), 12.018: ~1 levels ~61440 states ~1979256 transitions
pins2lts-mc-linux64( 1/ 8), 22.119: ~1 levels ~122880 states ~4021880 transitions
pins2lts-mc-linux64( 0/ 8), 44.188: ~1 levels ~245760 states ~8459072 transitions
pins2lts-mc-linux64( 7/ 8), 95.974: ~1 levels ~491520 states ~19836360 transitions
pins2lts-mc-linux64( 0/ 8), 131.201: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 132.292:
pins2lts-mc-linux64( 0/ 8), 132.292: mean standard work distribution: 4.4% (states) 1.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 132.292:
pins2lts-mc-linux64( 0/ 8), 132.292: Explored 593207 states 27813272 transitions, fanout: 46.886
pins2lts-mc-linux64( 0/ 8), 132.292: Total exploration time 132.020 sec (130.940 sec minimum, 131.296 sec on average)
pins2lts-mc-linux64( 0/ 8), 132.292: States per second: 4493, Transitions per second: 210675
pins2lts-mc-linux64( 0/ 8), 132.292:
pins2lts-mc-linux64( 0/ 8), 132.292: Progress states detected: 8157357
pins2lts-mc-linux64( 0/ 8), 132.292: Redundant explorations: -92.7280
pins2lts-mc-linux64( 0/ 8), 132.292:
pins2lts-mc-linux64( 0/ 8), 132.292: Queue width: 8B, total height: 10061062, memory: 76.76MB
pins2lts-mc-linux64( 0/ 8), 132.292: Tree memory: 318.2MB, 40.9 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 132.292: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 132.292: Stored 510 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 132.292: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 132.292: Est. total memory use: 395.0MB (~1100.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6685627197405218920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6685627197405218920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((X(X(([]((LTLAPp0==true))||(LTLAPp0==true))))||X((LTLAPp1==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 23:49:29] [INFO ] Flatten gal took : 752 ms
[2022-05-19 23:49:30] [INFO ] Time to serialize gal into /tmp/LTLFireability9729676355522630499.gal : 66 ms
[2022-05-19 23:49:30] [INFO ] Time to serialize properties into /tmp/LTLFireability10900705955708584204.ltl : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9729676355522630499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10900705955708584204.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((X((G((X(X((G("(a4<1)"))||("(a4<1)"))))||(X("(((((((((((((c1_7>=1)&&(n9_4_7>=1))&&((n9_5_7>=1)&&(n9_2_7>=1)))&&(((n9_3_7>=1)&&(n9_0_...18393
Formula 0 simplified : !X(G(XX("(a4<1)" | G"(a4<1)") | X"(((((((((((((c1_7>=1)&&(n9_4_7>=1))&&((n9_5_7>=1)&&(n9_2_7>=1)))&&(((n9_3_7>=1)&&(n9_0_7>=1))&&((n...18374
Detected timeout of ITS tools.
[2022-05-20 00:13:21] [INFO ] Flatten gal took : 1333 ms
[2022-05-20 00:13:23] [INFO ] Input system was already deterministic with 506 transitions.
[2022-05-20 00:13:23] [INFO ] Transformed 3705 places.
[2022-05-20 00:13:23] [INFO ] Transformed 506 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 00:13:24] [INFO ] Time to serialize gal into /tmp/LTLFireability12933846754737780777.gal : 31 ms
[2022-05-20 00:13:24] [INFO ] Time to serialize properties into /tmp/LTLFireability15396879382871189820.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12933846754737780777.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15396879382871189820.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G((X(X((G("(a4<1)"))||("(a4<1)"))))||(X("(((((((((((((c1_7>=1)&&(n9_4_7>=1))&&((n9_5_7>=1)&&(n9_2_7>=1)))&&(((n9_3_7>=1)&&(n9_0_...18393
Formula 0 simplified : !X(G(XX("(a4<1)" | G"(a4<1)") | X"(((((((((((((c1_7>=1)&&(n9_4_7>=1))&&((n9_5_7>=1)&&(n9_2_7>=1)))&&(((n9_3_7>=1)&&(n9_0_7>=1))&&((n...18374

BK_TIME_CONFINEMENT_REACHED

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

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

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