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.r295-tall-167873948500883.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 lolaxred
Input is QuasiCertifProtocol-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948500883
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 42K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 289K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:23 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 16K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 593K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K 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 360K 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-18-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678917860048

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 22:04:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 22:04:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:04:21] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-15 22:04:21] [INFO ] Transformed 1398 places.
[2023-03-15 22:04:21] [INFO ] Transformed 296 transitions.
[2023-03-15 22:04:21] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 856 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1379 transition count 296
Applied a total of 19 rules in 64 ms. Remains 1379 /1398 variables (removed 19) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1379 cols
[2023-03-15 22:04:22] [INFO ] Computed 1084 place invariants in 72 ms
[2023-03-15 22:04:23] [INFO ] Implicit Places using invariants in 996 ms returned []
[2023-03-15 22:04:23] [INFO ] Invariant cache hit.
[2023-03-15 22:04:25] [INFO ] Implicit Places using invariants and state equation in 2198 ms returned [835, 837, 838, 839, 840, 841, 842, 843, 844, 948, 949, 950, 951, 952, 953, 954, 955, 956]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 3225 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1361/1398 places, 296/296 transitions.
Applied a total of 0 rules in 18 ms. Remains 1361 /1361 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3308 ms. Remains : 1361/1398 places, 296/296 transitions.
Support contains 856 out of 1361 places after structural reductions.
[2023-03-15 22:04:25] [INFO ] Flatten gal took : 109 ms
[2023-03-15 22:04:25] [INFO ] Flatten gal took : 65 ms
[2023-03-15 22:04:25] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 837 out of 1361 places (down from 856) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 442 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 296 rows 1361 cols
[2023-03-15 22:04:26] [INFO ] Computed 1066 place invariants in 33 ms
[2023-03-15 22:04:27] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-15 22:04:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 22:04:27] [INFO ] [Nat]Absence check using 3 positive and 1063 generalized place invariants in 165 ms returned sat
[2023-03-15 22:04:43] [INFO ] After 15443ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :15
[2023-03-15 22:04:52] [INFO ] After 23784ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :15
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-15 22:04:52] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :15
Fused 20 Parikh solutions to 15 different solutions.
Finished Parikh walk after 92 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 15 properties in 51 ms.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1361 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1361 transition count 296
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' '!(F(((p1 U (p2||G(p1)))||p0)))'
Support contains 400 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1358 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.13 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1357 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 1356 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1356 transition count 294
Applied a total of 5 rules in 189 ms. Remains 1356 /1361 variables (removed 5) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1356 cols
[2023-03-15 22:04:52] [INFO ] Computed 1063 place invariants in 19 ms
[2023-03-15 22:04:53] [INFO ] Implicit Places using invariants in 1029 ms returned []
[2023-03-15 22:04:53] [INFO ] Invariant cache hit.
[2023-03-15 22:04:55] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned [832, 1176, 1177, 1178, 1179, 1180, 1181, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1316, 1317, 1318, 1319, 1322]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 2700 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1361 places, 294/296 transitions.
Applied a total of 0 rules in 69 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2959 ms. Remains : 1336/1361 places, 294/296 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s75 s76 s77 s78 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s93 s95 s96 s97 s98)) (LEQ 1 s128)), p2:(AND (GT 1 s128) (GT (ADD s138 s139 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6279 reset in 2351 ms.
Product exploration explored 100000 steps with 6238 reset in 2274 ms.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 339 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 421 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 1336 cols
[2023-03-15 22:05:01] [INFO ] Computed 1044 place invariants in 21 ms
[2023-03-15 22:05:01] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-15 22:05:01] [INFO ] Invariant cache hit.
[2023-03-15 22:05:03] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1094 ms returned sat
[2023-03-15 22:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:05:07] [INFO ] [Real]Absence check using state equation in 3658 ms returned sat
[2023-03-15 22:05:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:05:08] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1069 ms returned sat
[2023-03-15 22:05:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:05:20] [INFO ] [Nat]Absence check using state equation in 11577 ms returned sat
[2023-03-15 22:05:20] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 24 ms.
[2023-03-15 22:05:21] [INFO ] Added : 57 causal constraints over 12 iterations in 872 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 34 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-15 22:05:21] [INFO ] Invariant cache hit.
[2023-03-15 22:05:22] [INFO ] Implicit Places using invariants in 888 ms returned []
[2023-03-15 22:05:22] [INFO ] Invariant cache hit.
[2023-03-15 22:05:23] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 2500 ms to find 0 implicit places.
[2023-03-15 22:05:23] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 22:05:23] [INFO ] Invariant cache hit.
[2023-03-15 22:05:24] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2987 ms. Remains : 1336/1336 places, 294/294 transitions.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-15 22:05:25] [INFO ] Invariant cache hit.
[2023-03-15 22:05:26] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1117 ms returned sat
[2023-03-15 22:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:05:30] [INFO ] [Real]Absence check using state equation in 3711 ms returned sat
[2023-03-15 22:05:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:05:32] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1068 ms returned sat
[2023-03-15 22:05:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:05:43] [INFO ] [Nat]Absence check using state equation in 11447 ms returned sat
[2023-03-15 22:05:43] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 29 ms.
[2023-03-15 22:05:44] [INFO ] Added : 57 causal constraints over 12 iterations in 858 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 6261 reset in 856 ms.
Product exploration explored 100000 steps with 6223 reset in 837 ms.
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 40 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-15 22:05:46] [INFO ] Invariant cache hit.
[2023-03-15 22:05:47] [INFO ] Implicit Places using invariants in 920 ms returned []
[2023-03-15 22:05:47] [INFO ] Invariant cache hit.
[2023-03-15 22:05:48] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
[2023-03-15 22:05:48] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 22:05:48] [INFO ] Invariant cache hit.
[2023-03-15 22:05:49] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2999 ms. Remains : 1336/1336 places, 294/294 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-00 finished in 56736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F((p1||G(p2))))))'
Support contains 382 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 971 are kept as prefixes of interest. Removing 390 places using SCC suffix rule.2 ms
Discarding 390 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 971 transition count 283
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 941 transition count 223
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 941 transition count 223
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 941 transition count 223
Applied a total of 68 rules in 99 ms. Remains 941 /1361 variables (removed 420) and now considering 223/296 (removed 73) transitions.
// Phase 1: matrix 223 rows 941 cols
[2023-03-15 22:05:49] [INFO ] Computed 720 place invariants in 4 ms
[2023-03-15 22:05:49] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-03-15 22:05:49] [INFO ] Invariant cache hit.
[2023-03-15 22:05:50] [INFO ] Implicit Places using invariants and state equation in 901 ms returned [416]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1494 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/1361 places, 223/296 transitions.
Applied a total of 0 rules in 27 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1621 ms. Remains : 940/1361 places, 223/296 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10616 reset in 739 ms.
Product exploration explored 100000 steps with 10609 reset in 757 ms.
Computed a total of 940 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 940 transition count 223
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) (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 523 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 389 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 223 rows 940 cols
[2023-03-15 22:05:53] [INFO ] Computed 720 place invariants in 14 ms
[2023-03-15 22:05:53] [INFO ] [Real]Absence check using 0 positive and 720 generalized place invariants in 123 ms returned sat
[2023-03-15 22:05:53] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 22:05:54] [INFO ] [Nat]Absence check using 0 positive and 720 generalized place invariants in 113 ms returned sat
[2023-03-15 22:05:59] [INFO ] After 4797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 22:06:00] [INFO ] After 5801ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1162 ms.
[2023-03-15 22:06:01] [INFO ] After 7230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 9 factoid took 435 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 382 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 223/223 transitions.
Applied a total of 0 rules in 9 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-15 22:06:01] [INFO ] Invariant cache hit.
[2023-03-15 22:06:02] [INFO ] Implicit Places using invariants in 548 ms returned []
[2023-03-15 22:06:02] [INFO ] Invariant cache hit.
[2023-03-15 22:06:03] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
[2023-03-15 22:06:03] [INFO ] Invariant cache hit.
[2023-03-15 22:06:03] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1702 ms. Remains : 940/940 places, 223/223 transitions.
Computed a total of 940 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 940 transition count 223
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) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 335 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 395 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 22:06:04] [INFO ] Invariant cache hit.
[2023-03-15 22:06:04] [INFO ] [Real]Absence check using 0 positive and 720 generalized place invariants in 110 ms returned sat
[2023-03-15 22:06:04] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 22:06:05] [INFO ] [Nat]Absence check using 0 positive and 720 generalized place invariants in 110 ms returned sat
[2023-03-15 22:06:09] [INFO ] After 4792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 22:06:12] [INFO ] After 7164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2423 ms.
[2023-03-15 22:06:14] [INFO ] After 9847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 387 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10659 reset in 687 ms.
Product exploration explored 100000 steps with 10638 reset in 693 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 382 out of 940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 940/940 places, 223/223 transitions.
Applied a total of 0 rules in 33 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-15 22:06:17] [INFO ] Redundant transitions in 27 ms returned [189]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 222 rows 940 cols
[2023-03-15 22:06:17] [INFO ] Computed 720 place invariants in 13 ms
[2023-03-15 22:06:17] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/940 places, 222/223 transitions.
Graph (complete) has 8560 edges and 940 vertex of which 578 are kept as prefixes of interest. Removing 362 places using SCC suffix rule.2 ms
Discarding 362 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 560 transition count 185
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 560 transition count 185
Applied a total of 37 rules in 13 ms. Remains 560 /940 variables (removed 380) and now considering 185/222 (removed 37) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 560/940 places, 185/223 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 481 ms. Remains : 560/940 places, 185/223 transitions.
Support contains 382 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 223/223 transitions.
Applied a total of 0 rules in 10 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 940 cols
[2023-03-15 22:06:17] [INFO ] Computed 720 place invariants in 7 ms
[2023-03-15 22:06:18] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-15 22:06:18] [INFO ] Invariant cache hit.
[2023-03-15 22:06:18] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1425 ms to find 0 implicit places.
[2023-03-15 22:06:18] [INFO ] Invariant cache hit.
[2023-03-15 22:06:19] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1718 ms. Remains : 940/940 places, 223/223 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-01 finished in 29984 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)&&F(!p0)))'
Support contains 20 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 36 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-15 22:06:19] [INFO ] Computed 1044 place invariants in 23 ms
[2023-03-15 22:06:20] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2023-03-15 22:06:20] [INFO ] Invariant cache hit.
[2023-03-15 22:06:22] [INFO ] Implicit Places using invariants and state equation in 2342 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3614 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3687 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1269 s1270 s1271 s1272) s1268)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-02 finished in 3821 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((p0||F(p1)))&&F(G(!p0))))'
Support contains 40 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1337 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 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
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1336 transition count 293
Applied a total of 3 rules in 98 ms. Remains 1336 /1361 variables (removed 25) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1336 cols
[2023-03-15 22:06:23] [INFO ] Computed 1045 place invariants in 8 ms
[2023-03-15 22:06:24] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2023-03-15 22:06:24] [INFO ] Invariant cache hit.
[2023-03-15 22:06:26] [INFO ] Implicit Places using invariants and state equation in 2265 ms returned [830]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3536 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1361 places, 293/296 transitions.
Applied a total of 0 rules in 52 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3687 ms. Remains : 1335/1361 places, 293/296 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s472 s473 s474 s475 s478 s479 s536 s537 s538 s539 s540 s541 s542 s543 s544 s548 s549 s550 s551) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-04 finished in 3797 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(p0)||G(F(!p0))))'
Support contains 1 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1 are kept as prefixes of interest. Removing 1360 places using SCC suffix rule.2 ms
Discarding 1360 places :
Also discarding 295 output transitions
Drop transitions removed 295 transitions
Applied a total of 1 rules in 5 ms. Remains 1 /1361 variables (removed 1360) and now considering 1/296 (removed 295) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-15 22:06:26] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-15 22:06:26] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-15 22:06:26] [INFO ] Invariant cache hit.
[2023-03-15 22:06:26] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-15 22:06:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 22:06:26] [INFO ] Invariant cache hit.
[2023-03-15 22:06:26] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/1361 places, 1/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 1/1361 places, 1/296 transitions.
Stuttering acceptance computed with spot in 98 ms :[false, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-05 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(F(!p0))&&F(p1))))))'
Support contains 39 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 29 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-15 22:06:27] [INFO ] Computed 1044 place invariants in 17 ms
[2023-03-15 22:06:28] [INFO ] Implicit Places using invariants in 1172 ms returned []
[2023-03-15 22:06:28] [INFO ] Invariant cache hit.
[2023-03-15 22:06:30] [INFO ] Implicit Places using invariants and state equation in 2270 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3444 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 33 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3507 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, true, true, true, true, p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 (ADD s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1269 s1270 s1271 s1272)), p1:(LEQ s146 (ADD s20 ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-06 finished in 3750 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 19 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 970 are kept as prefixes of interest. Removing 391 places using SCC suffix rule.2 ms
Discarding 391 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 969 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 939 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 939 transition count 222
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 1 with 4 rules applied. Total rules applied 71 place count 937 transition count 220
Applied a total of 71 rules in 84 ms. Remains 937 /1361 variables (removed 424) and now considering 220/296 (removed 76) transitions.
// Phase 1: matrix 220 rows 937 cols
[2023-03-15 22:06:31] [INFO ] Computed 720 place invariants in 4 ms
[2023-03-15 22:06:31] [INFO ] Implicit Places using invariants in 708 ms returned []
[2023-03-15 22:06:31] [INFO ] Invariant cache hit.
[2023-03-15 22:06:33] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned [413, 757, 758, 759, 760, 761, 762, 765, 766, 767, 768, 769, 770, 771, 772, 897, 898, 899, 900, 903]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 2162 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 917/1361 places, 220/296 transitions.
Applied a total of 0 rules in 29 ms. Remains 917 /917 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2276 ms. Remains : 917/1361 places, 220/296 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s854 s855 s856 s857))], 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 24 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-07 finished in 2325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U G(p1)))))'
Support contains 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1339 transition count 296
Applied a total of 22 rules in 38 ms. Remains 1339 /1361 variables (removed 22) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-15 22:06:33] [INFO ] Computed 1045 place invariants in 17 ms
[2023-03-15 22:06:34] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2023-03-15 22:06:34] [INFO ] Invariant cache hit.
[2023-03-15 22:06:37] [INFO ] Implicit Places using invariants and state equation in 2366 ms returned [814]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3545 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1361 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3620 ms. Remains : 1338/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LEQ 3 s19) (LEQ 1 s19)), p0:(GT s55 s1337)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-09 finished in 3796 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 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 33 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-15 22:06:37] [INFO ] Computed 1044 place invariants in 14 ms
[2023-03-15 22:06:38] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2023-03-15 22:06:38] [INFO ] Invariant cache hit.
[2023-03-15 22:06:40] [INFO ] Implicit Places using invariants and state equation in 2074 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3250 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3320 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-10 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 (LEQ s1319 s66) (LEQ 2 s0))], 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 4420 reset in 290 ms.
Product exploration explored 100000 steps with 4418 reset in 233 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
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 73 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2009378 steps, run timeout after 3001 ms. (steps per millisecond=669 ) properties seen :{}
Probabilistic random walk after 2009378 steps, saw 283008 distinct states, run finished after 3002 ms. (steps per millisecond=669 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-15 22:06:44] [INFO ] Computed 1044 place invariants in 107 ms
[2023-03-15 22:06:44] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:06:45] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 162 ms returned sat
[2023-03-15 22:06:45] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:06:45] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-15 22:06:45] [INFO ] After 939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
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 204 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 148 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-15 22:06:46] [INFO ] Invariant cache hit.
[2023-03-15 22:06:47] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2023-03-15 22:06:47] [INFO ] Invariant cache hit.
[2023-03-15 22:06:49] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 3253 ms to find 0 implicit places.
[2023-03-15 22:06:49] [INFO ] Invariant cache hit.
[2023-03-15 22:06:49] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3701 ms. Remains : 1337/1337 places, 296/296 transitions.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
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 160 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 62 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2034150 steps, run timeout after 3001 ms. (steps per millisecond=677 ) properties seen :{}
Probabilistic random walk after 2034150 steps, saw 285871 distinct states, run finished after 3001 ms. (steps per millisecond=677 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:06:53] [INFO ] Invariant cache hit.
[2023-03-15 22:06:53] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:06:53] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 164 ms returned sat
[2023-03-15 22:06:54] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:06:54] [INFO ] After 740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-15 22:06:54] [INFO ] After 1118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
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 207 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 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4427 reset in 204 ms.
Product exploration explored 100000 steps with 4418 reset in 236 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 1317 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.5 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1317 transition count 296
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 96 ms. Remains 1317 /1337 variables (removed 20) and now considering 296/296 (removed 0) transitions.
[2023-03-15 22:06:55] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 296 rows 1317 cols
[2023-03-15 22:06:56] [INFO ] Computed 1026 place invariants in 113 ms
[2023-03-15 22:06:56] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1317/1337 places, 296/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 652 ms. Remains : 1317/1337 places, 296/296 transitions.
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 35 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-15 22:06:56] [INFO ] Computed 1044 place invariants in 99 ms
[2023-03-15 22:06:57] [INFO ] Implicit Places using invariants in 1270 ms returned []
[2023-03-15 22:06:57] [INFO ] Invariant cache hit.
[2023-03-15 22:06:59] [INFO ] Implicit Places using invariants and state equation in 1997 ms returned []
Implicit Place search using SMT with State Equation took 3270 ms to find 0 implicit places.
[2023-03-15 22:06:59] [INFO ] Invariant cache hit.
[2023-03-15 22:07:00] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3715 ms. Remains : 1337/1337 places, 296/296 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-10 finished in 22931 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||(p1&&G(p2)))))'
Support contains 5 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1339 transition count 296
Applied a total of 22 rules in 30 ms. Remains 1339 /1361 variables (removed 22) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-15 22:07:00] [INFO ] Computed 1045 place invariants in 24 ms
[2023-03-15 22:07:01] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2023-03-15 22:07:01] [INFO ] Invariant cache hit.
[2023-03-15 22:07:03] [INFO ] Implicit Places using invariants and state equation in 2216 ms returned [814]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3389 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1361 places, 296/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3451 ms. Remains : 1338/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(LEQ 1 s52), p0:(GT s37 s1296), p1:(LEQ s147 s1159)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 125 steps with 62 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-12 finished in 3598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p0)&&X(p1))))))'
Support contains 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 32 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-15 22:07:03] [INFO ] Computed 1044 place invariants in 16 ms
[2023-03-15 22:07:05] [INFO ] Implicit Places using invariants in 1219 ms returned []
[2023-03-15 22:07:05] [INFO ] Invariant cache hit.
[2023-03-15 22:07:07] [INFO ] Implicit Places using invariants and state equation in 2366 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3586 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3648 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s125 s736), p1:(LEQ 1 s541)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-13 finished in 3855 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(p0)||X(G(!p0))))'
Support contains 2 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1339 transition count 296
Applied a total of 22 rules in 31 ms. Remains 1339 /1361 variables (removed 22) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-15 22:07:07] [INFO ] Computed 1044 place invariants in 17 ms
[2023-03-15 22:07:08] [INFO ] Implicit Places using invariants in 1212 ms returned []
[2023-03-15 22:07:08] [INFO ] Invariant cache hit.
[2023-03-15 22:07:11] [INFO ] Implicit Places using invariants and state equation in 2279 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3492 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1361 places, 296/296 transitions.
Applied a total of 0 rules in 31 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3555 ms. Remains : 1338/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s1269 s1120)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4423 reset in 210 ms.
Product exploration explored 100000 steps with 4420 reset in 225 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2030442 steps, run timeout after 3001 ms. (steps per millisecond=676 ) properties seen :{}
Probabilistic random walk after 2030442 steps, saw 285441 distinct states, run finished after 3001 ms. (steps per millisecond=676 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-15 22:07:15] [INFO ] Computed 1044 place invariants in 29 ms
[2023-03-15 22:07:15] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:07:15] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 173 ms returned sat
[2023-03-15 22:07:16] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:07:16] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 22:07:16] [INFO ] After 770ms 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 210 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 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 32 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-15 22:07:16] [INFO ] Invariant cache hit.
[2023-03-15 22:07:17] [INFO ] Implicit Places using invariants in 1200 ms returned []
[2023-03-15 22:07:17] [INFO ] Invariant cache hit.
[2023-03-15 22:07:20] [INFO ] Implicit Places using invariants and state equation in 2220 ms returned []
Implicit Place search using SMT with State Equation took 3422 ms to find 0 implicit places.
[2023-03-15 22:07:20] [INFO ] Invariant cache hit.
[2023-03-15 22:07:20] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3856 ms. Remains : 1338/1338 places, 296/296 transitions.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
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 160 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 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2014032 steps, run timeout after 3001 ms. (steps per millisecond=671 ) properties seen :{}
Probabilistic random walk after 2014032 steps, saw 283535 distinct states, run finished after 3001 ms. (steps per millisecond=671 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:07:23] [INFO ] Invariant cache hit.
[2023-03-15 22:07:24] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:07:24] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 171 ms returned sat
[2023-03-15 22:07:24] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:07:24] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-15 22:07:24] [INFO ] After 739ms 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 2 ms. (steps per millisecond=31 )
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 215 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 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4421 reset in 208 ms.
Product exploration explored 100000 steps with 4422 reset in 226 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1338 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8689 edges and 1338 vertex of which 970 are kept as prefixes of interest. Removing 368 places using SCC suffix rule.3 ms
Discarding 368 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 970 transition count 283
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 940 transition count 223
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 940 transition count 223
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 1 with 2 rules applied. Total rules applied 69 place count 940 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 69 rules in 70 ms. Remains 940 /1338 variables (removed 398) and now considering 225/296 (removed 71) transitions.
[2023-03-15 22:07:25] [INFO ] Redundant transitions in 26 ms returned [188]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 224 rows 940 cols
[2023-03-15 22:07:25] [INFO ] Computed 720 place invariants in 4 ms
[2023-03-15 22:07:26] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/1338 places, 224/296 transitions.
Graph (complete) has 8955 edges and 940 vertex of which 597 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.2 ms
Discarding 343 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 597 transition count 224
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 597 transition count 224
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 20 place count 580 transition count 190
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 37 place count 580 transition count 190
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 37 rules in 33 ms. Remains 580 /940 variables (removed 360) and now considering 190/224 (removed 34) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 580/1338 places, 190/296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 414 ms. Remains : 580/1338 places, 190/296 transitions.
Support contains 2 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 26 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-15 22:07:26] [INFO ] Computed 1044 place invariants in 26 ms
[2023-03-15 22:07:27] [INFO ] Implicit Places using invariants in 1226 ms returned []
[2023-03-15 22:07:27] [INFO ] Invariant cache hit.
[2023-03-15 22:07:29] [INFO ] Implicit Places using invariants and state equation in 2280 ms returned []
Implicit Place search using SMT with State Equation took 3507 ms to find 0 implicit places.
[2023-03-15 22:07:29] [INFO ] Invariant cache hit.
[2023-03-15 22:07:30] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3942 ms. Remains : 1338/1338 places, 296/296 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-14 finished in 22589 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(((p1 U (p2||G(p1)))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F((p1||G(p2))))))'
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-18-LTLCardinality-10
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1318 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.7 ms
Discarding 43 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1315 transition count 291
Applied a total of 5 rules in 75 ms. Remains 1315 /1361 variables (removed 46) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1315 cols
[2023-03-15 22:07:30] [INFO ] Computed 1026 place invariants in 17 ms
[2023-03-15 22:07:31] [INFO ] Implicit Places using invariants in 1217 ms returned []
[2023-03-15 22:07:31] [INFO ] Invariant cache hit.
[2023-03-15 22:07:33] [INFO ] Implicit Places using invariants and state equation in 2053 ms returned [810, 1154, 1155, 1156, 1157, 1158, 1159, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1275, 1276, 1277, 1278, 1281]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 3273 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1295/1361 places, 291/296 transitions.
Applied a total of 0 rules in 42 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3391 ms. Remains : 1295/1361 places, 291/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-10 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 (LEQ s1277 s66) (LEQ 2 s0))], 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 4211 reset in 246 ms.
Product exploration explored 100000 steps with 4209 reset in 251 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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 185 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 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 420 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2487800 steps, run timeout after 3001 ms. (steps per millisecond=828 ) properties seen :{}
Probabilistic random walk after 2487800 steps, saw 345513 distinct states, run finished after 3001 ms. (steps per millisecond=828 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 291 rows 1295 cols
[2023-03-15 22:07:38] [INFO ] Computed 1008 place invariants in 69 ms
[2023-03-15 22:07:38] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:07:38] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 159 ms returned sat
[2023-03-15 22:07:38] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:07:39] [INFO ] After 630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-15 22:07:39] [INFO ] After 987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
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 189 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 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 24 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-15 22:07:39] [INFO ] Invariant cache hit.
[2023-03-15 22:07:40] [INFO ] Implicit Places using invariants in 1178 ms returned []
[2023-03-15 22:07:40] [INFO ] Invariant cache hit.
[2023-03-15 22:07:42] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned []
Implicit Place search using SMT with State Equation took 3272 ms to find 0 implicit places.
[2023-03-15 22:07:42] [INFO ] Invariant cache hit.
[2023-03-15 22:07:43] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3702 ms. Remains : 1295/1295 places, 291/291 transitions.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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 142 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 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 422 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2477117 steps, run timeout after 3001 ms. (steps per millisecond=825 ) properties seen :{}
Probabilistic random walk after 2477117 steps, saw 344167 distinct states, run finished after 3001 ms. (steps per millisecond=825 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:07:46] [INFO ] Invariant cache hit.
[2023-03-15 22:07:46] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:07:47] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 166 ms returned sat
[2023-03-15 22:07:47] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:07:47] [INFO ] After 519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-15 22:07:47] [INFO ] After 1002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 2 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 188 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 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 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 4215 reset in 239 ms.
Product exploration explored 100000 steps with 4201 reset in 251 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 40 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-15 22:07:48] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 22:07:48] [INFO ] Invariant cache hit.
[2023-03-15 22:07:49] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 458 ms. Remains : 1295/1295 places, 291/291 transitions.
Support contains 3 out of 1295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 33 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-15 22:07:49] [INFO ] Invariant cache hit.
[2023-03-15 22:07:50] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2023-03-15 22:07:50] [INFO ] Invariant cache hit.
[2023-03-15 22:07:52] [INFO ] Implicit Places using invariants and state equation in 2072 ms returned []
Implicit Place search using SMT with State Equation took 3193 ms to find 0 implicit places.
[2023-03-15 22:07:52] [INFO ] Invariant cache hit.
[2023-03-15 22:07:52] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3626 ms. Remains : 1295/1295 places, 291/291 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-10 finished in 22584 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(p0)||X(G(!p0))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-18-LTLCardinality-14
Stuttering acceptance computed with spot in 159 ms :[true, p0, (NOT p0), false, false]
Support contains 2 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 971 are kept as prefixes of interest. Removing 390 places using SCC suffix rule.5 ms
Discarding 390 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 970 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 940 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 940 transition count 222
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 1 with 4 rules applied. Total rules applied 71 place count 938 transition count 220
Applied a total of 71 rules in 65 ms. Remains 938 /1361 variables (removed 423) and now considering 220/296 (removed 76) transitions.
// Phase 1: matrix 220 rows 938 cols
[2023-03-15 22:07:53] [INFO ] Computed 720 place invariants in 9 ms
[2023-03-15 22:07:53] [INFO ] Implicit Places using invariants in 717 ms returned []
[2023-03-15 22:07:53] [INFO ] Invariant cache hit.
[2023-03-15 22:07:55] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned [413, 757, 758, 759, 760, 761, 762, 765, 766, 767, 768, 769, 770, 771, 772, 898, 899, 900, 901, 904]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 2220 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 918/1361 places, 220/296 transitions.
Applied a total of 0 rules in 23 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2309 ms. Remains : 918/1361 places, 220/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s854 s720)], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4155 reset in 235 ms.
Product exploration explored 100000 steps with 4156 reset in 251 ms.
Computed a total of 918 stabilizing places and 220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 918 transition count 220
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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10003 steps, including 383 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2678029 steps, run timeout after 3001 ms. (steps per millisecond=892 ) properties seen :{}
Probabilistic random walk after 2678029 steps, saw 369659 distinct states, run finished after 3001 ms. (steps per millisecond=892 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 918 cols
[2023-03-15 22:07:59] [INFO ] Computed 702 place invariants in 9 ms
[2023-03-15 22:07:59] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:07:59] [INFO ] [Nat]Absence check using 0 positive and 702 generalized place invariants in 108 ms returned sat
[2023-03-15 22:07:59] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:07:59] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-15 22:08:00] [INFO ] After 537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 83 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 2 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 199 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 64 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 918 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 15 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-15 22:08:00] [INFO ] Invariant cache hit.
[2023-03-15 22:08:01] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-15 22:08:01] [INFO ] Invariant cache hit.
[2023-03-15 22:08:02] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2023-03-15 22:08:02] [INFO ] Invariant cache hit.
[2023-03-15 22:08:02] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2362 ms. Remains : 918/918 places, 220/220 transitions.
Computed a total of 918 stabilizing places and 220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 918 transition count 220
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 183 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 64 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 387 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2659016 steps, run timeout after 3001 ms. (steps per millisecond=886 ) properties seen :{}
Probabilistic random walk after 2659016 steps, saw 367217 distinct states, run finished after 3001 ms. (steps per millisecond=886 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:08:06] [INFO ] Invariant cache hit.
[2023-03-15 22:08:06] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:08:06] [INFO ] [Nat]Absence check using 0 positive and 702 generalized place invariants in 106 ms returned sat
[2023-03-15 22:08:06] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:08:06] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-15 22:08:06] [INFO ] After 526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 77 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=77 )
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 224 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 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4150 reset in 247 ms.
Product exploration explored 100000 steps with 4158 reset in 250 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 27 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-15 22:08:07] [INFO ] Redundant transitions in 21 ms returned [183]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 219 rows 918 cols
[2023-03-15 22:08:07] [INFO ] Computed 702 place invariants in 3 ms
[2023-03-15 22:08:08] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 918/918 places, 219/220 transitions.
Graph (complete) has 8857 edges and 918 vertex of which 575 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.2 ms
Discarding 343 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 575 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 575 transition count 219
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 20 place count 558 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 37 place count 558 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 37 rules in 16 ms. Remains 558 /918 variables (removed 360) and now considering 185/219 (removed 34) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 558/918 places, 185/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 373 ms. Remains : 558/918 places, 185/220 transitions.
Support contains 2 out of 918 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 13 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
// Phase 1: matrix 220 rows 918 cols
[2023-03-15 22:08:08] [INFO ] Computed 702 place invariants in 6 ms
[2023-03-15 22:08:09] [INFO ] Implicit Places using invariants in 712 ms returned []
[2023-03-15 22:08:09] [INFO ] Invariant cache hit.
[2023-03-15 22:08:10] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 2115 ms to find 0 implicit places.
[2023-03-15 22:08:10] [INFO ] Invariant cache hit.
[2023-03-15 22:08:10] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2403 ms. Remains : 918/918 places, 220/220 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-14 finished in 17766 ms.
[2023-03-15 22:08:10] [INFO ] Flatten gal took : 47 ms
[2023-03-15 22:08:10] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-15 22:08:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1361 places, 296 transitions and 3082 arcs took 4 ms.
Total runtime 229268 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-PT-18
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678918327348

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 12 (type SKEL/SRCH) for 6 QuasiCertifProtocol-PT-18-LTLCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 13 (type SKEL/SRCH) for 9 QuasiCertifProtocol-PT-18-LTLCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 7 (type EXCL) for 6 QuasiCertifProtocol-PT-18-LTLCardinality-10
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 12 (type SKEL/SRCH) for QuasiCertifProtocol-PT-18-LTLCardinality-10
lola: result : false
lola: markings : 25303
lola: fired transitions : 108086
lola: time used : 0.000000
lola: memory pages used : 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/900 4/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 353837 m, 70767 m/sec, 2374950 t fired, .
13 LTL SRCH 5/3600 1/5 QuasiCertifProtocol-PT-18-LTLCardinality-14 1121222 m, 224244 m/sec, 6494791 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/900 7/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 694872 m, 68207 m/sec, 4733437 t fired, .
13 LTL SRCH 10/3600 1/5 QuasiCertifProtocol-PT-18-LTLCardinality-14 2310433 m, 237842 m/sec, 13227605 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 2 of 4 Visible: 4
lola: FINISHED task # 13 (type SKEL/SRCH) for QuasiCertifProtocol-PT-18-LTLCardinality-14
lola: result : false
lola: markings : 3177538
lola: fired transitions : 18678034
lola: time used : 14.000000
lola: memory pages used : 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/900 10/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 1009274 m, 62880 m/sec, 7049927 t fired, .

