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-167873946000899.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-28, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873946000899
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 80K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 452K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:27 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 46K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 106K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 644K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 218K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K 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 749K 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-28-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679000127491

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-16 20:55:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 20:55:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:55:29] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-16 20:55:29] [INFO ] Transformed 2998 places.
[2023-03-16 20:55:29] [INFO ] Transformed 446 transitions.
[2023-03-16 20:55:29] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1146 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Applied a total of 0 rules in 170 ms. Remains 2998 /2998 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2998 cols
[2023-03-16 20:55:29] [INFO ] Computed 2553 place invariants in 135 ms
[2023-03-16 20:55:34] [INFO ] Implicit Places using invariants in 4374 ms returned []
[2023-03-16 20:55:34] [INFO ] Invariant cache hit.
[2023-03-16 20:55:51] [INFO ] Implicit Places using invariants and state equation in 16833 ms returned []
Implicit Place search using SMT with State Equation took 21233 ms to find 0 implicit places.
[2023-03-16 20:55:51] [INFO ] Invariant cache hit.
[2023-03-16 20:55:52] [INFO ] Dead Transitions using invariants and state equation in 1548 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22961 ms. Remains : 2998/2998 places, 446/446 transitions.
Support contains 1146 out of 2998 places after structural reductions.
[2023-03-16 20:55:52] [INFO ] Flatten gal took : 186 ms
[2023-03-16 20:55:53] [INFO ] Flatten gal took : 111 ms
[2023-03-16 20:55:53] [INFO ] Input system was already deterministic with 446 transitions.
Support contains 1118 out of 2998 places (down from 1146) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 22) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-16 20:55:53] [INFO ] Invariant cache hit.
[2023-03-16 20:55:55] [INFO ] [Real]Absence check using 32 positive place invariants in 39 ms returned sat
[2023-03-16 20:55:55] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 527 ms returned sat
[2023-03-16 20:55:55] [INFO ] After 1844ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-16 20:55:56] [INFO ] [Nat]Absence check using 32 positive place invariants in 47 ms returned sat
[2023-03-16 20:55:57] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 549 ms returned sat
[2023-03-16 20:56:20] [INFO ] After 22099ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :13
[2023-03-16 20:56:20] [INFO ] After 22103ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :13
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 20:56:20] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :13
Fused 19 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 5 ms.
Support contains 1000 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2997 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2997 transition count 444
Applied a total of 3 rules in 152 ms. Remains 2997 /2998 variables (removed 1) and now considering 444/446 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 2997/2998 places, 444/446 transitions.
Incomplete random walk after 10000 steps, including 312 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 466874 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 466874 steps, saw 63644 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 444 rows 2997 cols
[2023-03-16 20:56:24] [INFO ] Computed 2554 place invariants in 52 ms
[2023-03-16 20:56:25] [INFO ] After 849ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 20:56:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 44 ms returned sat
[2023-03-16 20:56:27] [INFO ] [Nat]Absence check using 31 positive and 2523 generalized place invariants in 521 ms returned sat
[2023-03-16 20:56:50] [INFO ] After 22926ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-16 20:56:50] [INFO ] After 22935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-16 20:56:50] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 971 out of 2997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2997/2997 places, 444/444 transitions.
Applied a total of 0 rules in 257 ms. Remains 2997 /2997 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 2997/2997 places, 444/444 transitions.
Incomplete random walk after 10000 steps, including 310 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 544548 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 544548 steps, saw 74242 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-16 20:56:54] [INFO ] Invariant cache hit.
[2023-03-16 20:56:55] [INFO ] After 811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 20:56:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 43 ms returned sat
[2023-03-16 20:56:56] [INFO ] [Nat]Absence check using 31 positive and 2523 generalized place invariants in 596 ms returned sat
[2023-03-16 20:57:20] [INFO ] After 22864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-16 20:57:20] [INFO ] After 22874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-16 20:57:20] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 971 out of 2997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2997/2997 places, 444/444 transitions.
Applied a total of 0 rules in 123 ms. Remains 2997 /2997 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 2997/2997 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2997/2997 places, 444/444 transitions.
Applied a total of 0 rules in 106 ms. Remains 2997 /2997 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-16 20:57:20] [INFO ] Invariant cache hit.
[2023-03-16 20:57:32] [INFO ] Implicit Places using invariants in 11607 ms returned [215, 219]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11625 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2995/2997 places, 444/444 transitions.
Applied a total of 0 rules in 123 ms. Remains 2995 /2995 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11855 ms. Remains : 2995/2997 places, 444/444 transitions.
Incomplete random walk after 10000 steps, including 313 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 538581 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 538581 steps, saw 73407 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 444 rows 2995 cols
[2023-03-16 20:57:36] [INFO ] Computed 2552 place invariants in 43 ms
[2023-03-16 20:57:37] [INFO ] After 796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 20:57:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 40 ms returned sat
[2023-03-16 20:57:38] [INFO ] [Nat]Absence check using 31 positive and 2521 generalized place invariants in 474 ms returned sat
[2023-03-16 20:58:00] [INFO ] After 21094ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :8
[2023-03-16 20:58:02] [INFO ] After 23102ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 20:58:02] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :7
Fused 12 Parikh solutions to 8 different solutions.
Finished Parikh walk after 191 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=38 )
Parikh walk visited 8 properties in 60 ms.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2998 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2998 transition count 446
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(G(p0)))'
Support contains 900 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 2965 transition count 446
Applied a total of 33 rules in 133 ms. Remains 2965 /2998 variables (removed 33) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2965 cols
[2023-03-16 20:58:02] [INFO ] Computed 2521 place invariants in 25 ms
[2023-03-16 20:58:05] [INFO ] Implicit Places using invariants in 3074 ms returned []
[2023-03-16 20:58:05] [INFO ] Invariant cache hit.
[2023-03-16 20:58:14] [INFO ] Implicit Places using invariants and state equation in 8719 ms returned [1998, 1999, 2001, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026, 2027, 2034, 2035, 2036, 2037, 2038, 2039, 2040, 2041]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11801 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Applied a total of 0 rules in 236 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12171 ms. Remains : 2936/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-02 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:(OR (GT (ADD s1914 s1915 s1916 s1917 s1918 s1919 s1920 s1921 s1922 s1923 s1924 s1925 s1926 s1927 s1928 s1929 s1930 s1931 s1932 s1933 s1934 s1935 s1936 ...], 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 3 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-02 finished in 12468 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 30 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2937 transition count 446
Applied a total of 61 rules in 147 ms. Remains 2937 /2998 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2023-03-16 20:58:15] [INFO ] Computed 2492 place invariants in 44 ms
[2023-03-16 20:58:19] [INFO ] Implicit Places using invariants in 4029 ms returned []
[2023-03-16 20:58:19] [INFO ] Invariant cache hit.
[2023-03-16 20:58:26] [INFO ] Implicit Places using invariants and state equation in 7393 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11425 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2998 places, 446/446 transitions.
Applied a total of 0 rules in 137 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11712 ms. Remains : 2908/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-03 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:(LEQ (ADD s2754 s2755 s2756 s2757 s2758 s2759 s2760 s2761 s2762 s2763 s2764 s2765 s2766 s2767 s2768 s2769 s2770 s2771 s2772 s2773 s2774 s2775 s2776 s27...], 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]]
Product exploration explored 100000 steps with 3027 reset in 572 ms.
Product exploration explored 100000 steps with 3023 reset in 438 ms.
Computed a total of 2908 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2908 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1390917 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :{}
Probabilistic random walk after 1390917 steps, saw 175732 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 446 rows 2908 cols
[2023-03-16 20:58:31] [INFO ] Computed 2464 place invariants in 93 ms
[2023-03-16 20:58:32] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:58:32] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 531 ms returned sat
[2023-03-16 20:58:34] [INFO ] After 1002ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:58:34] [INFO ] After 1110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-16 20:58:34] [INFO ] After 2095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 66 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 2908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2908/2908 places, 446/446 transitions.
Applied a total of 0 rules in 141 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-16 20:58:34] [INFO ] Invariant cache hit.
[2023-03-16 20:58:38] [INFO ] Implicit Places using invariants in 3987 ms returned []
[2023-03-16 20:58:38] [INFO ] Invariant cache hit.
[2023-03-16 20:58:46] [INFO ] Implicit Places using invariants and state equation in 7379 ms returned []
Implicit Place search using SMT with State Equation took 11369 ms to find 0 implicit places.
[2023-03-16 20:58:46] [INFO ] Invariant cache hit.
[2023-03-16 20:58:47] [INFO ] Dead Transitions using invariants and state equation in 1072 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12589 ms. Remains : 2908/2908 places, 446/446 transitions.
Computed a total of 2908 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2908 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1427934 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :{}
Probabilistic random walk after 1427934 steps, saw 180589 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:58:51] [INFO ] Invariant cache hit.
[2023-03-16 20:58:51] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:58:52] [INFO ] [Nat]Absence check using 0 positive and 2464 generalized place invariants in 537 ms returned sat
[2023-03-16 20:58:53] [INFO ] After 917ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:58:53] [INFO ] After 1046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-16 20:58:53] [INFO ] After 2024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 65 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3026 reset in 398 ms.
Product exploration explored 100000 steps with 3025 reset in 422 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 2908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2908/2908 places, 446/446 transitions.
Graph (complete) has 28339 edges and 2908 vertex of which 2067 are kept as prefixes of interest. Removing 841 places using SCC suffix rule.18 ms
Discarding 841 places :
Also discarding 0 output transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2010 transition count 332
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2010 transition count 332
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 117 place count 2010 transition count 334
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 117 rules in 476 ms. Remains 2010 /2908 variables (removed 898) and now considering 334/446 (removed 112) transitions.
[2023-03-16 20:58:55] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 334 rows 2010 cols
[2023-03-16 20:58:55] [INFO ] Computed 1680 place invariants in 27 ms
[2023-03-16 20:58:56] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2010/2908 places, 334/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1294 ms. Remains : 2010/2908 places, 334/446 transitions.
Built C files in :
/tmp/ltsmin2050814999188086891
[2023-03-16 20:58:56] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2050814999188086891
Running compilation step : cd /tmp/ltsmin2050814999188086891;'/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 1893 ms.
Running link step : cd /tmp/ltsmin2050814999188086891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2050814999188086891;'/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/stateBased8120699265952602456.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 2908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2908/2908 places, 446/446 transitions.
Applied a total of 0 rules in 176 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2908 cols
[2023-03-16 20:59:11] [INFO ] Computed 2464 place invariants in 70 ms
[2023-03-16 20:59:15] [INFO ] Implicit Places using invariants in 4120 ms returned []
[2023-03-16 20:59:15] [INFO ] Invariant cache hit.
[2023-03-16 20:59:22] [INFO ] Implicit Places using invariants and state equation in 7008 ms returned []
Implicit Place search using SMT with State Equation took 11130 ms to find 0 implicit places.
[2023-03-16 20:59:22] [INFO ] Invariant cache hit.
[2023-03-16 20:59:23] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12405 ms. Remains : 2908/2908 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin139845393753447418
[2023-03-16 20:59:24] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin139845393753447418
Running compilation step : cd /tmp/ltsmin139845393753447418;'/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 1827 ms.
Running link step : cd /tmp/ltsmin139845393753447418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin139845393753447418;'/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/stateBased17743378316696492355.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 20:59:39] [INFO ] Flatten gal took : 71 ms
[2023-03-16 20:59:39] [INFO ] Flatten gal took : 83 ms
[2023-03-16 20:59:39] [INFO ] Time to serialize gal into /tmp/LTL14774436980772638773.gal : 15 ms
[2023-03-16 20:59:39] [INFO ] Time to serialize properties into /tmp/LTL995401906428228343.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/LTL14774436980772638773.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10136778856596971506.hoa' '-atoms' '/tmp/LTL995401906428228343.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/LTL995401906428228343.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10136778856596971506.hoa
Detected timeout of ITS tools.
[2023-03-16 20:59:54] [INFO ] Flatten gal took : 101 ms
[2023-03-16 20:59:54] [INFO ] Flatten gal took : 134 ms
[2023-03-16 20:59:54] [INFO ] Time to serialize gal into /tmp/LTL4234363823857446696.gal : 12 ms
[2023-03-16 20:59:54] [INFO ] Time to serialize properties into /tmp/LTL14084533557382796504.ltl : 16 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/LTL4234363823857446696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14084533557382796504.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(G("((((((n6_18+n6_17)+(n6_16+n6_15))+((n6_14+n6_13)+(n6_12+n6_11)))+(((n6_10+n6_9)+(n6_8+n6_7))+((n6_6+n6_5)+(n6_4+n6_3))))+((((n...264
Formula 0 simplified : XF!"((((((n6_18+n6_17)+(n6_16+n6_15))+((n6_14+n6_13)+(n6_12+n6_11)))+(((n6_10+n6_9)+(n6_8+n6_7))+((n6_6+n6_5)+(n6_4+n6_3))))+((((n6_...258
Detected timeout of ITS tools.
[2023-03-16 21:00:09] [INFO ] Flatten gal took : 65 ms
[2023-03-16 21:00:09] [INFO ] Applying decomposition
[2023-03-16 21:00:09] [INFO ] Flatten gal took : 64 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/graph13239756589974219120.txt' '-o' '/tmp/graph13239756589974219120.bin' '-w' '/tmp/graph13239756589974219120.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13239756589974219120.bin' '-l' '-1' '-v' '-w' '/tmp/graph13239756589974219120.weights' '-q' '0' '-e' '0.001'
[2023-03-16 21:00:10] [INFO ] Decomposing Gal with order
[2023-03-16 21:00:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 21:00:10] [INFO ] Removed a total of 302 redundant transitions.
[2023-03-16 21:00:10] [INFO ] Flatten gal took : 444 ms
[2023-03-16 21:00:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 424 labels/synchronizations in 240 ms.
[2023-03-16 21:00:11] [INFO ] Time to serialize gal into /tmp/LTL9800441023212536276.gal : 29 ms
[2023-03-16 21:00:11] [INFO ] Time to serialize properties into /tmp/LTL7794361327448756880.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/LTL9800441023212536276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7794361327448756880.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(G("((((((gu81.n6_18+gu81.n6_17)+(gu81.n6_16+gu81.n6_15))+((gu81.n6_14+gu81.n6_13)+(gu81.n6_12+gu81.n6_11)))+(((gu81.n6_10+gu81.n6...414
Formula 0 simplified : XF!"((((((gu81.n6_18+gu81.n6_17)+(gu81.n6_16+gu81.n6_15))+((gu81.n6_14+gu81.n6_13)+(gu81.n6_12+gu81.n6_11)))+(((gu81.n6_10+gu81.n6_9...408
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8856278436183034178
[2023-03-16 21:00:26] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8856278436183034178
Running compilation step : cd /tmp/ltsmin8856278436183034178;'/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 1890 ms.
Running link step : cd /tmp/ltsmin8856278436183034178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8856278436183034178;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-03 finished in 146930 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(G(p0)))'
Support contains 58 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2964 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.11 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2961 transition count 441
Applied a total of 5 rules in 447 ms. Remains 2961 /2998 variables (removed 37) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2961 cols
[2023-03-16 21:00:42] [INFO ] Computed 2522 place invariants in 13 ms
[2023-03-16 21:00:46] [INFO ] Implicit Places using invariants in 3954 ms returned []
[2023-03-16 21:00:46] [INFO ] Invariant cache hit.
[2023-03-16 21:00:57] [INFO ] Implicit Places using invariants and state equation in 10658 ms returned [1995, 1996, 1998, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2031, 2032, 2033, 2034, 2035, 2036, 2037, 2038, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2622, 2623, 2624, 2625, 2626, 2627, 2628, 2629, 2630, 2635, 2636, 2637, 2638, 2868, 2869, 2870, 2871, 2872, 2873, 2874, 2875, 2882]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 14621 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2903/2998 places, 441/446 transitions.
Applied a total of 0 rules in 191 ms. Remains 2903 /2903 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15261 ms. Remains : 2903/2998 places, 441/446 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s2758 s2759 s2760 s2761 s2762 s2763 s2764 s2765 s2766 s2767 s2768 s2769 s2770 s2771 s2772 s2773 s2774 s2775 s2776 s2777 s2778 s2779 s2780 s278...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-04 finished in 15352 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(G(p0)))'
Support contains 29 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2065 are kept as prefixes of interest. Removing 933 places using SCC suffix rule.7 ms
Discarding 933 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 29 place count 2036 transition count 387
Iterating global reduction 0 with 28 rules applied. Total rules applied 57 place count 2036 transition count 387
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 61 place count 2034 transition count 385
Applied a total of 61 rules in 283 ms. Remains 2034 /2998 variables (removed 964) and now considering 385/446 (removed 61) transitions.
// Phase 1: matrix 385 rows 2034 cols
[2023-03-16 21:00:57] [INFO ] Computed 1680 place invariants in 7 ms
[2023-03-16 21:00:59] [INFO ] Implicit Places using invariants in 2250 ms returned []
[2023-03-16 21:00:59] [INFO ] Invariant cache hit.
[2023-03-16 21:01:03] [INFO ] Implicit Places using invariants and state equation in 3683 ms returned [1097, 1098, 1100, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1133, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1737, 1738, 1739, 1740, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1955]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 5936 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1976/2998 places, 385/446 transitions.
Applied a total of 0 rules in 109 ms. Remains 1976 /1976 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6342 ms. Remains : 1976/2998 places, 385/446 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 (ADD s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2813 reset in 416 ms.
Product exploration explored 100000 steps with 2816 reset in 455 ms.
Computed a total of 1976 stabilizing places and 385 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1976 transition count 385
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-05 finished in 7736 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)))'
Support contains 29 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 156 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 21:01:05] [INFO ] Computed 2492 place invariants in 39 ms
[2023-03-16 21:01:09] [INFO ] Implicit Places using invariants in 4133 ms returned []
[2023-03-16 21:01:09] [INFO ] Invariant cache hit.
[2023-03-16 21:01:16] [INFO ] Implicit Places using invariants and state equation in 7140 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11310 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 places, 446/446 transitions.
Applied a total of 0 rules in 137 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11603 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 90 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s29 s30 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-07 finished in 11712 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)))'
Support contains 2 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 157 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
[2023-03-16 21:01:17] [INFO ] Invariant cache hit.
[2023-03-16 21:01:21] [INFO ] Implicit Places using invariants in 4224 ms returned []
[2023-03-16 21:01:21] [INFO ] Invariant cache hit.
[2023-03-16 21:01:28] [INFO ] Implicit Places using invariants and state equation in 7469 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11704 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 places, 446/446 transitions.
Applied a total of 0 rules in 147 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12008 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s2752 s2838)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7401 reset in 391 ms.
Product exploration explored 100000 steps with 7353 reset in 513 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-08 finished in 13690 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||G(p1)))))'
Support contains 4 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2939 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.10 ms
Discarding 59 places :
Also discarding 0 output 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 2937 transition count 444
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 2937 transition count 444
Applied a total of 4 rules in 756 ms. Remains 2937 /2998 variables (removed 61) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 2937 cols
[2023-03-16 21:01:31] [INFO ] Computed 2495 place invariants in 50 ms
[2023-03-16 21:01:36] [INFO ] Implicit Places using invariants in 4761 ms returned []
[2023-03-16 21:01:36] [INFO ] Invariant cache hit.
[2023-03-16 21:01:47] [INFO ] Implicit Places using invariants and state equation in 11293 ms returned [1971, 1972, 1974, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2603, 2604, 2605, 2606, 2611, 2612, 2613, 2614, 2841, 2842, 2843, 2844, 2845, 2846, 2847, 2848, 2855]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 16074 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2879/2998 places, 444/446 transitions.
Applied a total of 0 rules in 192 ms. Remains 2879 /2879 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17028 ms. Remains : 2879/2998 places, 444/446 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s1118 s57), p0:(LEQ s217 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2814 reset in 428 ms.
Product exploration explored 100000 steps with 2810 reset in 388 ms.
Computed a total of 2879 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2879 transition count 444
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 210 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-10 finished in 18639 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((!p0||G(F(!p0)))))'
Support contains 2 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 221 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2023-03-16 21:01:49] [INFO ] Computed 2492 place invariants in 35 ms
[2023-03-16 21:01:53] [INFO ] Implicit Places using invariants in 4112 ms returned []
[2023-03-16 21:01:53] [INFO ] Invariant cache hit.
[2023-03-16 21:02:01] [INFO ] Implicit Places using invariants and state equation in 8122 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12246 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 places, 446/446 transitions.
Applied a total of 0 rules in 214 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12685 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 180 ms :[p0, p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s26 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-11 finished in 12888 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)||G(F(p1)))))'
Support contains 5 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2937 transition count 446
Applied a total of 61 rules in 235 ms. Remains 2937 /2998 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2023-03-16 21:02:02] [INFO ] Computed 2493 place invariants in 22 ms
[2023-03-16 21:02:06] [INFO ] Implicit Places using invariants in 4260 ms returned []
[2023-03-16 21:02:06] [INFO ] Invariant cache hit.
[2023-03-16 21:02:13] [INFO ] Implicit Places using invariants and state equation in 7164 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 11436 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2909/2998 places, 446/446 transitions.
Applied a total of 0 rules in 219 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11891 ms. Remains : 2909/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT 1 s29) (GT s1978 s211)), p1:(GT s2754 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3021 reset in 305 ms.
Product exploration explored 100000 steps with 3021 reset in 341 ms.
Computed a total of 2909 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2909 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 349 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 302 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 997485 steps, run timeout after 3010 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 997485 steps, saw 126627 distinct states, run finished after 3012 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 446 rows 2909 cols
[2023-03-16 21:02:18] [INFO ] Computed 2465 place invariants in 24 ms
[2023-03-16 21:02:19] [INFO ] [Real]Absence check using 0 positive and 2465 generalized place invariants in 517 ms returned sat
[2023-03-16 21:02:19] [INFO ] After 1016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:02:20] [INFO ] [Nat]Absence check using 0 positive and 2465 generalized place invariants in 516 ms returned sat
[2023-03-16 21:02:26] [INFO ] After 5458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:02:27] [INFO ] After 6137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 807 ms.
[2023-03-16 21:02:27] [INFO ] After 7949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=48 )
Parikh walk visited 3 properties in 19 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 387 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 205 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-16 21:02:28] [INFO ] Invariant cache hit.
[2023-03-16 21:02:32] [INFO ] Implicit Places using invariants in 3788 ms returned []
[2023-03-16 21:02:32] [INFO ] Invariant cache hit.
[2023-03-16 21:02:42] [INFO ] Implicit Places using invariants and state equation in 9274 ms returned []
Implicit Place search using SMT with State Equation took 13084 ms to find 0 implicit places.
[2023-03-16 21:02:42] [INFO ] Invariant cache hit.
[2023-03-16 21:02:43] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14340 ms. Remains : 2909/2909 places, 446/446 transitions.
Computed a total of 2909 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2909 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 326 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 924922 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :{}
Probabilistic random walk after 924922 steps, saw 117842 distinct states, run finished after 3003 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:02:47] [INFO ] Invariant cache hit.
[2023-03-16 21:02:48] [INFO ] [Real]Absence check using 0 positive and 2465 generalized place invariants in 541 ms returned sat
[2023-03-16 21:02:48] [INFO ] After 1039ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:02:49] [INFO ] [Nat]Absence check using 0 positive and 2465 generalized place invariants in 495 ms returned sat
[2023-03-16 21:02:54] [INFO ] After 5182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:02:55] [INFO ] After 6584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 742 ms.
[2023-03-16 21:02:56] [INFO ] After 8367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 196 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=28 )
Parikh walk visited 3 properties in 7 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 429 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3025 reset in 310 ms.
Product exploration explored 100000 steps with 3023 reset in 325 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 2909 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Graph (complete) has 28340 edges and 2909 vertex of which 2879 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.12 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 2 place count 2879 transition count 445
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 468 ms. Remains 2879 /2909 variables (removed 30) and now considering 445/446 (removed 1) transitions.
[2023-03-16 21:02:58] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 445 rows 2879 cols
[2023-03-16 21:02:58] [INFO ] Computed 2437 place invariants in 13 ms
[2023-03-16 21:02:59] [INFO ] Dead Transitions using invariants and state equation in 1089 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2879/2909 places, 445/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1613 ms. Remains : 2879/2909 places, 445/446 transitions.
Built C files in :
/tmp/ltsmin1590811326842748342
[2023-03-16 21:02:59] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1590811326842748342
Running compilation step : cd /tmp/ltsmin1590811326842748342;'/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 1749 ms.
Running link step : cd /tmp/ltsmin1590811326842748342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1590811326842748342;'/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/stateBased10492733192653905412.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 2909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2909/2909 places, 446/446 transitions.
Applied a total of 0 rules in 222 ms. Remains 2909 /2909 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2909 cols
[2023-03-16 21:03:15] [INFO ] Computed 2465 place invariants in 22 ms
[2023-03-16 21:03:18] [INFO ] Implicit Places using invariants in 3765 ms returned []
[2023-03-16 21:03:18] [INFO ] Invariant cache hit.
[2023-03-16 21:03:27] [INFO ] Implicit Places using invariants and state equation in 8842 ms returned []
Implicit Place search using SMT with State Equation took 12629 ms to find 0 implicit places.
[2023-03-16 21:03:27] [INFO ] Invariant cache hit.
[2023-03-16 21:03:28] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13930 ms. Remains : 2909/2909 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin10767181113155166699
[2023-03-16 21:03:28] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10767181113155166699
Running compilation step : cd /tmp/ltsmin10767181113155166699;'/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 1727 ms.
Running link step : cd /tmp/ltsmin10767181113155166699;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10767181113155166699;'/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/stateBased16959742407307842715.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 21:03:44] [INFO ] Flatten gal took : 84 ms
[2023-03-16 21:03:44] [INFO ] Flatten gal took : 76 ms
[2023-03-16 21:03:44] [INFO ] Time to serialize gal into /tmp/LTL4546807992206880705.gal : 11 ms
[2023-03-16 21:03:44] [INFO ] Time to serialize properties into /tmp/LTL12700505823108205803.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/LTL4546807992206880705.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16698348098100968811.hoa' '-atoms' '/tmp/LTL12700505823108205803.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/LTL12700505823108205803.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16698348098100968811.hoa
Detected timeout of ITS tools.
[2023-03-16 21:03:59] [INFO ] Flatten gal took : 57 ms
[2023-03-16 21:03:59] [INFO ] Flatten gal took : 69 ms
[2023-03-16 21:03:59] [INFO ] Time to serialize gal into /tmp/LTL12725990536559348967.gal : 22 ms
[2023-03-16 21:03:59] [INFO ] Time to serialize properties into /tmp/LTL646096915971005192.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/LTL12725990536559348967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL646096915971005192.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((G("((s6_0<1)||(Cstart_24>a4))"))||(G(F("(SstopOK_26>malicious_reservoir)"))))))
Formula 0 simplified : X(F!"((s6_0<1)||(Cstart_24>a4))" & FG!"(SstopOK_26>malicious_reservoir)")
Detected timeout of ITS tools.
[2023-03-16 21:04:14] [INFO ] Flatten gal took : 57 ms
[2023-03-16 21:04:14] [INFO ] Applying decomposition
[2023-03-16 21:04:14] [INFO ] Flatten gal took : 78 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/graph12764240035198193381.txt' '-o' '/tmp/graph12764240035198193381.bin' '-w' '/tmp/graph12764240035198193381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12764240035198193381.bin' '-l' '-1' '-v' '-w' '/tmp/graph12764240035198193381.weights' '-q' '0' '-e' '0.001'
[2023-03-16 21:04:14] [INFO ] Decomposing Gal with order
[2023-03-16 21:04:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 21:04:15] [INFO ] Removed a total of 291 redundant transitions.
[2023-03-16 21:04:15] [INFO ] Flatten gal took : 224 ms
[2023-03-16 21:04:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 475 labels/synchronizations in 130 ms.
[2023-03-16 21:04:15] [INFO ] Time to serialize gal into /tmp/LTL8260435535590876470.gal : 25 ms
[2023-03-16 21:04:15] [INFO ] Time to serialize properties into /tmp/LTL14461669300731227623.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/LTL8260435535590876470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14461669300731227623.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((G("((gi2.gi0.gi0.gu0.s6_0<1)||(gu76.Cstart_24>gu76.a4))"))||(G(F("(gu87.SstopOK_26>gu87.malicious_reservoir)"))))))
Formula 0 simplified : X(F!"((gi2.gi0.gi0.gu0.s6_0<1)||(gu76.Cstart_24>gu76.a4))" & FG!"(gu87.SstopOK_26>gu87.malicious_reservoir)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16575907754886987981
[2023-03-16 21:04:30] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16575907754886987981
Running compilation step : cd /tmp/ltsmin16575907754886987981;'/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 1793 ms.
Running link step : cd /tmp/ltsmin16575907754886987981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16575907754886987981;'/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(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-12 finished in 163957 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)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-28-LTLCardinality-03
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2096 are kept as prefixes of interest. Removing 902 places using SCC suffix rule.24 ms
Discarding 902 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2038 transition count 331
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2038 transition count 331
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 119 place count 2036 transition count 329
Applied a total of 119 rules in 421 ms. Remains 2036 /2998 variables (removed 962) and now considering 329/446 (removed 117) transitions.
// Phase 1: matrix 329 rows 2036 cols
[2023-03-16 21:04:46] [INFO ] Computed 1708 place invariants in 22 ms
[2023-03-16 21:04:49] [INFO ] Implicit Places using invariants in 2443 ms returned []
[2023-03-16 21:04:49] [INFO ] Invariant cache hit.
[2023-03-16 21:04:55] [INFO ] Implicit Places using invariants and state equation in 6282 ms returned [1069, 1070, 1072, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1709, 1710, 1711, 1712, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1954]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 8739 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1978/2998 places, 329/446 transitions.
Applied a total of 0 rules in 118 ms. Remains 1978 /1978 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 9279 ms. Remains : 1978/2998 places, 329/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-03 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:(LEQ (ADD s1833 s1834 s1835 s1836 s1837 s1838 s1839 s1840 s1841 s1842 s1843 s1844 s1845 s1846 s1847 s1848 s1849 s1850 s1851 s1852 s1853 s1854 s1855 s18...], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2812 reset in 433 ms.
Product exploration explored 100000 steps with 2810 reset in 455 ms.
Computed a total of 1978 stabilizing places and 329 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1978 transition count 329
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 282 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1909221 steps, run timeout after 3001 ms. (steps per millisecond=636 ) properties seen :{}
Probabilistic random walk after 1909221 steps, saw 247367 distinct states, run finished after 3001 ms. (steps per millisecond=636 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 329 rows 1978 cols
[2023-03-16 21:05:00] [INFO ] Computed 1652 place invariants in 25 ms
[2023-03-16 21:05:00] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:05:00] [INFO ] [Nat]Absence check using 0 positive and 1652 generalized place invariants in 308 ms returned sat
[2023-03-16 21:05:01] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:05:01] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-16 21:05:01] [INFO ] After 1202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 1978 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1978/1978 places, 329/329 transitions.
Applied a total of 0 rules in 99 ms. Remains 1978 /1978 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2023-03-16 21:05:01] [INFO ] Invariant cache hit.
[2023-03-16 21:05:04] [INFO ] Implicit Places using invariants in 2152 ms returned []
[2023-03-16 21:05:04] [INFO ] Invariant cache hit.
[2023-03-16 21:05:08] [INFO ] Implicit Places using invariants and state equation in 4241 ms returned []
Implicit Place search using SMT with State Equation took 6394 ms to find 0 implicit places.
[2023-03-16 21:05:08] [INFO ] Invariant cache hit.
[2023-03-16 21:05:09] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7181 ms. Remains : 1978/1978 places, 329/329 transitions.
Computed a total of 1978 stabilizing places and 329 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1978 transition count 329
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 279 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1938006 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :{}
Probabilistic random walk after 1938006 steps, saw 250824 distinct states, run finished after 3001 ms. (steps per millisecond=645 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:05:12] [INFO ] Invariant cache hit.
[2023-03-16 21:05:12] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:05:13] [INFO ] [Nat]Absence check using 0 positive and 1652 generalized place invariants in 323 ms returned sat
[2023-03-16 21:05:14] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:05:14] [INFO ] After 661ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-16 21:05:14] [INFO ] After 1278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2811 reset in 471 ms.
Product exploration explored 100000 steps with 2818 reset in 462 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0)]
Support contains 30 out of 1978 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1978/1978 places, 329/329 transitions.
Applied a total of 0 rules in 120 ms. Remains 1978 /1978 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2023-03-16 21:05:15] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-16 21:05:15] [INFO ] Invariant cache hit.
[2023-03-16 21:05:16] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 1978/1978 places, 329/329 transitions.
Built C files in :
/tmp/ltsmin3477057424311322133
[2023-03-16 21:05:16] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3477057424311322133
Running compilation step : cd /tmp/ltsmin3477057424311322133;'/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 1242 ms.
Running link step : cd /tmp/ltsmin3477057424311322133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3477057424311322133;'/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/stateBased7195473244183840189.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 1978 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1978/1978 places, 329/329 transitions.
Applied a total of 0 rules in 105 ms. Remains 1978 /1978 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2023-03-16 21:05:31] [INFO ] Invariant cache hit.
[2023-03-16 21:05:34] [INFO ] Implicit Places using invariants in 2222 ms returned []
[2023-03-16 21:05:34] [INFO ] Invariant cache hit.
[2023-03-16 21:05:38] [INFO ] Implicit Places using invariants and state equation in 4155 ms returned []
Implicit Place search using SMT with State Equation took 6388 ms to find 0 implicit places.
[2023-03-16 21:05:38] [INFO ] Invariant cache hit.
[2023-03-16 21:05:38] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7186 ms. Remains : 1978/1978 places, 329/329 transitions.
Built C files in :
/tmp/ltsmin628746802469220847
[2023-03-16 21:05:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin628746802469220847
Running compilation step : cd /tmp/ltsmin628746802469220847;'/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 1284 ms.
Running link step : cd /tmp/ltsmin628746802469220847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin628746802469220847;'/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/stateBased13897496610196215291.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 21:05:54] [INFO ] Flatten gal took : 43 ms
[2023-03-16 21:05:54] [INFO ] Flatten gal took : 44 ms
[2023-03-16 21:05:54] [INFO ] Time to serialize gal into /tmp/LTL12565462024933109576.gal : 7 ms
[2023-03-16 21:05:54] [INFO ] Time to serialize properties into /tmp/LTL9740167752715709649.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/LTL12565462024933109576.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6823687364403555940.hoa' '-atoms' '/tmp/LTL9740167752715709649.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/LTL9740167752715709649.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6823687364403555940.hoa
Detected timeout of ITS tools.
[2023-03-16 21:06:09] [INFO ] Flatten gal took : 41 ms
[2023-03-16 21:06:09] [INFO ] Flatten gal took : 42 ms
[2023-03-16 21:06:09] [INFO ] Time to serialize gal into /tmp/LTL13545197721774829179.gal : 7 ms
[2023-03-16 21:06:09] [INFO ] Time to serialize properties into /tmp/LTL5613830491535739987.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/LTL13545197721774829179.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5613830491535739987.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(G("((((((n6_18+n6_17)+(n6_16+n6_15))+((n6_14+n6_13)+(n6_12+n6_11)))+(((n6_10+n6_9)+(n6_8+n6_7))+((n6_6+n6_5)+(n6_4+n6_3))))+((((n...264
Formula 0 simplified : XF!"((((((n6_18+n6_17)+(n6_16+n6_15))+((n6_14+n6_13)+(n6_12+n6_11)))+(((n6_10+n6_9)+(n6_8+n6_7))+((n6_6+n6_5)+(n6_4+n6_3))))+((((n6_...258
Detected timeout of ITS tools.
[2023-03-16 21:06:24] [INFO ] Flatten gal took : 39 ms
[2023-03-16 21:06:24] [INFO ] Applying decomposition
[2023-03-16 21:06:24] [INFO ] Flatten gal took : 38 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/graph5821466696623027124.txt' '-o' '/tmp/graph5821466696623027124.bin' '-w' '/tmp/graph5821466696623027124.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5821466696623027124.bin' '-l' '-1' '-v' '-w' '/tmp/graph5821466696623027124.weights' '-q' '0' '-e' '0.001'
[2023-03-16 21:06:24] [INFO ] Decomposing Gal with order
[2023-03-16 21:06:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 21:06:24] [INFO ] Removed a total of 289 redundant transitions.
[2023-03-16 21:06:24] [INFO ] Flatten gal took : 55 ms
[2023-03-16 21:06:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 246 labels/synchronizations in 9 ms.
[2023-03-16 21:06:24] [INFO ] Time to serialize gal into /tmp/LTL14723135332393641278.gal : 9 ms
[2023-03-16 21:06:24] [INFO ] Time to serialize properties into /tmp/LTL8832783145703628162.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/LTL14723135332393641278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8832783145703628162.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(G("((((((gu40.n6_18+gu40.n6_17)+(gu40.n6_16+gu40.n6_15))+((gu40.n6_14+gu40.n6_13)+(gu40.n6_12+gu40.n6_11)))+(((gu40.n6_10+gu40.n6...414
Formula 0 simplified : XF!"((((((gu40.n6_18+gu40.n6_17)+(gu40.n6_16+gu40.n6_15))+((gu40.n6_14+gu40.n6_13)+(gu40.n6_12+gu40.n6_11)))+(((gu40.n6_10+gu40.n6_9...408
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2878865434360155766
[2023-03-16 21:06:39] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2878865434360155766
Running compilation step : cd /tmp/ltsmin2878865434360155766;'/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 1306 ms.
Running link step : cd /tmp/ltsmin2878865434360155766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2878865434360155766;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-03 finished in 129016 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)||G(F(p1)))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-28-LTLCardinality-12
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2907 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.7 ms
Discarding 91 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2905 transition count 442
Applied a total of 3 rules in 468 ms. Remains 2905 /2998 variables (removed 93) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2905 cols
[2023-03-16 21:06:55] [INFO ] Computed 2465 place invariants in 19 ms
[2023-03-16 21:06:59] [INFO ] Implicit Places using invariants in 4105 ms returned []
[2023-03-16 21:06:59] [INFO ] Invariant cache hit.
[2023-03-16 21:07:07] [INFO ] Implicit Places using invariants and state equation in 7663 ms returned [1967, 1968, 1970, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2607, 2608, 2609, 2610, 2812, 2813, 2814, 2815, 2816, 2817, 2818, 2819, 2826]
Discarding 57 places :
Implicit Place search using SMT with State Equation took 11799 ms to find 57 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2848/2998 places, 442/446 transitions.
Applied a total of 0 rules in 234 ms. Remains 2848 /2848 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 12502 ms. Remains : 2848/2998 places, 442/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT 1 s29) (GT s1976 s211)), p1:(GT s2731 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2817 reset in 351 ms.
Product exploration explored 100000 steps with 2818 reset in 377 ms.
Computed a total of 2848 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2848 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 404 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1079690 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :{}
Probabilistic random walk after 1079690 steps, saw 137923 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 442 rows 2848 cols
[2023-03-16 21:07:12] [INFO ] Computed 2409 place invariants in 13 ms
[2023-03-16 21:07:13] [INFO ] [Real]Absence check using 0 positive and 2409 generalized place invariants in 496 ms returned sat
[2023-03-16 21:07:13] [INFO ] After 938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:07:14] [INFO ] [Nat]Absence check using 0 positive and 2409 generalized place invariants in 529 ms returned sat
[2023-03-16 21:07:19] [INFO ] After 4828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:07:21] [INFO ] After 6434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1914 ms.
[2023-03-16 21:07:23] [INFO ] After 9405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 195 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=27 )
Parikh walk visited 3 properties in 7 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 356 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 2848 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2848/2848 places, 442/442 transitions.
Applied a total of 0 rules in 198 ms. Remains 2848 /2848 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-16 21:07:24] [INFO ] Invariant cache hit.
[2023-03-16 21:07:28] [INFO ] Implicit Places using invariants in 4022 ms returned []
[2023-03-16 21:07:28] [INFO ] Invariant cache hit.
[2023-03-16 21:07:35] [INFO ] Implicit Places using invariants and state equation in 7240 ms returned []
Implicit Place search using SMT with State Equation took 11271 ms to find 0 implicit places.
[2023-03-16 21:07:35] [INFO ] Invariant cache hit.
[2023-03-16 21:07:36] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12576 ms. Remains : 2848/2848 places, 442/442 transitions.
Computed a total of 2848 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2848 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 380 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 280 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 830591 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{}
Probabilistic random walk after 830591 steps, saw 106947 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:07:40] [INFO ] Invariant cache hit.
[2023-03-16 21:07:41] [INFO ] [Real]Absence check using 0 positive and 2409 generalized place invariants in 516 ms returned sat
[2023-03-16 21:07:41] [INFO ] After 999ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:07:42] [INFO ] [Nat]Absence check using 0 positive and 2409 generalized place invariants in 489 ms returned sat
[2023-03-16 21:07:47] [INFO ] After 4375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:07:48] [INFO ] After 6144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1246 ms.
[2023-03-16 21:07:50] [INFO ] After 8346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 192 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=38 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 423 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2816 reset in 352 ms.
Product exploration explored 100000 steps with 2814 reset in 365 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 2848 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2848/2848 places, 442/442 transitions.
Applied a total of 0 rules in 216 ms. Remains 2848 /2848 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-16 21:07:52] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-16 21:07:52] [INFO ] Invariant cache hit.
[2023-03-16 21:07:53] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1266 ms. Remains : 2848/2848 places, 442/442 transitions.
Built C files in :
/tmp/ltsmin16827579578145214913
[2023-03-16 21:07:53] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16827579578145214913
Running compilation step : cd /tmp/ltsmin16827579578145214913;'/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 1938 ms.
Running link step : cd /tmp/ltsmin16827579578145214913;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16827579578145214913;'/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/stateBased61523656523897132.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 2848 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2848/2848 places, 442/442 transitions.
Applied a total of 0 rules in 194 ms. Remains 2848 /2848 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-16 21:08:08] [INFO ] Invariant cache hit.
[2023-03-16 21:08:12] [INFO ] Implicit Places using invariants in 4067 ms returned []
[2023-03-16 21:08:12] [INFO ] Invariant cache hit.
[2023-03-16 21:08:19] [INFO ] Implicit Places using invariants and state equation in 6967 ms returned []
Implicit Place search using SMT with State Equation took 11036 ms to find 0 implicit places.
[2023-03-16 21:08:19] [INFO ] Invariant cache hit.
[2023-03-16 21:08:20] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12333 ms. Remains : 2848/2848 places, 442/442 transitions.
Built C files in :
/tmp/ltsmin18029358376051563232
[2023-03-16 21:08:20] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18029358376051563232
Running compilation step : cd /tmp/ltsmin18029358376051563232;'/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 1773 ms.
Running link step : cd /tmp/ltsmin18029358376051563232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18029358376051563232;'/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/stateBased10630446590627850636.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 21:08:36] [INFO ] Flatten gal took : 54 ms
[2023-03-16 21:08:36] [INFO ] Flatten gal took : 52 ms
[2023-03-16 21:08:36] [INFO ] Time to serialize gal into /tmp/LTL13401247634580656759.gal : 10 ms
[2023-03-16 21:08:36] [INFO ] Time to serialize properties into /tmp/LTL3369515128970865781.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/LTL13401247634580656759.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17367625926561750841.hoa' '-atoms' '/tmp/LTL3369515128970865781.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/LTL3369515128970865781.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17367625926561750841.hoa
Detected timeout of ITS tools.
[2023-03-16 21:08:51] [INFO ] Flatten gal took : 52 ms
[2023-03-16 21:08:51] [INFO ] Flatten gal took : 52 ms
[2023-03-16 21:08:51] [INFO ] Time to serialize gal into /tmp/LTL14417821453320586751.gal : 8 ms
[2023-03-16 21:08:51] [INFO ] Time to serialize properties into /tmp/LTL721299982581318962.ltl : 48 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/LTL14417821453320586751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL721299982581318962.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((G("((s6_0<1)||(Cstart_24>a4))"))||(G(F("(SstopOK_26>malicious_reservoir)"))))))
Formula 0 simplified : X(F!"((s6_0<1)||(Cstart_24>a4))" & FG!"(SstopOK_26>malicious_reservoir)")
Detected timeout of ITS tools.
[2023-03-16 21:09:06] [INFO ] Flatten gal took : 65 ms
[2023-03-16 21:09:06] [INFO ] Applying decomposition
[2023-03-16 21:09:06] [INFO ] Flatten gal took : 53 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/graph7416179895610984442.txt' '-o' '/tmp/graph7416179895610984442.bin' '-w' '/tmp/graph7416179895610984442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7416179895610984442.bin' '-l' '-1' '-v' '-w' '/tmp/graph7416179895610984442.weights' '-q' '0' '-e' '0.001'
[2023-03-16 21:09:06] [INFO ] Decomposing Gal with order
[2023-03-16 21:09:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 21:09:06] [INFO ] Removed a total of 290 redundant transitions.
[2023-03-16 21:09:07] [INFO ] Flatten gal took : 261 ms
[2023-03-16 21:09:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 107 ms.
[2023-03-16 21:09:07] [INFO ] Time to serialize gal into /tmp/LTL544867757621101527.gal : 18 ms
[2023-03-16 21:09:07] [INFO ] Time to serialize properties into /tmp/LTL12047278981116939876.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/LTL544867757621101527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12047278981116939876.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((G("((gi2.gi5.gu0.s6_0<1)||(gu62.Cstart_24>gu62.a4))"))||(G(F("(gu66.SstopOK_26>gu66.malicious_reservoir)"))))))
Formula 0 simplified : X(F!"((gi2.gi5.gu0.s6_0<1)||(gu62.Cstart_24>gu62.a4))" & FG!"(gu66.SstopOK_26>gu66.malicious_reservoir)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14176058458243388007
[2023-03-16 21:09:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14176058458243388007
Running compilation step : cd /tmp/ltsmin14176058458243388007;'/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 1730 ms.
Running link step : cd /tmp/ltsmin14176058458243388007;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14176058458243388007;'/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(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-28-LTLCardinality-12 finished in 162877 ms.
[2023-03-16 21:09:37] [INFO ] Flatten gal took : 57 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8781172628509602702
[2023-03-16 21:09:38] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2023-03-16 21:09:38] [INFO ] Applying decomposition
[2023-03-16 21:09:38] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:09:38] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2023-03-16 21:09:38] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:09:38] [INFO ] Flatten gal took : 71 ms
[2023-03-16 21:09:38] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2023-03-16 21:09:38] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 21:09:38] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8781172628509602702
Running compilation step : cd /tmp/ltsmin8781172628509602702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' '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/graph423372147174063647.txt' '-o' '/tmp/graph423372147174063647.bin' '-w' '/tmp/graph423372147174063647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph423372147174063647.bin' '-l' '-1' '-v' '-w' '/tmp/graph423372147174063647.weights' '-q' '0' '-e' '0.001'
[2023-03-16 21:09:38] [INFO ] Decomposing Gal with order
[2023-03-16 21:09:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 21:09:38] [INFO ] Removed a total of 77 redundant transitions.
[2023-03-16 21:09:38] [INFO ] Flatten gal took : 129 ms
[2023-03-16 21:09:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 18 ms.
[2023-03-16 21:09:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality12081867877566191531.gal : 31 ms
[2023-03-16 21:09:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality10545846002630341234.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/LTLCardinality12081867877566191531.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10545846002630341234.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...299
Read 2 LTL properties
Checking formula 0 : !((X(G("((((((gu67.n6_18+gu67.n6_17)+(gu67.n6_16+gu67.n6_15))+((gu67.n6_14+gu67.n6_13)+(gu67.n6_12+gu67.n6_11)))+(((gu67.n6_10+gu67.n6...414
Formula 0 simplified : XF!"((((((gu67.n6_18+gu67.n6_17)+(gu67.n6_16+gu67.n6_15))+((gu67.n6_14+gu67.n6_13)+(gu67.n6_12+gu67.n6_11)))+(((gu67.n6_10+gu67.n6_9...408
Compilation finished in 2308 ms.
Running link step : cd /tmp/ltsmin8781172628509602702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8781172628509602702;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.026: LTL layer: formula: X([]((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.027: "X([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.027: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.082: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.427: DFS-FIFO for weak LTL, using special progress label 450
pins2lts-mc-linux64( 0/ 8), 0.428: There are 451 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.428: State length is 2999, there are 450 groups
pins2lts-mc-linux64( 0/ 8), 0.428: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.428: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.428: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.428: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.777: ~1 levels ~960 states ~26664 transitions
pins2lts-mc-linux64( 5/ 8), 1.018: ~1 levels ~1920 states ~57936 transitions
pins2lts-mc-linux64( 0/ 8), 1.378: ~1 levels ~3840 states ~120088 transitions
pins2lts-mc-linux64( 0/ 8), 2.003: ~1 levels ~7680 states ~230488 transitions
pins2lts-mc-linux64( 2/ 8), 3.171: ~1 levels ~15360 states ~436256 transitions
pins2lts-mc-linux64( 2/ 8), 9.105: ~1 levels ~30720 states ~861968 transitions
pins2lts-mc-linux64( 2/ 8), 25.657: ~1 levels ~61440 states ~1693072 transitions
pins2lts-mc-linux64( 2/ 8), 46.362: ~1 levels ~122880 states ~3428072 transitions
pins2lts-mc-linux64( 2/ 8), 70.679: ~1 levels ~245760 states ~7157160 transitions
pins2lts-mc-linux64( 2/ 8), 120.775: ~1 levels ~491520 states ~18206528 transitions
pins2lts-mc-linux64( 7/ 8), 181.407: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 181.989:
pins2lts-mc-linux64( 0/ 8), 181.989: mean standard work distribution: 5.4% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 181.989:
pins2lts-mc-linux64( 0/ 8), 181.989: Explored 744066 states 33036926 transitions, fanout: 44.401
pins2lts-mc-linux64( 0/ 8), 181.989: Total exploration time 181.540 sec (181.000 sec minimum, 181.281 sec on average)
pins2lts-mc-linux64( 0/ 8), 181.989: States per second: 4099, Transitions per second: 181982
pins2lts-mc-linux64( 0/ 8), 181.989:
pins2lts-mc-linux64( 0/ 8), 181.989: Progress states detected: 9834129
pins2lts-mc-linux64( 0/ 8), 181.989: Redundant explorations: -92.4339
pins2lts-mc-linux64( 0/ 8), 181.989:
pins2lts-mc-linux64( 0/ 8), 181.989: Queue width: 8B, total height: 11763160, memory: 89.75MB
pins2lts-mc-linux64( 0/ 8), 181.989: Tree memory: 331.0MB, 35.3 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 181.989: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 181.989: Stored 448 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 181.989: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 181.989: Est. total memory use: 420.8MB (~1113.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8781172628509602702;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8781172628509602702;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 21:34:54] [INFO ] Flatten gal took : 380 ms
[2023-03-16 21:34:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality11076861489423160070.gal : 115 ms
[2023-03-16 21:34:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality1865461196826971735.ltl : 8 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/LTLCardinality11076861489423160070.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1865461196826971735.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...298
Read 2 LTL properties
Checking formula 0 : !((X(G("((((((n6_18+n6_17)+(n6_16+n6_15))+((n6_14+n6_13)+(n6_12+n6_11)))+(((n6_10+n6_9)+(n6_8+n6_7))+((n6_6+n6_5)+(n6_4+n6_3))))+((((n...264
Formula 0 simplified : XF!"((((((n6_18+n6_17)+(n6_16+n6_15))+((n6_14+n6_13)+(n6_12+n6_11)))+(((n6_10+n6_9)+(n6_8+n6_7))+((n6_6+n6_5)+(n6_4+n6_3))))+((((n6_...258
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 136180 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11195224 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-28"
export BK_EXAMINATION="LTLCardinality"
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-28, examination is LTLCardinality"
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-167873946000899"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;