Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572200427.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-PT-0100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572200427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 54K Apr 29 14:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 274K Apr 29 14:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 29 14:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 225K Apr 29 14:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 45K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 164K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 107K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 113K May 10 09:34 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 Referendum-PT-0100-LTLCardinality-00
FORMULA_NAME Referendum-PT-0100-LTLCardinality-01
FORMULA_NAME Referendum-PT-0100-LTLCardinality-02
FORMULA_NAME Referendum-PT-0100-LTLCardinality-03
FORMULA_NAME Referendum-PT-0100-LTLCardinality-04
FORMULA_NAME Referendum-PT-0100-LTLCardinality-05
FORMULA_NAME Referendum-PT-0100-LTLCardinality-06
FORMULA_NAME Referendum-PT-0100-LTLCardinality-07
FORMULA_NAME Referendum-PT-0100-LTLCardinality-08
FORMULA_NAME Referendum-PT-0100-LTLCardinality-09
FORMULA_NAME Referendum-PT-0100-LTLCardinality-10
FORMULA_NAME Referendum-PT-0100-LTLCardinality-11
FORMULA_NAME Referendum-PT-0100-LTLCardinality-12
FORMULA_NAME Referendum-PT-0100-LTLCardinality-13
FORMULA_NAME Referendum-PT-0100-LTLCardinality-14
FORMULA_NAME Referendum-PT-0100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653083633950

