MCC'2023- Execution of r297-tall-167873951000835

About the Execution of LTSMin+red for QuasiCertifProtocol-COL-22

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
766.743	176126.00	205026.00	1914.60	TT??FTFTTFFFFFTT	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873951000835.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 ltsminxred
Input is QuasiCertifProtocol-COL-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951000835
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:26 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 3.9K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 104K 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-COL-22-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679660774977

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 12:26:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 12:26:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 12:26:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 12:26:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 12:26:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 655 ms
[2023-03-24 12:26:18] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 12:26:18] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-24 12:26:18] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 307 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 174 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 12:26:19] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-24 12:26:19] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-24 12:26:19] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-24 12:26:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-24 12:26:20] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-24 12:26:20] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-24 12:26:20] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 5 properties in 9 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2023-03-24 12:26:20] [INFO ] Flatten gal took : 41 ms
[2023-03-24 12:26:20] [INFO ] Flatten gal took : 26 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2023-03-24 12:26:20] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 27 ms.
[2023-03-24 12:26:20] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 1386 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1964 transition count 356
Applied a total of 2 rules in 73 ms. Remains 1964 /1966 variables (removed 2) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1964 cols
[2023-03-24 12:26:20] [INFO ] Computed 1609 place invariants in 76 ms
[2023-03-24 12:26:21] [INFO ] Implicit Places using invariants in 1410 ms returned []
[2023-03-24 12:26:21] [INFO ] Invariant cache hit.
[2023-03-24 12:26:24] [INFO ] Implicit Places using invariants and state equation in 2426 ms returned []
Implicit Place search using SMT with State Equation took 3863 ms to find 0 implicit places.
[2023-03-24 12:26:24] [INFO ] Invariant cache hit.
[2023-03-24 12:26:25] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1964/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4862 ms. Remains : 1964/1966 places, 356/356 transitions.
Support contains 1386 out of 1964 places after structural reductions.
[2023-03-24 12:26:25] [INFO ] Flatten gal took : 131 ms
[2023-03-24 12:26:25] [INFO ] Flatten gal took : 80 ms
[2023-03-24 12:26:25] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 370 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 22) seen :7
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-24 12:26:26] [INFO ] Invariant cache hit.
[2023-03-24 12:26:27] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-24 12:26:27] [INFO ] [Real]Absence check using 1 positive and 1608 generalized place invariants in 386 ms returned sat
[2023-03-24 12:26:27] [INFO ] After 1288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-24 12:26:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-24 12:26:28] [INFO ] [Nat]Absence check using 1 positive and 1608 generalized place invariants in 368 ms returned sat
[2023-03-24 12:26:47] [INFO ] After 17765ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2023-03-24 12:26:52] [INFO ] After 23336ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 12:26:52] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 15 Parikh solutions to 13 different solutions.
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 13 properties in 38 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 1964 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1964 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 46 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1916 transition count 356
Applied a total of 48 rules in 244 ms. Remains 1916 /1964 variables (removed 48) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-24 12:26:53] [INFO ] Computed 1562 place invariants in 84 ms
[2023-03-24 12:26:56] [INFO ] Implicit Places using invariants in 2557 ms returned []
[2023-03-24 12:26:56] [INFO ] Invariant cache hit.
[2023-03-24 12:27:00] [INFO ] Implicit Places using invariants and state equation in 4392 ms returned []
Implicit Place search using SMT with State Equation took 6962 ms to find 0 implicit places.
[2023-03-24 12:27:00] [INFO ] Invariant cache hit.
[2023-03-24 12:27:01] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1964 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8011 ms. Remains : 1916/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s1749 s1750 s1751 s1752 s1753 s1754 s1755 s1756 s1757 s1758 s1759 s1760 s1761 s1762 s1763 s1764 s1765 s1766 s1767 s1768 s1769 s1770 s1771) (AD...], 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 3711 reset in 579 ms.
Product exploration explored 100000 steps with 3712 reset in 543 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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 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 89 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 373 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Finished Best-First random walk after 8137 steps, including 11 resets, run visited all 1 properties in 17 ms. (steps per millisecond=478 )
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 277 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 101 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-24 12:27:03] [INFO ] Invariant cache hit.
[2023-03-24 12:27:06] [INFO ] Implicit Places using invariants in 2573 ms returned []
[2023-03-24 12:27:06] [INFO ] Invariant cache hit.
[2023-03-24 12:27:10] [INFO ] Implicit Places using invariants and state equation in 4313 ms returned []
Implicit Place search using SMT with State Equation took 6906 ms to find 0 implicit places.
[2023-03-24 12:27:10] [INFO ] Invariant cache hit.
[2023-03-24 12:27:11] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7769 ms. Remains : 1916/1916 places, 356/356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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 209 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 108 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Finished Best-First random walk after 2120 steps, including 3 resets, run visited all 1 properties in 12 ms. (steps per millisecond=176 )
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 222 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 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3712 reset in 462 ms.
Product exploration explored 100000 steps with 3714 reset in 481 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 765 are kept as prefixes of interest. Removing 1151 places using SCC suffix rule.18 ms
Discarding 1151 places :
Also discarding 71 output transitions
Drop transitions removed 71 transitions
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 765 transition count 217
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 1 with 2 rules applied. Total rules applied 71 place count 765 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 71 rules in 137 ms. Remains 765 /1916 variables (removed 1151) and now considering 219/356 (removed 137) transitions.
[2023-03-24 12:27:14] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 219 rows 765 cols
[2023-03-24 12:27:14] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-24 12:27:14] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 765/1916 places, 219/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 485 ms. Remains : 765/1916 places, 219/356 transitions.
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 81 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-24 12:27:14] [INFO ] Computed 1562 place invariants in 39 ms
[2023-03-24 12:27:17] [INFO ] Implicit Places using invariants in 2690 ms returned []
[2023-03-24 12:27:17] [INFO ] Invariant cache hit.
[2023-03-24 12:27:22] [INFO ] Implicit Places using invariants and state equation in 4505 ms returned []
Implicit Place search using SMT with State Equation took 7199 ms to find 0 implicit places.
[2023-03-24 12:27:22] [INFO ] Invariant cache hit.
[2023-03-24 12:27:22] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8094 ms. Remains : 1916/1916 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-02 finished in 29906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 47 out of 1964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Graph (complete) has 15900 edges and 1964 vertex of which 1939 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.19 ms
Discarding 25 places :
Also discarding 0 output 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 1938 transition count 355
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1938 transition count 355
Applied a total of 4 rules in 338 ms. Remains 1938 /1964 variables (removed 26) and now considering 355/356 (removed 1) transitions.
// Phase 1: matrix 355 rows 1938 cols
[2023-03-24 12:27:23] [INFO ] Computed 1585 place invariants in 16 ms
[2023-03-24 12:27:25] [INFO ] Implicit Places using invariants in 2555 ms returned []
[2023-03-24 12:27:25] [INFO ] Invariant cache hit.
[2023-03-24 12:27:31] [INFO ] Implicit Places using invariants and state equation in 5271 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7841 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1915/1964 places, 355/356 transitions.
Applied a total of 0 rules in 108 ms. Remains 1915 /1915 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8288 ms. Remains : 1915/1964 places, 355/356 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s1892 s1893 s1894 s1895 s1896 s1897 s1898 s1899 s1900 s1901 s1902 s1903 s1904 s1905 s1906 s1907 s1908 s1909 s1910 s1911 s1912 s1913 s1914) s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3716 reset in 368 ms.
Product exploration explored 100000 steps with 3711 reset in 341 ms.
Computed a total of 1915 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1915 transition count 355
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 319 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 355 rows 1915 cols
[2023-03-24 12:27:33] [INFO ] Computed 1562 place invariants in 23 ms
[2023-03-24 12:27:33] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 12:27:33] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 332 ms returned sat
[2023-03-24 12:27:35] [INFO ] After 1264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 12:27:35] [INFO ] After 1890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 685 ms.
[2023-03-24 12:27:36] [INFO ] After 3257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 332 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 47 out of 1915 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1915/1915 places, 355/355 transitions.
Applied a total of 0 rules in 95 ms. Remains 1915 /1915 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2023-03-24 12:27:37] [INFO ] Invariant cache hit.
[2023-03-24 12:27:39] [INFO ] Implicit Places using invariants in 2680 ms returned []
[2023-03-24 12:27:39] [INFO ] Invariant cache hit.
[2023-03-24 12:27:44] [INFO ] Implicit Places using invariants and state equation in 4290 ms returned []
Implicit Place search using SMT with State Equation took 6973 ms to find 0 implicit places.
[2023-03-24 12:27:44] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-24 12:27:44] [INFO ] Invariant cache hit.
[2023-03-24 12:27:44] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7929 ms. Remains : 1915/1915 places, 355/355 transitions.
Computed a total of 1915 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1915 transition count 355
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 12:27:45] [INFO ] Invariant cache hit.
[2023-03-24 12:27:46] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 12:27:46] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 333 ms returned sat
[2023-03-24 12:27:47] [INFO ] After 1287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 12:27:48] [INFO ] After 1921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 693 ms.
[2023-03-24 12:27:49] [INFO ] After 3207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 336 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3713 reset in 325 ms.
Product exploration explored 100000 steps with 3716 reset in 341 ms.
Support contains 47 out of 1915 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1915/1915 places, 355/355 transitions.
Applied a total of 0 rules in 84 ms. Remains 1915 /1915 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2023-03-24 12:27:50] [INFO ] Invariant cache hit.
[2023-03-24 12:27:53] [INFO ] Implicit Places using invariants in 2434 ms returned []
[2023-03-24 12:27:53] [INFO ] Invariant cache hit.
[2023-03-24 12:27:57] [INFO ] Implicit Places using invariants and state equation in 4170 ms returned []
Implicit Place search using SMT with State Equation took 6622 ms to find 0 implicit places.
[2023-03-24 12:27:57] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-24 12:27:57] [INFO ] Invariant cache hit.
[2023-03-24 12:27:58] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7489 ms. Remains : 1915/1915 places, 355/355 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-03 finished in 35046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U X((X(G(p2)) U G(p3))))))'
Support contains 71 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 1917 transition count 356
Applied a total of 47 rules in 65 ms. Remains 1917 /1964 variables (removed 47) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2023-03-24 12:27:58] [INFO ] Computed 1563 place invariants in 119 ms
[2023-03-24 12:28:01] [INFO ] Implicit Places using invariants in 2952 ms returned []
[2023-03-24 12:28:01] [INFO ] Invariant cache hit.
[2023-03-24 12:28:05] [INFO ] Implicit Places using invariants and state equation in 4824 ms returned []
Implicit Place search using SMT with State Equation took 7779 ms to find 0 implicit places.
[2023-03-24 12:28:05] [INFO ] Invariant cache hit.
[2023-03-24 12:28:06] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1917/1964 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8753 ms. Remains : 1917/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p2)), true, (AND (NOT p3) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 4}, { cond=p3, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 p2), acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 2 s1), p1:(GT s1916 (ADD s1658 s1659 s1660 s1661 s1662 s1663 s1664 s1665 s1666 s1667 s1668 s1669 s1670 s1671 s1672 s1673 s1674 s1675 s1676 s1677 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 95 steps with 4 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-04 finished in 9182 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 552 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1916 transition count 356
Applied a total of 48 rules in 46 ms. Remains 1916 /1964 variables (removed 48) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-24 12:28:07] [INFO ] Computed 1562 place invariants in 54 ms
[2023-03-24 12:28:09] [INFO ] Implicit Places using invariants in 1945 ms returned []
[2023-03-24 12:28:09] [INFO ] Invariant cache hit.
[2023-03-24 12:28:12] [INFO ] Implicit Places using invariants and state equation in 2790 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 4738 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1964 places, 356/356 transitions.
Applied a total of 0 rules in 40 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4825 ms. Remains : 1893/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-06 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:(GT (ADD s1588 s1589 s1590 s1591 s1592 s1593 s1594 s1595 s1596 s1597 s1598 s1599 s1600 s1601 s1602 s1603 s1604 s1605 s1606 s1607 s1608 s1609 s1610) (AD...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-06 finished in 4943 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||X((X(G(p1)) U (p0&&X(G(p1)))))))))'
Support contains 70 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1916 transition count 356
Applied a total of 48 rules in 66 ms. Remains 1916 /1964 variables (removed 48) and now considering 356/356 (removed 0) transitions.
[2023-03-24 12:28:12] [INFO ] Invariant cache hit.
[2023-03-24 12:28:14] [INFO ] Implicit Places using invariants in 2560 ms returned []
[2023-03-24 12:28:14] [INFO ] Invariant cache hit.
[2023-03-24 12:28:19] [INFO ] Implicit Places using invariants and state equation in 4476 ms returned []
Implicit Place search using SMT with State Equation took 7056 ms to find 0 implicit places.
[2023-03-24 12:28:19] [INFO ] Invariant cache hit.
[2023-03-24 12:28:20] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1964 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7911 ms. Remains : 1916/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s1864 s1865 s1866 s1867 s1868 s1869 s1870 s1871 s1872 s1873 s1874 s1875 s1876 s1877 s1878 s1879 s1880 s1881 s1882 s1883 s1884 s1885 s1886) (A...], 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]]
Product exploration explored 100000 steps with 33333 reset in 849 ms.
Product exploration explored 100000 steps with 33333 reset in 832 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-07 finished in 10219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((G(F(p0)) U p0) U !p1)))'
Support contains 555 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 1917 transition count 356
Applied a total of 47 rules in 38 ms. Remains 1917 /1964 variables (removed 47) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2023-03-24 12:28:22] [INFO ] Computed 1562 place invariants in 29 ms
[2023-03-24 12:28:24] [INFO ] Implicit Places using invariants in 2096 ms returned []
[2023-03-24 12:28:24] [INFO ] Invariant cache hit.
[2023-03-24 12:28:28] [INFO ] Implicit Places using invariants and state equation in 3773 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5889 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1964 places, 356/356 transitions.
Applied a total of 0 rules in 41 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5968 ms. Remains : 1894/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) p0), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1893 s1889), p1:(AND (LEQ (ADD s1059 s1060 s1061 s1062 s1063 s1064 s1065 s1066 s1067 s1068 s1069 s1070 s1071 s1072 s1073 s1074 s1075 s1076 s1077 ...], 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 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-09 finished in 6206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 46 out of 1964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Graph (complete) has 15900 edges and 1964 vertex of which 1892 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.5 ms
Discarding 72 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 1889 transition count 351
Applied a total of 5 rules in 170 ms. Remains 1889 /1964 variables (removed 75) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2023-03-24 12:28:28] [INFO ] Computed 1540 place invariants in 34 ms
[2023-03-24 12:28:31] [INFO ] Implicit Places using invariants in 2573 ms returned []
[2023-03-24 12:28:31] [INFO ] Invariant cache hit.
[2023-03-24 12:28:35] [INFO ] Implicit Places using invariants and state equation in 4279 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 6869 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1843/1964 places, 351/356 transitions.
Applied a total of 0 rules in 96 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7136 ms. Remains : 1843/1964 places, 351/356 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s1611 s1612 s1613 s1614 s1615 s1616 s1617 s1618 s1619 s1620 s1621 s1622 s1623 s1624 s1625 s1626 s1627 s1628 s1629 s1630 s1631 s1632 s1633) (AD...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-10 finished in 7288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p1 U X(p2)))))'
Support contains 622 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1939 transition count 356
Applied a total of 25 rules in 37 ms. Remains 1939 /1964 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1939 cols
[2023-03-24 12:28:36] [INFO ] Computed 1585 place invariants in 18 ms
[2023-03-24 12:28:37] [INFO ] Implicit Places using invariants in 1842 ms returned []
[2023-03-24 12:28:37] [INFO ] Invariant cache hit.
[2023-03-24 12:28:40] [INFO ] Implicit Places using invariants and state equation in 3175 ms returned []
Implicit Place search using SMT with State Equation took 5030 ms to find 0 implicit places.
[2023-03-24 12:28:41] [INFO ] Invariant cache hit.
[2023-03-24 12:28:41] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1939/1964 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5810 ms. Remains : 1939/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 3}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(LEQ (ADD s1726 s1727 s1728 s1729 s1730 s1731 s1732 s1733 s1734 s1735 s1736 s1737 s1738 s1739 s1740 s1741 s1742 s1743 s1744 s1745 s1746 s1747 s1748) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-11 finished in 6075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(p1)))))'
Support contains 47 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1939 transition count 356
Applied a total of 25 rules in 64 ms. Remains 1939 /1964 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1939 cols
[2023-03-24 12:28:42] [INFO ] Computed 1585 place invariants in 8 ms
[2023-03-24 12:28:44] [INFO ] Implicit Places using invariants in 2387 ms returned []
[2023-03-24 12:28:44] [INFO ] Invariant cache hit.
[2023-03-24 12:28:48] [INFO ] Implicit Places using invariants and state equation in 4414 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6816 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1916/1964 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6943 ms. Remains : 1916/1964 places, 356/356 transitions.
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s1680 s1681 s1682 s1683 s1684 s1685 s1686 s1687 s1688 s1689 s1690 s1691 s1692 s1693 s1694 s1695 s1696 s1697 s1698 s1699 s1700 s1701 s1702) (A...], 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 141 steps with 38 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-12 finished in 7279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 48 out of 1964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Graph (complete) has 15900 edges and 1964 vertex of which 1917 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.12 ms
Discarding 47 places :
Also discarding 0 output 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 1916 transition count 355
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1916 transition count 355
Applied a total of 4 rules in 279 ms. Remains 1916 /1964 variables (removed 48) and now considering 355/356 (removed 1) transitions.
// Phase 1: matrix 355 rows 1916 cols
[2023-03-24 12:28:49] [INFO ] Computed 1562 place invariants in 36 ms
[2023-03-24 12:28:52] [INFO ] Implicit Places using invariants in 2673 ms returned []
[2023-03-24 12:28:52] [INFO ] Invariant cache hit.
[2023-03-24 12:28:56] [INFO ] Implicit Places using invariants and state equation in 4363 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7067 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1893/1964 places, 355/356 transitions.
Applied a total of 0 rules in 82 ms. Remains 1893 /1893 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7428 ms. Remains : 1893/1964 places, 355/356 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NOT (LEQ s1892 s1888)) (GT (ADD s1795 s1796 s1797 s1798 s1799 s1800 s1801 s1802 s1803 s1804 s1805 s1806 s1807 s1808 s1809 s1810 s1811 s1812 s1813 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-13 finished in 7602 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 24 out of 1964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Graph (complete) has 15900 edges and 1964 vertex of which 48 are kept as prefixes of interest. Removing 1916 places using SCC suffix rule.4 ms
Discarding 1916 places :
Also discarding 171 output transitions
Drop transitions removed 171 transitions
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Iterating post reduction 0 with 137 rules applied. Total rules applied 138 place count 48 transition count 48
Applied a total of 138 rules in 10 ms. Remains 48 /1964 variables (removed 1916) and now considering 48/356 (removed 308) transitions.
// Phase 1: matrix 48 rows 48 cols
[2023-03-24 12:28:56] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-24 12:28:56] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-24 12:28:56] [INFO ] Invariant cache hit.
[2023-03-24 12:28:57] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-24 12:28:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-24 12:28:57] [INFO ] Invariant cache hit.
[2023-03-24 12:28:57] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/1964 places, 48/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 48/1964 places, 48/356 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-14 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 s47 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3846 reset in 340 ms.
Product exploration explored 100000 steps with 3845 reset in 375 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 48
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-14 finished in 1129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLCardinality-02
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1964 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1964/1964 places, 356/356 transitions.
Graph (complete) has 15900 edges and 1964 vertex of which 765 are kept as prefixes of interest. Removing 1199 places using SCC suffix rule.8 ms
Discarding 1199 places :
Also discarding 71 output transitions
Drop transitions removed 71 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 764 transition count 216
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 73 place count 762 transition count 214
Applied a total of 73 rules in 58 ms. Remains 762 /1964 variables (removed 1202) and now considering 214/356 (removed 142) transitions.
// Phase 1: matrix 214 rows 762 cols
[2023-03-24 12:28:58] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-24 12:28:59] [INFO ] Implicit Places using invariants in 816 ms returned []
[2023-03-24 12:28:59] [INFO ] Invariant cache hit.
[2023-03-24 12:29:00] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned [622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 1889 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 739/1964 places, 214/356 transitions.
Applied a total of 0 rules in 13 ms. Remains 739 /739 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1961 ms. Remains : 739/1964 places, 214/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s622 s623 s624 s625 s626 s627 s628 s629 s630 s631 s632 s633 s634 s635 s636 s637 s638 s639 s640 s641 s642 s643 s644) (ADD s599 s600 s601 s602 s...], 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 3432 reset in 450 ms.
Product exploration explored 100000 steps with 3439 reset in 481 ms.
Computed a total of 739 stabilizing places and 214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 739 transition count 214
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 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 77 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 704 steps, including 21 resets, run visited all 1 properties in 8 ms. (steps per millisecond=88 )
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 209 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 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 739 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 739/739 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 739 /739 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 739 cols
[2023-03-24 12:29:02] [INFO ] Computed 528 place invariants in 2 ms
[2023-03-24 12:29:02] [INFO ] Implicit Places using invariants in 655 ms returned []
[2023-03-24 12:29:02] [INFO ] Invariant cache hit.
[2023-03-24 12:29:03] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
[2023-03-24 12:29:03] [INFO ] Invariant cache hit.
[2023-03-24 12:29:03] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1832 ms. Remains : 739/739 places, 214/214 transitions.
Computed a total of 739 stabilizing places and 214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 739 transition count 214
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 234 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 88 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 602 steps, including 18 resets, run visited all 1 properties in 8 ms. (steps per millisecond=75 )
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 190 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 76 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 3433 reset in 456 ms.
Product exploration explored 100000 steps with 3431 reset in 488 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 739 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 739/739 places, 214/214 transitions.
Applied a total of 0 rules in 12 ms. Remains 739 /739 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-24 12:29:05] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-24 12:29:06] [INFO ] Invariant cache hit.
[2023-03-24 12:29:06] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 527 ms. Remains : 739/739 places, 214/214 transitions.
Support contains 46 out of 739 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 739/739 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 739 /739 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-24 12:29:06] [INFO ] Invariant cache hit.
[2023-03-24 12:29:07] [INFO ] Implicit Places using invariants in 659 ms returned []
[2023-03-24 12:29:07] [INFO ] Invariant cache hit.
[2023-03-24 12:29:08] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
[2023-03-24 12:29:08] [INFO ] Invariant cache hit.
[2023-03-24 12:29:08] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1869 ms. Remains : 739/739 places, 214/214 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-02 finished in 10339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2023-03-24 12:29:08] [INFO ] Flatten gal took : 74 ms
[2023-03-24 12:29:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-24 12:29:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1964 places, 356 transitions and 4180 arcs took 9 ms.
Total runtime 170867 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1402/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1402/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : QuasiCertifProtocol-COL-22-LTLCardinality-02
Could not compute solution for formula : QuasiCertifProtocol-COL-22-LTLCardinality-03

BK_STOP 1679660951103

--------------------
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
mcc2023
ltl formula name QuasiCertifProtocol-COL-22-LTLCardinality-02
ltl formula formula --ltl=/tmp/1402/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1964 places, 356 transitions and 4180 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.030 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1402/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1402/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1402/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1402/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name QuasiCertifProtocol-COL-22-LTLCardinality-03
ltl formula formula --ltl=/tmp/1402/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1964 places, 356 transitions and 4180 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1402/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1402/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1402/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1402/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (!prev)

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-COL-22"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is QuasiCertifProtocol-COL-22, 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 r297-tall-167873951000835"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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