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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 300K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 78K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679666319984

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-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 13:58:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 13:58:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 13:58:42] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-24 13:58:42] [INFO ] Transformed 270 places.
[2023-03-24 13:58:42] [INFO ] Transformed 116 transitions.
[2023-03-24 13:58:42] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 141 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Applied a total of 0 rules in 15 ms. Remains 270 /270 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 270 cols
[2023-03-24 13:58:42] [INFO ] Computed 155 place invariants in 28 ms
[2023-03-24 13:58:42] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-24 13:58:42] [INFO ] Invariant cache hit.
[2023-03-24 13:58:43] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2023-03-24 13:58:43] [INFO ] Invariant cache hit.
[2023-03-24 13:58:43] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 964 ms. Remains : 270/270 places, 116/116 transitions.
Support contains 141 out of 270 places after structural reductions.
[2023-03-24 13:58:43] [INFO ] Flatten gal took : 43 ms
[2023-03-24 13:58:43] [INFO ] Flatten gal took : 17 ms
[2023-03-24 13:58:43] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 984 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 27) seen :6
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-24 13:58:44] [INFO ] Invariant cache hit.
[2023-03-24 13:58:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-24 13:58:44] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 24 ms returned sat
[2023-03-24 13:58:44] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:19
[2023-03-24 13:58:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-24 13:58:44] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 23 ms returned sat
[2023-03-24 13:58:45] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :15
[2023-03-24 13:58:45] [INFO ] After 1140ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :15
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-24 13:58:46] [INFO ] After 1822ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :15
Fused 21 Parikh solutions to 13 different solutions.
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 15 properties in 15 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 270 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 270 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 253 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.3 ms
Discarding 17 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 250 transition count 113
Applied a total of 5 rules in 41 ms. Remains 250 /270 variables (removed 20) and now considering 113/116 (removed 3) transitions.
// Phase 1: matrix 113 rows 250 cols
[2023-03-24 13:58:46] [INFO ] Computed 138 place invariants in 8 ms
[2023-03-24 13:58:46] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-24 13:58:46] [INFO ] Invariant cache hit.
[2023-03-24 13:58:47] [INFO ] Implicit Places using invariants and state equation in 269 ms returned [145, 146, 147, 148, 152, 157, 158, 195, 196, 220, 221, 222, 223, 224]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 447 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/270 places, 113/116 transitions.
Applied a total of 0 rules in 10 ms. Remains 236 /236 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 498 ms. Remains : 236/270 places, 113/116 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-00 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:(LEQ s0 s235)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14738 reset in 369 ms.
Product exploration explored 100000 steps with 14732 reset in 244 ms.
Computed a total of 236 stabilizing places and 113 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 113
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), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 113 rows 236 cols
[2023-03-24 13:58:48] [INFO ] Computed 126 place invariants in 8 ms
[2023-03-24 13:58:48] [INFO ] [Real]Absence check using 0 positive and 126 generalized place invariants in 33 ms returned sat
[2023-03-24 13:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:58:48] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-24 13:58:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:58:48] [INFO ] [Nat]Absence check using 0 positive and 126 generalized place invariants in 35 ms returned sat
[2023-03-24 13:58:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:58:49] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2023-03-24 13:58:49] [INFO ] Computed and/alt/rep : 98/285/98 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-24 13:58:49] [INFO ] Added : 25 causal constraints over 5 iterations in 99 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 113/113 transitions.
Applied a total of 0 rules in 9 ms. Remains 236 /236 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-24 13:58:49] [INFO ] Invariant cache hit.
[2023-03-24 13:58:49] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-24 13:58:49] [INFO ] Invariant cache hit.
[2023-03-24 13:58:49] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-24 13:58:49] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-24 13:58:49] [INFO ] Invariant cache hit.
[2023-03-24 13:58:49] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 523 ms. Remains : 236/236 places, 113/113 transitions.
Computed a total of 236 stabilizing places and 113 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 113
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), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-24 13:58:50] [INFO ] Invariant cache hit.
[2023-03-24 13:58:50] [INFO ] [Real]Absence check using 0 positive and 126 generalized place invariants in 38 ms returned sat
[2023-03-24 13:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:58:50] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-03-24 13:58:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:58:50] [INFO ] [Nat]Absence check using 0 positive and 126 generalized place invariants in 37 ms returned sat
[2023-03-24 13:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:58:51] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2023-03-24 13:58:51] [INFO ] Computed and/alt/rep : 98/285/98 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-24 13:58:51] [INFO ] Added : 24 causal constraints over 5 iterations in 79 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14743 reset in 185 ms.
Product exploration explored 100000 steps with 14756 reset in 232 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-24 13:58:51] [INFO ] Invariant cache hit.
[2023-03-24 13:58:51] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-24 13:58:51] [INFO ] Invariant cache hit.
[2023-03-24 13:58:52] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-24 13:58:52] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-24 13:58:52] [INFO ] Invariant cache hit.
[2023-03-24 13:58:52] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 ms. Remains : 236/236 places, 113/113 transitions.
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-00 finished in 5812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&G((p1&&F(p2))))))))'
Support contains 78 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 253 transition count 116
Applied a total of 17 rules in 5 ms. Remains 253 /270 variables (removed 17) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2023-03-24 13:58:52] [INFO ] Computed 139 place invariants in 9 ms
[2023-03-24 13:58:52] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-24 13:58:52] [INFO ] Invariant cache hit.
[2023-03-24 13:58:52] [INFO ] Implicit Places using invariants and state equation in 369 ms returned [148, 149, 150, 151, 155, 160, 161]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 514 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/270 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 522 ms. Remains : 246/270 places, 116/116 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ (ADD s227 s228 s229 s230 s231 s232 s234) (ADD s205 s206 s207 s208 s233 s235 s236)), p0:(LEQ s8 (ADD s44 s45 s46 s47 s49 s50 s51)), p2:(GT (ADD s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-03 finished in 832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&X(p2))))'
Support contains 28 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 259 transition count 116
Applied a total of 11 rules in 4 ms. Remains 259 /270 variables (removed 11) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 259 cols
[2023-03-24 13:58:53] [INFO ] Computed 145 place invariants in 9 ms
[2023-03-24 13:58:53] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-24 13:58:53] [INFO ] Invariant cache hit.
[2023-03-24 13:58:53] [INFO ] Implicit Places using invariants and state equation in 272 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 435 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 442 ms. Remains : 252/270 places, 116/116 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT (ADD s35 s36 s38 s39 s40 s41 s42) (ADD s245 s246 s247 s248 s249 s250 s251)), p1:(LEQ 2 (ADD s43 s44 s45 s46 s48 s49 s50)), p2:(LEQ 2 (ADD s8 s9 s10...], 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-04 finished in 740 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)&&(!p1||X((p2||F(G(p3))))))))'
Support contains 24 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 254 transition count 116
Applied a total of 16 rules in 5 ms. Remains 254 /270 variables (removed 16) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 254 cols
[2023-03-24 13:58:53] [INFO ] Computed 139 place invariants in 3 ms
[2023-03-24 13:58:54] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-24 13:58:54] [INFO ] Invariant cache hit.
[2023-03-24 13:58:54] [INFO ] Implicit Places using invariants and state equation in 353 ms returned [149, 150, 151, 152, 156, 161, 162]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 512 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/270 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 247 /247 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 520 ms. Remains : 247/270 places, 116/116 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 5}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 2 (ADD s9 s10 s11 s12 s13 s14 s15)), p0:(LEQ s55 s8), p2:(GT (ADD s28 s29 s32 s33 s34 s35 s38) (ADD s192 s193 s217 s218 s219 s220 s221)), p3:(GT 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 7 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-05 finished in 788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 4 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-24 13:58:54] [INFO ] Computed 138 place invariants in 8 ms
[2023-03-24 13:58:54] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-24 13:58:54] [INFO ] Invariant cache hit.
[2023-03-24 13:58:55] [INFO ] Implicit Places using invariants and state equation in 279 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 439 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/270 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 446 ms. Remains : 245/270 places, 116/116 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 s46)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 3 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-08 finished in 592 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&&F(p1)&&(F(p1) U p2)))))'
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 254 transition count 116
Applied a total of 16 rules in 4 ms. Remains 254 /270 variables (removed 16) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 254 cols
[2023-03-24 13:58:55] [INFO ] Computed 139 place invariants in 3 ms
[2023-03-24 13:58:55] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-24 13:58:55] [INFO ] Invariant cache hit.
[2023-03-24 13:58:55] [INFO ] Implicit Places using invariants and state equation in 315 ms returned [149, 150, 151, 152, 156, 161, 162]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 480 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/270 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 247 /247 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 487 ms. Remains : 247/270 places, 116/116 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-10 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=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s53 s55), p1:(LEQ s48 s221), p2:(LEQ s11 s14)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 214 ms.
Product exploration explored 100000 steps with 33333 reset in 227 ms.
Computed a total of 247 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 247 transition count 116
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 p1 p2), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 (NOT p2)))))
Knowledge based reduction with 7 factoid took 177 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-10 finished in 1427 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 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 253 transition count 116
Applied a total of 17 rules in 4 ms. Remains 253 /270 variables (removed 17) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2023-03-24 13:58:56] [INFO ] Computed 139 place invariants in 4 ms
[2023-03-24 13:58:56] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-24 13:58:56] [INFO ] Invariant cache hit.
[2023-03-24 13:58:57] [INFO ] Implicit Places using invariants and state equation in 317 ms returned [148, 149, 150, 151, 155, 160, 161]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 496 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/270 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 502 ms. Remains : 246/270 places, 116/116 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-11 finished in 596 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)||G(F(p1)))))'
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 244 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.3 ms
Discarding 26 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 242 transition count 112
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 242 transition count 112
Applied a total of 4 rules in 24 ms. Remains 242 /270 variables (removed 28) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 242 cols
[2023-03-24 13:58:57] [INFO ] Computed 132 place invariants in 2 ms
[2023-03-24 13:58:57] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-24 13:58:57] [INFO ] Invariant cache hit.
[2023-03-24 13:58:57] [INFO ] Implicit Places using invariants and state equation in 250 ms returned [145, 147, 148, 152, 157, 158, 195, 196, 220, 221, 222, 223, 224]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 404 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 229/270 places, 112/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 229 /229 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 436 ms. Remains : 229/270 places, 112/116 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s145 s212), p1:(LEQ s216 s29)], 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 10242 reset in 252 ms.
Product exploration explored 100000 steps with 10243 reset in 204 ms.
Computed a total of 229 stabilizing places and 112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 229 transition count 112
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 272 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1027 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 81444 steps, run visited all 2 properties in 307 ms. (steps per millisecond=265 )
Probabilistic random walk after 81444 steps, saw 14616 distinct states, run finished after 308 ms. (steps per millisecond=264 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 317 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 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 112/112 transitions.
Applied a total of 0 rules in 12 ms. Remains 229 /229 variables (removed 0) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 229 cols
[2023-03-24 13:58:59] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-24 13:58:59] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-24 13:58:59] [INFO ] Invariant cache hit.
[2023-03-24 13:59:00] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-24 13:59:00] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-24 13:59:00] [INFO ] Invariant cache hit.
[2023-03-24 13:59:00] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 537 ms. Remains : 229/229 places, 112/112 transitions.
Computed a total of 229 stabilizing places and 112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 229 transition count 112
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 337 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1025 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Finished probabilistic random walk after 81444 steps, run visited all 2 properties in 180 ms. (steps per millisecond=452 )
Probabilistic random walk after 81444 steps, saw 14616 distinct states, run finished after 181 ms. (steps per millisecond=449 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 287 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10245 reset in 147 ms.
Product exploration explored 100000 steps with 10255 reset in 152 ms.
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 112/112 transitions.
Applied a total of 0 rules in 6 ms. Remains 229 /229 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-24 13:59:01] [INFO ] Invariant cache hit.
[2023-03-24 13:59:02] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-24 13:59:02] [INFO ] Invariant cache hit.
[2023-03-24 13:59:02] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-24 13:59:02] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-24 13:59:02] [INFO ] Invariant cache hit.
[2023-03-24 13:59:02] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 512 ms. Remains : 229/229 places, 112/112 transitions.
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-15 finished in 5138 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)))'
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)||G(F(p1)))))'
[2023-03-24 13:59:02] [INFO ] Flatten gal took : 18 ms
[2023-03-24 13:59:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-24 13:59:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 270 places, 116 transitions and 659 arcs took 2 ms.
Total runtime 21076 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1078/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1078/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : QuasiCertifProtocol-PT-06-LTLCardinality-00
Could not compute solution for formula : QuasiCertifProtocol-PT-06-LTLCardinality-15

BK_STOP 1679666344227

--------------------
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-PT-06-LTLCardinality-00
ltl formula formula --ltl=/tmp/1078/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 270 places, 116 transitions and 659 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.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1078/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1078/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1078/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1078/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name QuasiCertifProtocol-PT-06-LTLCardinality-15
ltl formula formula --ltl=/tmp/1078/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 270 places, 116 transitions and 659 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.020 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1078/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1078/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1078/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1078/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-06"
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-PT-06, 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-167873951000867"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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