Running Version 202205111006
[2022-05-20 21:53:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 21:53:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:53:55] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-20 21:53:55] [INFO ] Transformed 301 places.
[2022-05-20 21:53:55] [INFO ] Transformed 201 transitions.
[2022-05-20 21:53:55] [INFO ] Found NUPN structural information;
[2022-05-20 21:53:55] [INFO ] Parsed PT model containing 301 places and 201 transitions in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Referendum-PT-0100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 301 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:53:55] [INFO ] Computed 100 place invariants in 14 ms
[2022-05-20 21:53:55] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:53:55] [INFO ] Computed 100 place invariants in 8 ms
[2022-05-20 21:53:56] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:53:56] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-20 21:53:56] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 201/201 transitions.
Support contains 301 out of 301 places after structural reductions.
[2022-05-20 21:53:56] [INFO ] Flatten gal took : 42 ms
[2022-05-20 21:53:56] [INFO ] Flatten gal took : 20 ms
[2022-05-20 21:53:56] [INFO ] Input system was already deterministic with 201 transitions.
Finished random walk after 198 steps, including 1 resets, run visited all 21 properties in 53 ms. (steps per millisecond=3 )
FORMULA Referendum-PT-0100-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 301 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 301 transition count 201
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(F(F(p0))))&&X(X(p1)))))'
Support contains 200 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 201 transition count 201
Applied a total of 100 rules in 3 ms. Remains 201 /301 variables (removed 100) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:53:56] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:53:56] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:53:56] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-20 21:53:57] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:53:57] [INFO ] Computed 0 place invariants in 9 ms
[2022-05-20 21:53:57] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/301 places, 201/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 980 reset in 999 ms.
Product exploration explored 100000 steps with 980 reset in 925 ms.
Computed a total of 201 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 201 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (AND p1 (NOT p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 66 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p1 p0), (X (X (AND p1 (NOT p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 200 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:00] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:00] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:00] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:00] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:00] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:54:00] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 201/201 transitions.
Computed a total of 201 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 201 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 65 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=13 )
Knowledge obtained : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 4 ms.
FORMULA Referendum-PT-0100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-00 finished in 4762 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(X(p0) U p0))||X(X(X(p1)))))'
Support contains 201 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 13 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:54:01] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-20 21:54:01] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:54:01] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-20 21:54:01] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:54:01] [INFO ] Computed 100 place invariants in 4 ms
[2022-05-20 21:54:02] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 378 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}], [{ cond=p0, acceptance={0} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 5}, { cond=p0, acceptance={0} source=8 dest: 8}]], initial=6, aps=[p0:(LEQ 3 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 834 ms.
Product exploration explored 100000 steps with 50000 reset in 653 ms.
Computed a total of 301 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 301 transition count 201
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 p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 9 states, 14 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0100-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLCardinality-01 finished in 2547 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U F(!(F(G(F(p0))) U G(p1)))))'
Support contains 201 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 24 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:54:04] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-20 21:54:04] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:54:04] [INFO ] Computed 100 place invariants in 5 ms
[2022-05-20 21:54:04] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2022-05-20 21:54:04] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:54:04] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-20 21:54:04] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 208 ms :[p1, p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s0 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 3 ms.
FORMULA Referendum-PT-0100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-02 finished in 780 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((!(p0 U p1)&&p2))))'
Support contains 301 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:54:04] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-20 21:54:05] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:54:05] [INFO ] Computed 100 place invariants in 6 ms
[2022-05-20 21:54:05] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 301 cols
[2022-05-20 21:54:05] [INFO ] Computed 100 place invariants in 9 ms
[2022-05-20 21:54:05] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 104 steps with 1 reset in 15 ms.
FORMULA Referendum-PT-0100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-03 finished in 683 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||p1))&&F(X(F(X(p0))))))'
Support contains 201 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 201 transition count 201
Applied a total of 100 rules in 3 ms. Remains 201 /301 variables (removed 100) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:05] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:05] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:54:05] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:05] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/301 places, 201/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GT 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-05 finished in 538 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((F(p0) U !F(p1))) U p2)&&F(G(p2)))))'
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 298 rules applied. Total rules applied 298 place count 102 transition count 102
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 394 place count 6 transition count 6
Iterating global reduction 1 with 96 rules applied. Total rules applied 490 place count 6 transition count 6
Applied a total of 490 rules in 9 ms. Remains 6 /301 variables (removed 295) and now considering 6/201 (removed 195) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:54:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:06] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:54:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:06] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:54:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:06] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/301 places, 6/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/301 places, 6/201 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), p1]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s0 0) (EQ s5 1)), p1:(OR (EQ s3 0) (EQ s0 1)), p0:(EQ s4 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]]
Product exploration explored 100000 steps with 980 reset in 139 ms.
Product exploration explored 100000 steps with 980 reset in 113 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
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 p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (G p2)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 9 factoid took 347 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0100-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLCardinality-10 finished in 1091 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(!p0) U F(p0)))||X(G(p1)))))'
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 296 place count 103 transition count 103
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 393 place count 6 transition count 6
Iterating global reduction 1 with 97 rules applied. Total rules applied 490 place count 6 transition count 6
Applied a total of 490 rules in 3 ms. Remains 6 /301 variables (removed 295) and now considering 6/201 (removed 195) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:54:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:07] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:54:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:07] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:54:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/301 places, 6/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/301 places, 6/201 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s0 0) (EQ s4 1)), p1:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
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 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0100-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLCardinality-11 finished in 520 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||F(F(p0))))'
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Graph (complete) has 300 edges and 301 vertex of which 2 are kept as prefixes of interest. Removing 299 places using SCC suffix rule.1 ms
Discarding 299 places :
Also discarding 198 output transitions
Drop transitions removed 198 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 5 ms. Remains 2 /301 variables (removed 299) and now considering 2/201 (removed 199) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:07] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:07] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-20 21:54:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:54:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/301 places, 2/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/301 places, 2/201 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 44 ms.
Product exploration explored 100000 steps with 50000 reset in 53 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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 p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0100-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLCardinality-12 finished in 333 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Graph (complete) has 300 edges and 301 vertex of which 8 are kept as prefixes of interest. Removing 293 places using SCC suffix rule.0 ms
Discarding 293 places :
Also discarding 192 output transitions
Drop transitions removed 192 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 8
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 8 transition count 8
Applied a total of 3 rules in 6 ms. Remains 8 /301 variables (removed 293) and now considering 8/201 (removed 193) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-20 21:54:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/301 places, 8/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/301 places, 8/201 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s4 0) (EQ s7 1)) (AND (EQ s6 0) (EQ s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 1 ms.
FORMULA Referendum-PT-0100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-13 finished in 120 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 298 rules applied. Total rules applied 298 place count 102 transition count 102
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 396 place count 4 transition count 4
Iterating global reduction 1 with 98 rules applied. Total rules applied 494 place count 4 transition count 4
Applied a total of 494 rules in 2 ms. Remains 4 /301 variables (removed 297) and now considering 4/201 (removed 197) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/301 places, 4/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/301 places, 4/201 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-14 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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 106 steps with 1 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-14 finished in 254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (X(X(F(p1)))||F(p0)))))'
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 298 rules applied. Total rules applied 298 place count 102 transition count 102
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 396 place count 4 transition count 4
Iterating global reduction 1 with 98 rules applied. Total rules applied 494 place count 4 transition count 4
Applied a total of 494 rules in 2 ms. Remains 4 /301 variables (removed 297) and now considering 4/201 (removed 197) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:54:08] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:54:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/301 places, 4/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/301 places, 4/201 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s0 1)), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 48 ms.
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0100-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLCardinality-15 finished in 471 ms.
All properties solved by simple procedures.
Total runtime 13679 ms.

BK_STOP 1653083649425

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Referendum-PT-0100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Referendum-PT-0100, 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 r186-tajo-165281572200427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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