Time elapsed: 15 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/900 12/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 1318661 m, 61877 m/sec, 9344286 t fired, .

Time elapsed: 20 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/900 15/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 1617262 m, 59720 m/sec, 11629858 t fired, .

Time elapsed: 25 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/900 17/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 1889724 m, 54492 m/sec, 13780838 t fired, .

Time elapsed: 30 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/900 19/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 2138252 m, 49705 m/sec, 15912452 t fired, .

Time elapsed: 35 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/900 20/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 2349515 m, 42252 m/sec, 18047428 t fired, .

Time elapsed: 40 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/900 23/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 2617765 m, 53650 m/sec, 20268426 t fired, .

Time elapsed: 45 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/900 25/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 2926636 m, 61774 m/sec, 22547155 t fired, .

Time elapsed: 50 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/900 28/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 3255194 m, 65711 m/sec, 24838928 t fired, .

Time elapsed: 55 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 60/900 31/32 QuasiCertifProtocol-PT-18-LTLCardinality-10 3554106 m, 59782 m/sec, 27093012 t fired, .

Time elapsed: 60 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for QuasiCertifProtocol-PT-18-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 QuasiCertifProtocol-PT-18-LTLCardinality-14
lola: time limit : 1178 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1178 4/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 367311 m, 73462 m/sec, 2453524 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1178 7/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 707707 m, 68079 m/sec, 4840829 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1178 10/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 1029606 m, 64379 m/sec, 7180928 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1178 12/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 1336120 m, 61302 m/sec, 9492559 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/1178 15/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 1647004 m, 62176 m/sec, 11845724 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/1178 17/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 1927526 m, 56104 m/sec, 14095150 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 35/1178 19/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 2178568 m, 50208 m/sec, 16314281 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 40/1178 21/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 2389734 m, 42233 m/sec, 18483694 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 45/1178 23/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 2682803 m, 58613 m/sec, 20791723 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 50/1178 26/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 3020370 m, 67513 m/sec, 23157922 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 55/1178 29/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 3327820 m, 61490 m/sec, 25450908 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 60/1178 32/32 QuasiCertifProtocol-PT-18-LTLCardinality-14 3641502 m, 62736 m/sec, 27773861 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for QuasiCertifProtocol-PT-18-LTLCardinality-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-PT-18-LTLCardinality-01
lola: time limit : 1735 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1735 4/32 QuasiCertifProtocol-PT-18-LTLCardinality-01 296961 m, 59392 m/sec, 1250652 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1735 9/32 QuasiCertifProtocol-PT-18-LTLCardinality-01 671350 m, 74877 m/sec, 3068226 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 4 (type EXCL) for QuasiCertifProtocol-PT-18-LTLCardinality-01
lola: result : true
lola: markings : 709044
lola: fired transitions : 3306780
lola: time used : 10.000000
lola: memory pages used : 9
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-PT-18-LTLCardinality-00
lola: time limit : 3460 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3460 3/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 264734 m, 52946 m/sec, 1822914 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3460 5/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 552167 m, 57486 m/sec, 3885123 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3460 7/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 834993 m, 56565 m/sec, 5962746 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3460 9/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 1043365 m, 41674 m/sec, 8051237 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3460 10/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 1244066 m, 40140 m/sec, 10154200 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3460 12/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 1429893 m, 37165 m/sec, 12254008 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3460 13/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 1642632 m, 42547 m/sec, 14357981 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3460 15/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 1884616 m, 48396 m/sec, 16412396 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3460 16/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 2051276 m, 33332 m/sec, 18511841 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3460 18/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 2250808 m, 39906 m/sec, 20579589 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3460 19/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 2409513 m, 31741 m/sec, 22684536 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3460 21/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 2662492 m, 50595 m/sec, 24727161 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3460 23/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 2944202 m, 56342 m/sec, 26709593 t fired, .

Time elapsed: 205 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3460 25/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 3213186 m, 53796 m/sec, 28742145 t fired, .

Time elapsed: 210 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3460 27/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 3439308 m, 45224 m/sec, 30782637 t fired, .

Time elapsed: 215 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3460 28/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 3618749 m, 35888 m/sec, 32858359 t fired, .

Time elapsed: 220 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3460 30/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 3815946 m, 39439 m/sec, 34916609 t fired, .

Time elapsed: 225 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3460 31/32 QuasiCertifProtocol-PT-18-LTLCardinality-00 4003096 m, 37430 m/sec, 37003411 t fired, .

Time elapsed: 230 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for QuasiCertifProtocol-PT-18-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 235 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-18-LTLCardinality-00: LTL unknown AGGR
QuasiCertifProtocol-PT-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-PT-18-LTLCardinality-10: LTL unknown AGGR
QuasiCertifProtocol-PT-18-LTLCardinality-14: LTL unknown AGGR


Time elapsed: 235 secs. Pages in use: 32

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-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is QuasiCertifProtocol-PT-18, 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 r295-tall-167873948500883"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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