About the Execution of ITS-Tools for QuasiCertifProtocol-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3799.096 | 550043.00 | 1470002.00 | 7535.50 | FFTTFTTFFFFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r293-tall-167873946000876.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is QuasiCertifProtocol-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873946000876
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 30K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 235K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 01:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 01:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 262K Feb 26 01:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 01:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 149K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678992080949
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 18:41:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 18:41:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:41:22] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-16 18:41:22] [INFO ] Transformed 550 places.
[2023-03-16 18:41:22] [INFO ] Transformed 176 transitions.
[2023-03-16 18:41:22] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 354 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 25 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2023-03-16 18:41:23] [INFO ] Computed 350 place invariants in 36 ms
[2023-03-16 18:41:23] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-16 18:41:23] [INFO ] Invariant cache hit.
[2023-03-16 18:41:23] [INFO ] Implicit Places using invariants and state equation in 422 ms returned [303, 304, 311, 313, 314, 315, 316, 317, 318, 355]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 841 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/550 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 876 ms. Remains : 514/550 places, 176/176 transitions.
Support contains 354 out of 514 places after structural reductions.
[2023-03-16 18:41:24] [INFO ] Flatten gal took : 59 ms
[2023-03-16 18:41:24] [INFO ] Flatten gal took : 35 ms
[2023-03-16 18:41:24] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 691 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 24) seen :5
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 176 rows 514 cols
[2023-03-16 18:41:25] [INFO ] Computed 340 place invariants in 22 ms
[2023-03-16 18:41:25] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 46 ms returned sat
[2023-03-16 18:41:26] [INFO ] After 297ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:16
[2023-03-16 18:41:26] [INFO ] After 372ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:16
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-16 18:41:26] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:16
[2023-03-16 18:41:26] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 51 ms returned sat
[2023-03-16 18:41:27] [INFO ] After 759ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :17
[2023-03-16 18:41:28] [INFO ] After 1495ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :17
Attempting to minimize the solution found.
Minimization took 524 ms.
[2023-03-16 18:41:28] [INFO ] After 2462ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :17
Fused 18 Parikh solutions to 16 different solutions.
Finished Parikh walk after 83 steps, including 0 resets, run visited all 7 properties in 4 ms. (steps per millisecond=20 )
Parikh walk visited 17 properties in 24 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&G(p1)))))'
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 27 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 18:41:29] [INFO ] Invariant cache hit.
[2023-03-16 18:41:29] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-16 18:41:29] [INFO ] Invariant cache hit.
[2023-03-16 18:41:30] [INFO ] Implicit Places using invariants and state equation in 574 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 899 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 936 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s77 1), p0:(LT s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6925 reset in 260 ms.
Product exploration explored 100000 steps with 6923 reset in 200 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471 steps, run visited all 1 properties in 9 ms. (steps per millisecond=52 )
Probabilistic random walk after 471 steps, saw 448 distinct states, run finished after 9 ms. (steps per millisecond=52 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 235 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-16 18:41:32] [INFO ] Computed 340 place invariants in 62 ms
[2023-03-16 18:41:32] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-16 18:41:32] [INFO ] Invariant cache hit.
[2023-03-16 18:41:33] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2023-03-16 18:41:33] [INFO ] Invariant cache hit.
[2023-03-16 18:41:33] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1277 ms. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471 steps, run visited all 1 properties in 5 ms. (steps per millisecond=94 )
Probabilistic random walk after 471 steps, saw 448 distinct states, run finished after 6 ms. (steps per millisecond=78 ) properties seen :1
Knowledge obtained : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6924 reset in 231 ms.
Product exploration explored 100000 steps with 6923 reset in 153 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 346 are kept as prefixes of interest. Removing 167 places using SCC suffix rule.6 ms
Discarding 167 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 346 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 346 transition count 130
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 24 rules in 45 ms. Remains 346 /513 variables (removed 167) and now considering 130/176 (removed 46) transitions.
[2023-03-16 18:41:35] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 130 rows 346 cols
[2023-03-16 18:41:35] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-16 18:41:35] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 346/513 places, 130/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 346/513 places, 130/176 transitions.
Built C files in :
/tmp/ltsmin15981104247489642066
[2023-03-16 18:41:35] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15981104247489642066
Running compilation step : cd /tmp/ltsmin15981104247489642066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 514 ms.
Running link step : cd /tmp/ltsmin15981104247489642066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15981104247489642066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16807700085088168545.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-16 18:41:50] [INFO ] Computed 340 place invariants in 29 ms
[2023-03-16 18:41:51] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-16 18:41:51] [INFO ] Invariant cache hit.
[2023-03-16 18:41:51] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2023-03-16 18:41:51] [INFO ] Invariant cache hit.
[2023-03-16 18:41:51] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1313 ms. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin11928762876015798617
[2023-03-16 18:41:51] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11928762876015798617
Running compilation step : cd /tmp/ltsmin11928762876015798617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 387 ms.
Running link step : cd /tmp/ltsmin11928762876015798617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11928762876015798617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2212321300109938718.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 18:42:07] [INFO ] Flatten gal took : 22 ms
[2023-03-16 18:42:07] [INFO ] Flatten gal took : 38 ms
[2023-03-16 18:42:07] [INFO ] Time to serialize gal into /tmp/LTL7259802460185709561.gal : 7 ms
[2023-03-16 18:42:07] [INFO ] Time to serialize properties into /tmp/LTL15676548085313130605.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7259802460185709561.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10229326432023058428.hoa' '-atoms' '/tmp/LTL15676548085313130605.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15676548085313130605.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10229326432023058428.hoa
Detected timeout of ITS tools.
[2023-03-16 18:42:22] [INFO ] Flatten gal took : 19 ms
[2023-03-16 18:42:22] [INFO ] Flatten gal took : 18 ms
[2023-03-16 18:42:22] [INFO ] Time to serialize gal into /tmp/LTL3380695015183742847.gal : 3 ms
[2023-03-16 18:42:22] [INFO ] Time to serialize properties into /tmp/LTL11609070738545921791.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3380695015183742847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11609070738545921791.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(a2<1)")))&&(G("(a4<1)"))))))
Formula 0 simplified : XXF(!"(a4<1)" | GF!"(a2<1)")
Detected timeout of ITS tools.
[2023-03-16 18:42:37] [INFO ] Flatten gal took : 36 ms
[2023-03-16 18:42:37] [INFO ] Applying decomposition
[2023-03-16 18:42:37] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13386982871150458988.txt' '-o' '/tmp/graph13386982871150458988.bin' '-w' '/tmp/graph13386982871150458988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13386982871150458988.bin' '-l' '-1' '-v' '-w' '/tmp/graph13386982871150458988.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:42:37] [INFO ] Decomposing Gal with order
[2023-03-16 18:42:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:42:37] [INFO ] Removed a total of 108 redundant transitions.
[2023-03-16 18:42:37] [INFO ] Flatten gal took : 151 ms
[2023-03-16 18:42:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 34 ms.
[2023-03-16 18:42:38] [INFO ] Time to serialize gal into /tmp/LTL11002372505777484292.gal : 543 ms
[2023-03-16 18:42:39] [INFO ] Time to serialize properties into /tmp/LTL8430351171799399578.ltl : 607 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11002372505777484292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8430351171799399578.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(i15.i0.u24.a2<1)")))&&(G("(i15.i0.u25.a4<1)"))))))
Formula 0 simplified : XXF(!"(i15.i0.u25.a4<1)" | GF!"(i15.i0.u24.a2<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3930496785656480658
[2023-03-16 18:42:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3930496785656480658
Running compilation step : cd /tmp/ltsmin3930496785656480658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin3930496785656480658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin3930496785656480658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp0==true)))&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-00 finished in 99985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 23 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2023-03-16 18:43:09] [INFO ] Computed 340 place invariants in 13 ms
[2023-03-16 18:43:09] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-16 18:43:09] [INFO ] Invariant cache hit.
[2023-03-16 18:43:10] [INFO ] Implicit Places using invariants and state equation in 586 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1004 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1028 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s87 1) (GEQ s468 1) (GEQ s469 1) (GEQ s470 1) (GEQ s471 1) (GEQ s472 1) (GEQ s473 1) (GEQ s474 1) (GEQ s475 1) (GEQ s476 1) (GEQ s478 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-01 finished in 1183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 18:43:10] [INFO ] Invariant cache hit.
[2023-03-16 18:43:10] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-16 18:43:10] [INFO ] Invariant cache hit.
[2023-03-16 18:43:11] [INFO ] Implicit Places using invariants and state equation in 564 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 976 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1000 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s484 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 15390 reset in 236 ms.
Product exploration explored 100000 steps with 15393 reset in 307 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-03 finished in 1879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G((G(F(!p1)) U p2)))||p0)))'
Support contains 45 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 18:43:12] [INFO ] Invariant cache hit.
[2023-03-16 18:43:12] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-16 18:43:12] [INFO ] Invariant cache hit.
[2023-03-16 18:43:13] [INFO ] Implicit Places using invariants and state equation in 529 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 852 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 875 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), p1, p1, (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 2}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s70 1) (GEQ s480 1)) (AND (GEQ s68 1) (GEQ s421 1)) (AND (GEQ s72 1) (GEQ s425 1)) (AND (GEQ s69 1) (GEQ s481 1)) (AND (GEQ s81 1) (GEQ s...], 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]]
Stuttering criterion allowed to conclude after 2518 steps with 175 reset in 12 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-04 finished in 1085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G(((p2||X(p0))&&p1))))'
Support contains 276 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 18:43:13] [INFO ] Invariant cache hit.
[2023-03-16 18:43:13] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-16 18:43:13] [INFO ] Invariant cache hit.
[2023-03-16 18:43:14] [INFO ] Implicit Places using invariants and state equation in 411 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 610 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 615 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (LT s10 1) (LT s174 1) (LT s175 1) (LT s176 1) (LT s177 1) (LT s194 1) (LT s195 1) (LT s197 1) (LT s198 1) (LT s199 1) (LT s200 1) (LT s201 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6931 reset in 331 ms.
Product exploration explored 100000 steps with 6921 reset in 339 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (X (NOT p0))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 446 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 513 cols
[2023-03-16 18:43:16] [INFO ] Computed 340 place invariants in 21 ms
[2023-03-16 18:43:16] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 44 ms returned sat
[2023-03-16 18:43:16] [INFO ] After 236ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 18:43:16] [INFO ] After 419ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-16 18:43:16] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (X (NOT p0))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 486 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 276 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 18:43:17] [INFO ] Invariant cache hit.
[2023-03-16 18:43:17] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-16 18:43:17] [INFO ] Invariant cache hit.
[2023-03-16 18:43:18] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2023-03-16 18:43:18] [INFO ] Invariant cache hit.
[2023-03-16 18:43:18] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 745 ms. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (AND p2 (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 (NOT p0) p1))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 371 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:43:19] [INFO ] Invariant cache hit.
[2023-03-16 18:43:19] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 49 ms returned sat
[2023-03-16 18:43:19] [INFO ] After 362ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 18:43:19] [INFO ] After 500ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:43:19] [INFO ] After 655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:43:19] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 46 ms returned sat
[2023-03-16 18:43:20] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:43:20] [INFO ] After 511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-16 18:43:20] [INFO ] After 787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (AND p2 (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 (NOT p0) p1))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 349 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 816 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 6920 reset in 323 ms.
Product exploration explored 100000 steps with 6925 reset in 333 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 276 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.8 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 501 transition count 176
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 25 ms. Remains 501 /513 variables (removed 12) and now considering 176/176 (removed 0) transitions.
[2023-03-16 18:43:22] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 176 rows 501 cols
[2023-03-16 18:43:22] [INFO ] Computed 330 place invariants in 16 ms
[2023-03-16 18:43:23] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/513 places, 176/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 501/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin3332670128546837257
[2023-03-16 18:43:23] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3332670128546837257
Running compilation step : cd /tmp/ltsmin3332670128546837257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 415 ms.
Running link step : cd /tmp/ltsmin3332670128546837257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin3332670128546837257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6892192185638657211.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 276 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-16 18:43:38] [INFO ] Computed 340 place invariants in 24 ms
[2023-03-16 18:43:38] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-16 18:43:38] [INFO ] Invariant cache hit.
[2023-03-16 18:43:38] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2023-03-16 18:43:38] [INFO ] Invariant cache hit.
[2023-03-16 18:43:39] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 798 ms. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin5834904524511961363
[2023-03-16 18:43:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5834904524511961363
Running compilation step : cd /tmp/ltsmin5834904524511961363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin5834904524511961363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin5834904524511961363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8617834379695779853.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 18:43:54] [INFO ] Flatten gal took : 16 ms
[2023-03-16 18:43:54] [INFO ] Flatten gal took : 16 ms
[2023-03-16 18:43:54] [INFO ] Time to serialize gal into /tmp/LTL5964190763732862564.gal : 2 ms
[2023-03-16 18:43:54] [INFO ] Time to serialize properties into /tmp/LTL3406027338563751882.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5964190763732862564.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11868031468282893764.hoa' '-atoms' '/tmp/LTL3406027338563751882.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3406027338563751882.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11868031468282893764.hoa
Detected timeout of ITS tools.
[2023-03-16 18:44:09] [INFO ] Flatten gal took : 24 ms
[2023-03-16 18:44:09] [INFO ] Flatten gal took : 15 ms
[2023-03-16 18:44:09] [INFO ] Time to serialize gal into /tmp/LTL11783191596483640661.gal : 4 ms
[2023-03-16 18:44:09] [INFO ] Time to serialize properties into /tmp/LTL13290465237654227257.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11783191596483640661.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13290465237654227257.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(((((a1>=1)&&(n2_8>=1))&&((n2_7>=1)&&(n2_10>=1)))&&(((n2_9>=1)&&(n2_4>=1))&&((n2_3>=1)&&(n2_6>=1))))&&(((n2_5>=1)&&(n2_0>=1...4067
Formula 0 simplified : XXG!"(((((a1>=1)&&(n2_8>=1))&&((n2_7>=1)&&(n2_10>=1)))&&(((n2_9>=1)&&(n2_4>=1))&&((n2_3>=1)&&(n2_6>=1))))&&(((n2_5>=1)&&(n2_0>=1))&&...4049
Detected timeout of ITS tools.
[2023-03-16 18:44:24] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:44:24] [INFO ] Applying decomposition
[2023-03-16 18:44:24] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2244037703145012781.txt' '-o' '/tmp/graph2244037703145012781.bin' '-w' '/tmp/graph2244037703145012781.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2244037703145012781.bin' '-l' '-1' '-v' '-w' '/tmp/graph2244037703145012781.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:44:24] [INFO ] Decomposing Gal with order
[2023-03-16 18:44:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:44:24] [INFO ] Removed a total of 109 redundant transitions.
[2023-03-16 18:44:24] [INFO ] Flatten gal took : 37 ms
[2023-03-16 18:44:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 11 ms.
[2023-03-16 18:44:24] [INFO ] Time to serialize gal into /tmp/LTL8198024272369133662.gal : 5 ms
[2023-03-16 18:44:24] [INFO ] Time to serialize properties into /tmp/LTL8732898161497335234.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8198024272369133662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8732898161497335234.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(((((i11.u53.a1>=1)&&(i10.i1.u34.n2_8>=1))&&((i22.i0.u27.n2_7>=1)&&(i7.i1.u49.n2_10>=1)))&&(((i13.i0.u33.n2_9>=1)&&(i12.u36...5297
Formula 0 simplified : XXG!"(((((i11.u53.a1>=1)&&(i10.i1.u34.n2_8>=1))&&((i22.i0.u27.n2_7>=1)&&(i7.i1.u49.n2_10>=1)))&&(((i13.i0.u33.n2_9>=1)&&(i12.u36.n2_...5279
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1931320782989370974
[2023-03-16 18:44:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1931320782989370974
Running compilation step : cd /tmp/ltsmin1931320782989370974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 421 ms.
Running link step : cd /tmp/ltsmin1931320782989370974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1931320782989370974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(<>((LTLAPp0==true))))||[]((((LTLAPp2==true)||X((LTLAPp0==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-05 finished in 101254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&X(p0)))))'
Support contains 23 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2023-03-16 18:44:54] [INFO ] Computed 340 place invariants in 8 ms
[2023-03-16 18:44:55] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-16 18:44:55] [INFO ] Invariant cache hit.
[2023-03-16 18:44:55] [INFO ] Implicit Places using invariants and state equation in 506 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 824 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 842 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s68 1)) (AND (GEQ s0 1) (GEQ s69 1)) (AND (GEQ s0 1) (GEQ s81 1)) (AND (GEQ s0 1) (GEQ s67 1)) (AND (GEQ s0 1) (GEQ s79 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 10 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-07 finished in 1020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 18:44:55] [INFO ] Invariant cache hit.
[2023-03-16 18:44:56] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-16 18:44:56] [INFO ] Invariant cache hit.
[2023-03-16 18:44:56] [INFO ] Implicit Places using invariants and state equation in 564 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 910 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 923 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s63 1) (GEQ s467 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-08 finished in 1008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F(p1))||(G(p3)&&p2))))'
Support contains 27 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-16 18:44:56] [INFO ] Invariant cache hit.
[2023-03-16 18:44:57] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-16 18:44:57] [INFO ] Invariant cache hit.
[2023-03-16 18:44:57] [INFO ] Implicit Places using invariants and state equation in 545 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 873 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 883 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s57 1) (GEQ s464 1)), p2:(AND (GEQ s75 1) (GEQ s452 1) (GEQ s453 1) (GEQ s454 1) (GEQ s455 1) (GEQ s459 1) (GEQ s485 1) (GEQ s486 1) (GEQ s48...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-09 finished in 1016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 500 transition count 172
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 500 transition count 172
Applied a total of 4 rules in 40 ms. Remains 500 /514 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 500 cols
[2023-03-16 18:44:57] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-16 18:44:58] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-16 18:44:58] [INFO ] Invariant cache hit.
[2023-03-16 18:44:58] [INFO ] Implicit Places using invariants and state equation in 474 ms returned [307, 419, 420, 421, 422, 423, 424, 476, 479, 480, 481, 482]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 838 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/514 places, 172/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 488 /488 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 894 ms. Remains : 488/514 places, 172/176 transitions.
Stuttering acceptance computed with spot in 477 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s77 1)), p1:(OR (LT s49 1) (LT s484 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-11 finished in 1390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&F((!p1&&X(G(p2))))))))'
Support contains 25 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2023-03-16 18:44:59] [INFO ] Computed 340 place invariants in 3 ms
[2023-03-16 18:44:59] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-16 18:44:59] [INFO ] Invariant cache hit.
[2023-03-16 18:45:00] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2023-03-16 18:45:00] [INFO ] Invariant cache hit.
[2023-03-16 18:45:00] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1101 ms. Remains : 514/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 290 ms :[p0, p0, p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s331 1) (GEQ s340 1) (GEQ s343 1) (GEQ s363 1) (GEQ s368 1) (GEQ s386 1) (GEQ s394 1) (GEQ s399 1) (GEQ s419 1) (GEQ s434 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]]
Product exploration explored 100000 steps with 6921 reset in 157 ms.
Product exploration explored 100000 steps with 6924 reset in 168 ms.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 14 factoid took 441 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-13 finished in 2277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(!p1))))'
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 359 are kept as prefixes of interest. Removing 155 places using SCC suffix rule.5 ms
Discarding 155 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 358 transition count 130
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 358 transition count 130
Applied a total of 24 rules in 27 ms. Remains 358 /514 variables (removed 156) and now considering 130/176 (removed 46) transitions.
// Phase 1: matrix 130 rows 358 cols
[2023-03-16 18:45:01] [INFO ] Computed 230 place invariants in 1 ms
[2023-03-16 18:45:01] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-16 18:45:01] [INFO ] Invariant cache hit.
[2023-03-16 18:45:01] [INFO ] Implicit Places using invariants and state equation in 302 ms returned [165, 268, 269, 270, 271, 272, 273, 323, 326, 327, 328, 329]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 547 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 346/514 places, 130/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 346 /346 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 584 ms. Remains : 346/514 places, 130/176 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LT s53 1), p0:(GEQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-14 finished in 655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 499 transition count 171
Applied a total of 5 rules in 23 ms. Remains 499 /514 variables (removed 15) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 499 cols
[2023-03-16 18:45:02] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-16 18:45:02] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-16 18:45:02] [INFO ] Invariant cache hit.
[2023-03-16 18:45:02] [INFO ] Implicit Places using invariants and state equation in 463 ms returned [306, 418, 419, 420, 421, 422, 423, 475, 478, 479, 480, 481]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 812 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/514 places, 171/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 847 ms. Remains : 487/514 places, 171/176 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-15 finished in 954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&G(p1)))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-10-LTLFireability-00
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 347 are kept as prefixes of interest. Removing 167 places using SCC suffix rule.1 ms
Discarding 167 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 346 transition count 128
Applied a total of 23 rules in 12 ms. Remains 346 /514 variables (removed 168) and now considering 128/176 (removed 48) transitions.
// Phase 1: matrix 128 rows 346 cols
[2023-03-16 18:45:03] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-16 18:45:03] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-16 18:45:03] [INFO ] Invariant cache hit.
[2023-03-16 18:45:03] [INFO ] Implicit Places using invariants and state equation in 286 ms returned [164, 267, 268, 269, 270, 271, 272, 322, 325, 326, 327, 328]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 508 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 334/514 places, 128/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 334 /334 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 528 ms. Remains : 334/514 places, 128/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s54 1), p0:(LT s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6638 reset in 156 ms.
Product exploration explored 100000 steps with 6645 reset in 170 ms.
Computed a total of 334 stabilizing places and 128 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 334 transition count 128
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 749 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10002 steps, including 617 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 483 steps, run visited all 1 properties in 10 ms. (steps per millisecond=48 )
Probabilistic random walk after 483 steps, saw 461 distinct states, run finished after 11 ms. (steps per millisecond=43 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 264 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 334 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 334 /334 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 334 cols
[2023-03-16 18:45:05] [INFO ] Computed 210 place invariants in 1 ms
[2023-03-16 18:45:05] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-16 18:45:05] [INFO ] Invariant cache hit.
[2023-03-16 18:45:06] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-16 18:45:06] [INFO ] Invariant cache hit.
[2023-03-16 18:45:06] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 620 ms. Remains : 334/334 places, 128/128 transitions.
Computed a total of 334 stabilizing places and 128 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 334 transition count 128
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 : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 618 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 483 steps, run visited all 1 properties in 4 ms. (steps per millisecond=120 )
Probabilistic random walk after 483 steps, saw 461 distinct states, run finished after 4 ms. (steps per millisecond=120 ) properties seen :1
Knowledge obtained : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6632 reset in 149 ms.
Product exploration explored 100000 steps with 6640 reset in 174 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 334 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 334/334 places, 128/128 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 334 transition count 129
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 13 ms. Remains 334 /334 variables (removed 0) and now considering 129/128 (removed -1) transitions.
[2023-03-16 18:45:07] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 129 rows 334 cols
[2023-03-16 18:45:07] [INFO ] Computed 210 place invariants in 2 ms
[2023-03-16 18:45:07] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 334/334 places, 129/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 334/334 places, 129/128 transitions.
Built C files in :
/tmp/ltsmin757450648903048490
[2023-03-16 18:45:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin757450648903048490
Running compilation step : cd /tmp/ltsmin757450648903048490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 270 ms.
Running link step : cd /tmp/ltsmin757450648903048490;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin757450648903048490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17123597861057586981.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 334 /334 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 334 cols
[2023-03-16 18:45:22] [INFO ] Computed 210 place invariants in 3 ms
[2023-03-16 18:45:23] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-16 18:45:23] [INFO ] Invariant cache hit.
[2023-03-16 18:45:23] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-16 18:45:23] [INFO ] Invariant cache hit.
[2023-03-16 18:45:23] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 334/334 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin15057266785605416388
[2023-03-16 18:45:23] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15057266785605416388
Running compilation step : cd /tmp/ltsmin15057266785605416388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 285 ms.
Running link step : cd /tmp/ltsmin15057266785605416388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15057266785605416388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3513034053743847473.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 18:45:38] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:45:38] [INFO ] Flatten gal took : 6 ms
[2023-03-16 18:45:38] [INFO ] Time to serialize gal into /tmp/LTL3378088332573752029.gal : 17 ms
[2023-03-16 18:45:38] [INFO ] Time to serialize properties into /tmp/LTL5130508727512309105.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3378088332573752029.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6154854687874274584.hoa' '-atoms' '/tmp/LTL5130508727512309105.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5130508727512309105.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6154854687874274584.hoa
Detected timeout of ITS tools.
[2023-03-16 18:45:53] [INFO ] Flatten gal took : 8 ms
[2023-03-16 18:45:53] [INFO ] Flatten gal took : 6 ms
[2023-03-16 18:45:53] [INFO ] Time to serialize gal into /tmp/LTL15817401781108177346.gal : 2 ms
[2023-03-16 18:45:53] [INFO ] Time to serialize properties into /tmp/LTL18261876087705628541.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15817401781108177346.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18261876087705628541.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(a2<1)")))&&(G("(a4<1)"))))))
Formula 0 simplified : XXF(!"(a4<1)" | GF!"(a2<1)")
Detected timeout of ITS tools.
[2023-03-16 18:46:08] [INFO ] Flatten gal took : 7 ms
[2023-03-16 18:46:08] [INFO ] Applying decomposition
[2023-03-16 18:46:08] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9304380356522420842.txt' '-o' '/tmp/graph9304380356522420842.bin' '-w' '/tmp/graph9304380356522420842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9304380356522420842.bin' '-l' '-1' '-v' '-w' '/tmp/graph9304380356522420842.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:46:08] [INFO ] Decomposing Gal with order
[2023-03-16 18:46:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:46:08] [INFO ] Removed a total of 70 redundant transitions.
[2023-03-16 18:46:08] [INFO ] Flatten gal took : 23 ms
[2023-03-16 18:46:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 5 ms.
[2023-03-16 18:46:08] [INFO ] Time to serialize gal into /tmp/LTL2698266535261776272.gal : 3 ms
[2023-03-16 18:46:08] [INFO ] Time to serialize properties into /tmp/LTL15191769307422062826.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2698266535261776272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15191769307422062826.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(i11.u17.a2<1)")))&&(G("(i11.u14.a4<1)"))))))
Formula 0 simplified : XXF(!"(i11.u14.a4<1)" | GF!"(i11.u17.a2<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11213336162162140260
[2023-03-16 18:46:23] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11213336162162140260
Running compilation step : cd /tmp/ltsmin11213336162162140260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 260 ms.
Running link step : cd /tmp/ltsmin11213336162162140260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11213336162162140260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp0==true)))&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 12593 ms.
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-00 finished in 93858 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G(((p2||X(p0))&&p1))))'
Found a Shortening insensitive property : QuasiCertifProtocol-PT-10-LTLFireability-05
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 276 out of 514 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 500 transition count 172
Applied a total of 5 rules in 18 ms. Remains 500 /514 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 500 cols
[2023-03-16 18:46:37] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-16 18:46:37] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-16 18:46:37] [INFO ] Invariant cache hit.
[2023-03-16 18:46:37] [INFO ] Implicit Places using invariants and state equation in 356 ms returned [306]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 576 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 499/514 places, 172/176 transitions.
Applied a total of 0 rules in 21 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 616 ms. Remains : 499/514 places, 172/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (LT s10 1) (LT s171 1) (LT s172 1) (LT s173 1) (LT s174 1) (LT s191 1) (LT s192 1) (LT s194 1) (LT s195 1) (LT s196 1) (LT s197 1) (LT s198 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6924 reset in 309 ms.
Product exploration explored 100000 steps with 6919 reset in 330 ms.
Computed a total of 499 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 499 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (X (NOT p0))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 353 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 689 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 172 rows 499 cols
[2023-03-16 18:46:39] [INFO ] Computed 330 place invariants in 19 ms
[2023-03-16 18:46:39] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 48 ms returned sat
[2023-03-16 18:46:39] [INFO ] After 312ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 18:46:39] [INFO ] After 485ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-16 18:46:40] [INFO ] After 841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:46:40] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 46 ms returned sat
[2023-03-16 18:46:40] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:46:40] [INFO ] After 525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-16 18:46:40] [INFO ] After 780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (X (NOT p0))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 494 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 276 out of 499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 499/499 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-16 18:46:41] [INFO ] Invariant cache hit.
[2023-03-16 18:46:41] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-16 18:46:41] [INFO ] Invariant cache hit.
[2023-03-16 18:46:42] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2023-03-16 18:46:42] [INFO ] Invariant cache hit.
[2023-03-16 18:46:42] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 724 ms. Remains : 499/499 places, 172/172 transitions.
Computed a total of 499 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 499 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (AND p2 (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 (NOT p0) p1))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 317 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:46:43] [INFO ] Invariant cache hit.
[2023-03-16 18:46:43] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 48 ms returned sat
[2023-03-16 18:46:43] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 18:46:43] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 48 ms returned sat
[2023-03-16 18:46:44] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 18:46:44] [INFO ] After 425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-16 18:46:44] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (AND p2 (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 (NOT p0) p1))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 481 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 6924 reset in 300 ms.
Product exploration explored 100000 steps with 6924 reset in 307 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 276 out of 499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 499/499 places, 172/172 transitions.
Applied a total of 0 rules in 11 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-16 18:46:46] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-16 18:46:46] [INFO ] Invariant cache hit.
[2023-03-16 18:46:46] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 499/499 places, 172/172 transitions.
Built C files in :
/tmp/ltsmin14494961592917498080
[2023-03-16 18:46:46] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14494961592917498080
Running compilation step : cd /tmp/ltsmin14494961592917498080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 445 ms.
Running link step : cd /tmp/ltsmin14494961592917498080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14494961592917498080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13590150327548695017.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 276 out of 499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 499/499 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-16 18:47:01] [INFO ] Invariant cache hit.
[2023-03-16 18:47:01] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-16 18:47:01] [INFO ] Invariant cache hit.
[2023-03-16 18:47:02] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-16 18:47:02] [INFO ] Invariant cache hit.
[2023-03-16 18:47:02] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 499/499 places, 172/172 transitions.
Built C files in :
/tmp/ltsmin13922680804621059946
[2023-03-16 18:47:02] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13922680804621059946
Running compilation step : cd /tmp/ltsmin13922680804621059946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 446 ms.
Running link step : cd /tmp/ltsmin13922680804621059946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13922680804621059946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17368516392603097630.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 18:47:17] [INFO ] Flatten gal took : 11 ms
[2023-03-16 18:47:17] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:47:17] [INFO ] Time to serialize gal into /tmp/LTL411534953041570766.gal : 2 ms
[2023-03-16 18:47:17] [INFO ] Time to serialize properties into /tmp/LTL15340414801018652108.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL411534953041570766.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11152805658994434987.hoa' '-atoms' '/tmp/LTL15340414801018652108.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15340414801018652108.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11152805658994434987.hoa
Detected timeout of ITS tools.
[2023-03-16 18:47:32] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:47:32] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:47:32] [INFO ] Time to serialize gal into /tmp/LTL769416658153797715.gal : 2 ms
[2023-03-16 18:47:32] [INFO ] Time to serialize properties into /tmp/LTL17583433562186697246.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL769416658153797715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17583433562186697246.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(((((a1>=1)&&(n2_8>=1))&&((n2_7>=1)&&(n2_10>=1)))&&(((n2_9>=1)&&(n2_4>=1))&&((n2_3>=1)&&(n2_6>=1))))&&(((n2_5>=1)&&(n2_0>=1...4067
Formula 0 simplified : XXG!"(((((a1>=1)&&(n2_8>=1))&&((n2_7>=1)&&(n2_10>=1)))&&(((n2_9>=1)&&(n2_4>=1))&&((n2_3>=1)&&(n2_6>=1))))&&(((n2_5>=1)&&(n2_0>=1))&&...4049
Detected timeout of ITS tools.
[2023-03-16 18:47:47] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:47:47] [INFO ] Applying decomposition
[2023-03-16 18:47:47] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3680482666958959017.txt' '-o' '/tmp/graph3680482666958959017.bin' '-w' '/tmp/graph3680482666958959017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3680482666958959017.bin' '-l' '-1' '-v' '-w' '/tmp/graph3680482666958959017.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:47:47] [INFO ] Decomposing Gal with order
[2023-03-16 18:47:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:47:47] [INFO ] Removed a total of 121 redundant transitions.
[2023-03-16 18:47:47] [INFO ] Flatten gal took : 24 ms
[2023-03-16 18:47:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 9 ms.
[2023-03-16 18:47:47] [INFO ] Time to serialize gal into /tmp/LTL10594839413666833874.gal : 3 ms
[2023-03-16 18:47:47] [INFO ] Time to serialize properties into /tmp/LTL208347892734284178.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10594839413666833874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL208347892734284178.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(((((i14.u51.a1>=1)&&(i22.u32.n2_8>=1))&&((i20.u44.n2_7>=1)&&(i13.u45.n2_10>=1)))&&(((i12.u46.n2_9>=1)&&(i14.u26.n2_4>=1))&...5152
Formula 0 simplified : XXG!"(((((i14.u51.a1>=1)&&(i22.u32.n2_8>=1))&&((i20.u44.n2_7>=1)&&(i13.u45.n2_10>=1)))&&(((i12.u46.n2_9>=1)&&(i14.u26.n2_4>=1))&&((i...5134
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin99805739959072283
[2023-03-16 18:48:02] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin99805739959072283
Running compilation step : cd /tmp/ltsmin99805739959072283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 412 ms.
Running link step : cd /tmp/ltsmin99805739959072283;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin99805739959072283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(<>((LTLAPp0==true))))||[]((((LTLAPp2==true)||X((LTLAPp0==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-05 finished in 101021 ms.
[2023-03-16 18:48:17] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6409795978972444264
[2023-03-16 18:48:17] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2023-03-16 18:48:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:48:17] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2023-03-16 18:48:17] [INFO ] Applying decomposition
[2023-03-16 18:48:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:48:17] [INFO ] Flatten gal took : 14 ms
[2023-03-16 18:48:17] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2023-03-16 18:48:17] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 18:48:17] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6409795978972444264
Running compilation step : cd /tmp/ltsmin6409795978972444264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13987979565657046925.txt' '-o' '/tmp/graph13987979565657046925.bin' '-w' '/tmp/graph13987979565657046925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13987979565657046925.bin' '-l' '-1' '-v' '-w' '/tmp/graph13987979565657046925.weights' '-q' '0' '-e' '0.001'
[2023-03-16 18:48:18] [INFO ] Decomposing Gal with order
[2023-03-16 18:48:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 18:48:18] [INFO ] Removed a total of 109 redundant transitions.
[2023-03-16 18:48:18] [INFO ] Flatten gal took : 100 ms
[2023-03-16 18:48:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 6 ms.
[2023-03-16 18:48:18] [INFO ] Time to serialize gal into /tmp/LTLFireability817875919293726842.gal : 4 ms
[2023-03-16 18:48:18] [INFO ] Time to serialize properties into /tmp/LTLFireability18088388917310900732.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability817875919293726842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18088388917310900732.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("(((((i14.u34.a1>=1)&&(i19.i0.u31.n2_8>=1))&&((i18.i0.u27.n2_7>=1)&&(i11.i0.u33.n2_10>=1)))&&(((i9.i1.u47.n2_9>=1)&&(i12.u48...5397
Formula 0 simplified : XXG!"(((((i14.u34.a1>=1)&&(i19.i0.u31.n2_8>=1))&&((i18.i0.u27.n2_7>=1)&&(i11.i0.u33.n2_10>=1)))&&(((i9.i1.u47.n2_9>=1)&&(i12.u48.n2_...5379
Compilation finished in 732 ms.
Running link step : cd /tmp/ltsmin6409795978972444264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6409795978972444264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(<>((LTLAPp2==true))))||[]((((LTLAPp4==true)||X((LTLAPp2==true)))&&(LTLAPp3==true))))' '--buchi-type=spotba'
LTSmin run took 125551 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 541826 ms.
BK_STOP 1678992630992
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="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-5348"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873946000876"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;