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-165281572300435.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-0200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572300435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 202K Apr 29 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 976K Apr 29 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 117K Apr 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 872K Apr 29 14:47 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 85K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 278K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 37K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 197K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 38K 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 228K 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-0200-LTLCardinality-00
FORMULA_NAME Referendum-PT-0200-LTLCardinality-01
FORMULA_NAME Referendum-PT-0200-LTLCardinality-02
FORMULA_NAME Referendum-PT-0200-LTLCardinality-03
FORMULA_NAME Referendum-PT-0200-LTLCardinality-04
FORMULA_NAME Referendum-PT-0200-LTLCardinality-05
FORMULA_NAME Referendum-PT-0200-LTLCardinality-06
FORMULA_NAME Referendum-PT-0200-LTLCardinality-07
FORMULA_NAME Referendum-PT-0200-LTLCardinality-08
FORMULA_NAME Referendum-PT-0200-LTLCardinality-09
FORMULA_NAME Referendum-PT-0200-LTLCardinality-10
FORMULA_NAME Referendum-PT-0200-LTLCardinality-11
FORMULA_NAME Referendum-PT-0200-LTLCardinality-12
FORMULA_NAME Referendum-PT-0200-LTLCardinality-13
FORMULA_NAME Referendum-PT-0200-LTLCardinality-14
FORMULA_NAME Referendum-PT-0200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653083693216

Running Version 202205111006
[2022-05-20 21:54:54] [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:54:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:54:55] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2022-05-20 21:54:55] [INFO ] Transformed 601 places.
[2022-05-20 21:54:55] [INFO ] Transformed 401 transitions.
[2022-05-20 21:54:55] [INFO ] Found NUPN structural information;
[2022-05-20 21:54:55] [INFO ] Parsed PT model containing 601 places and 401 transitions in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Referendum-PT-0200-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 601 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Applied a total of 0 rules in 10 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 601 cols
[2022-05-20 21:54:55] [INFO ] Computed 200 place invariants in 20 ms
[2022-05-20 21:54:55] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 401 rows 601 cols
[2022-05-20 21:54:55] [INFO ] Computed 200 place invariants in 6 ms
[2022-05-20 21:54:55] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 601 cols
[2022-05-20 21:54:55] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 21:54:56] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/601 places, 401/401 transitions.
Support contains 601 out of 601 places after structural reductions.
[2022-05-20 21:54:56] [INFO ] Flatten gal took : 68 ms
[2022-05-20 21:54:56] [INFO ] Flatten gal took : 34 ms
[2022-05-20 21:54:56] [INFO ] Input system was already deterministic with 401 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 401 rows 601 cols
[2022-05-20 21:54:56] [INFO ] Computed 200 place invariants in 5 ms
[2022-05-20 21:54:57] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA Referendum-PT-0200-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 601 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 601 transition count 401
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' '!(X(G(p0)))'
Support contains 400 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 401 transition count 401
Applied a total of 200 rules in 8 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:54:57] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:54:57] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:54:57] [INFO ] Computed 0 place invariants in 10 ms
[2022-05-20 21:54:57] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:54:57] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-20 21:54:57] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s2...], 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 2 ms.
FORMULA Referendum-PT-0200-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-01 finished in 697 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 201 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 600 rules applied. Total rules applied 600 place count 201 transition count 201
Applied a total of 600 rules in 3 ms. Remains 201 /601 variables (removed 400) and now considering 201/401 (removed 200) transitions.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:58] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:58] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:54:58] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 201 cols
[2022-05-20 21:54:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:54:58] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/601 places, 201/401 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/601 places, 201/401 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(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 s37...], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1357 ms.
Product exploration explored 100000 steps with 33333 reset in 1082 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 : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0200-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-02 finished in 3058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0) U (X(F(p1))||G(p2))))))'
Support contains 600 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 601 cols
[2022-05-20 21:55:01] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:55:01] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 401 rows 601 cols
[2022-05-20 21:55:01] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:55:01] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 601 cols
[2022-05-20 21:55:01] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 21:55:01] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ (ADD s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 725 reset in 3941 ms.
Product exploration explored 100000 steps with 725 reset in 4716 ms.
Computed a total of 601 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 601 transition count 401
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 p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 12 factoid took 332 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0200-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-03 finished in 10069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(G(X((X(p0) U p1))))||F(p2))))))'
Support contains 201 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 401 transition count 401
Applied a total of 200 rules in 28 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:55:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:55:11] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:55:11] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:55:11] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:55:11] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:55:11] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p2:(EQ s0 1), p1:(LEQ 2 (ADD s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 495 reset in 2425 ms.
Product exploration explored 100000 steps with 495 reset in 2235 ms.
Computed a total of 401 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 401 transition count 401
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 p2 (NOT p1) p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 290 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:55:17] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 21:55:17] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:55:18] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (OR (AND p2 (NOT p0)) (AND p2 p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) p1)), (F (NOT p2)), (F (NOT (AND p2 p0 (NOT p1)))), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 402 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p2 (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p2 (NOT p1))]
Support contains 201 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 401 transition count 401
Applied a total of 1 rules in 70 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:55:18] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:55:18] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:55:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:55:19] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2022-05-20 21:55:19] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:55:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:55:19] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/401 places, 401/401 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 401/401 transitions.
Computed a total of 401 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 401 transition count 401
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 p2 (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) p1))), (X (X (NOT (OR (AND p0 (NOT p2)) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 386 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Finished random walk after 5 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) p1))), (X (X (NOT (OR (AND p0 (NOT p2)) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1)))), (F (OR (NOT p0) p1)), (F (OR (AND p0 (NOT p2)) p1)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 799 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), false]
Product exploration explored 100000 steps with 988 reset in 3868 ms.
Product exploration explored 100000 steps with 972 reset in 3033 ms.
Built C files in :
/tmp/ltsmin5785843581516245670
[2022-05-20 21:55:28] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2022-05-20 21:55:28] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:55:28] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2022-05-20 21:55:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:55:28] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2022-05-20 21:55:28] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:55:28] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5785843581516245670
Running compilation step : cd /tmp/ltsmin5785843581516245670;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1004 ms.
Running link step : cd /tmp/ltsmin5785843581516245670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin5785843581516245670;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10201192607349552280.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 201 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 15 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:55:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:55:43] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:55:43] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:55:43] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2022-05-20 21:55:43] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:55:43] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:55:43] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 401/401 transitions.
Built C files in :
/tmp/ltsmin108784223621959830
[2022-05-20 21:55:43] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2022-05-20 21:55:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:55:43] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2022-05-20 21:55:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:55:43] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2022-05-20 21:55:43] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:55:43] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin108784223621959830
Running compilation step : cd /tmp/ltsmin108784223621959830;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 836 ms.
Running link step : cd /tmp/ltsmin108784223621959830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin108784223621959830;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15547424608410213609.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 21:55:58] [INFO ] Flatten gal took : 33 ms
[2022-05-20 21:55:58] [INFO ] Flatten gal took : 25 ms
[2022-05-20 21:55:58] [INFO ] Time to serialize gal into /tmp/LTL3975713232960398509.gal : 16 ms
[2022-05-20 21:55:58] [INFO ] Time to serialize properties into /tmp/LTL13758916085553486156.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3975713232960398509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13758916085553486156.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3975713...267
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(G(X((X("(((((((((voted_yes_1+voted_yes_2)+(voted_yes_3+voted_yes_4))+((voted_yes_5+voted_yes_6)+(voted_yes_7+voted_yes_8))...6269
Formula 0 simplified : !XXF(FGX(X"(((((((((voted_yes_1+voted_yes_2)+(voted_yes_3+voted_yes_4))+((voted_yes_5+voted_yes_6)+(voted_yes_7+voted_yes_8)))+(((vo...6250
Reverse transition relation is NOT exact ! Due to transitions t201, t202, t203, t204, t205, t206, t207, t208, t209, t210, t211, t212, t213, t214, t215, t21...1368
Computing Next relation with stutter on 1.60694e+60 deadlock states
Detected timeout of ITS tools.
[2022-05-20 21:56:14] [INFO ] Flatten gal took : 52 ms
[2022-05-20 21:56:14] [INFO ] Applying decomposition
[2022-05-20 21:56:14] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3898483030194837689.txt' '-o' '/tmp/graph3898483030194837689.bin' '-w' '/tmp/graph3898483030194837689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3898483030194837689.bin' '-l' '-1' '-v' '-w' '/tmp/graph3898483030194837689.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:56:14] [INFO ] Decomposing Gal with order
[2022-05-20 21:56:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:56:14] [INFO ] Removed a total of 104 redundant transitions.
[2022-05-20 21:56:14] [INFO ] Flatten gal took : 137 ms
[2022-05-20 21:56:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 17 ms.
[2022-05-20 21:56:14] [INFO ] Time to serialize gal into /tmp/LTL6357689012373576421.gal : 4 ms
[2022-05-20 21:56:14] [INFO ] Time to serialize properties into /tmp/LTL9446124801989201046.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6357689012373576421.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9446124801989201046.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6357689...266
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(G(X((X("(((((((((gu4.voted_yes_1+gu4.voted_yes_2)+(gu4.voted_yes_3+gu4.voted_yes_4))+((gu4.voted_yes_5+gu4.voted_yes_6)+(g...7877
Formula 0 simplified : !XXF(FGX(X"(((((((((gu4.voted_yes_1+gu4.voted_yes_2)+(gu4.voted_yes_3+gu4.voted_yes_4))+((gu4.voted_yes_5+gu4.voted_yes_6)+(gu4.vote...7858
Reverse transition relation is NOT exact ! Due to transitions gu0.t269, gu1.t369, gu2.t382, gu3.t395, gu4.t203, gu4.t205, gu4.t206, gu4.t207, gu4.t210, gu4...2264
Computing Next relation with stutter on 1.60694e+60 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17791087828412881866
[2022-05-20 21:56:29] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17791087828412881866
Running compilation step : cd /tmp/ltsmin17791087828412881866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 708 ms.
Running link step : cd /tmp/ltsmin17791087828412881866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin17791087828412881866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((<>([](X((X((LTLAPp0==true)) U (LTLAPp1==true)))))||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Referendum-PT-0200-LTLCardinality-07 finished in 93597 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&p1)))'
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 399 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 202 transition count 202
Discarding 197 places :
Symmetric choice reduction at 1 with 197 rule applications. Total rules 795 place count 5 transition count 5
Iterating global reduction 1 with 197 rules applied. Total rules applied 992 place count 5 transition count 5
Applied a total of 992 rules in 5 ms. Remains 5 /601 variables (removed 596) and now considering 5/401 (removed 396) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:56:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:44] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:56:44] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:56:44] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:56:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:44] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/601 places, 5/401 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/601 places, 5/401 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s4 0) (EQ s0 1)), p1:(OR (EQ s3 0) (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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-08 finished in 173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!X(G((F(p1)||G(p2)||p0))) U !p1)))'
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 399 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 202 transition count 202
Discarding 197 places :
Symmetric choice reduction at 1 with 197 rule applications. Total rules 795 place count 5 transition count 5
Iterating global reduction 1 with 197 rules applied. Total rules applied 992 place count 5 transition count 5
Applied a total of 992 rules in 5 ms. Remains 5 /601 variables (removed 596) and now considering 5/401 (removed 396) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:56:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:44] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:56:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:44] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 21:56:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:45] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/601 places, 5/401 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/601 places, 5/401 transitions.
Stuttering acceptance computed with spot in 157 ms :[p1, p1, (OR p1 p2 p0), p1, p2]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s0 1), p0:(OR (EQ s3 0) (EQ s0 1)), p2:(OR (EQ s0 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 43 ms.
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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 (NOT p2)), (X (NOT p1)), (F (G (NOT p1))), (F (G p0)), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0200-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-09 finished in 609 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&G(X(p1))))'
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 398 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 203 transition count 203
Discarding 197 places :
Symmetric choice reduction at 1 with 197 rule applications. Total rules 793 place count 6 transition count 6
Iterating global reduction 1 with 197 rules applied. Total rules applied 990 place count 6 transition count 6
Applied a total of 990 rules in 4 ms. Remains 6 /601 variables (removed 595) and now considering 6/401 (removed 395) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:56:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:45] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:56:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:45] [INFO ] Implicit Places using invariants and state equation in 18 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:56:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:45] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/601 places, 6/401 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/601 places, 6/401 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s0 0) (EQ s5 1)), p1:(AND (EQ s4 0) (EQ s0 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-10 finished in 146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 5 out of 601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Graph (complete) has 600 edges and 601 vertex of which 8 are kept as prefixes of interest. Removing 593 places using SCC suffix rule.2 ms
Discarding 593 places :
Also discarding 392 output transitions
Drop transitions removed 392 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 7 ms. Remains 8 /601 variables (removed 593) and now considering 8/401 (removed 393) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 21:56:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:45] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 21:56:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:45] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-20 21:56:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 21:56:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:45] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/601 places, 8/401 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/601 places, 8/401 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s7 0) (EQ s0 1)), p0:(AND (EQ s0 0) (EQ s5 1) (EQ s6 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-11 finished in 176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 398 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 203 transition count 203
Discarding 197 places :
Symmetric choice reduction at 1 with 197 rule applications. Total rules 793 place count 6 transition count 6
Iterating global reduction 1 with 197 rules applied. Total rules applied 990 place count 6 transition count 6
Applied a total of 990 rules in 5 ms. Remains 6 /601 variables (removed 595) and now considering 6/401 (removed 395) transitions.
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:56:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:45] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:56:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:45] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2022-05-20 21:56:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:45] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/601 places, 6/401 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/601 places, 6/401 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 0) (EQ s5 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][false, false]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0200-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-12 finished in 120 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(p0)))))'
Support contains 2 out of 601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Graph (complete) has 600 edges and 601 vertex of which 5 are kept as prefixes of interest. Removing 596 places using SCC suffix rule.1 ms
Discarding 596 places :
Also discarding 396 output transitions
Drop transitions removed 396 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 4 ms. Remains 4 /601 variables (removed 597) and now considering 4/401 (removed 397) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:56:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:56:46] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:56:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:56:46] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2022-05-20 21:56:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 21:56:46] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:56:46] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/601 places, 4/401 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/601 places, 4/401 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-13 finished in 89 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(G(X((X(p0) U p1))))||F(p2))))))'
[2022-05-20 21:56:46] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16230099523785917124
[2022-05-20 21:56:46] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2022-05-20 21:56:46] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:56:46] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2022-05-20 21:56:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:56:46] [INFO ] Applying decomposition
[2022-05-20 21:56:46] [INFO ] Flatten gal took : 14 ms
[2022-05-20 21:56:46] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2022-05-20 21:56:46] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:56:46] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16230099523785917124
Running compilation step : cd /tmp/ltsmin16230099523785917124;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11479051382472331605.txt' '-o' '/tmp/graph11479051382472331605.bin' '-w' '/tmp/graph11479051382472331605.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11479051382472331605.bin' '-l' '-1' '-v' '-w' '/tmp/graph11479051382472331605.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:56:46] [INFO ] Decomposing Gal with order
[2022-05-20 21:56:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:56:46] [INFO ] Flatten gal took : 341 ms
[2022-05-20 21:56:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 24 ms.
[2022-05-20 21:56:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality2157309615875477173.gal : 4 ms
[2022-05-20 21:56:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality11411967762047778085.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2157309615875477173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11411967762047778085.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(G(X((X("(((((((((gu100.voted_yes_1+gu100.voted_yes_2)+(gu100.voted_yes_3+gu100.voted_yes_4))+((gu100.voted_yes_5+gu100.vot...8681
Formula 0 simplified : !XXF(FGX(X"(((((((((gu100.voted_yes_1+gu100.voted_yes_2)+(gu100.voted_yes_3+gu100.voted_yes_4))+((gu100.voted_yes_5+gu100.voted_yes_...8662
Compilation finished in 715 ms.
Running link step : cd /tmp/ltsmin16230099523785917124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin16230099523785917124;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((<>([](X((X((LTLAPp0==true)) U (LTLAPp1==true)))))||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60694e+60 deadlock states
Detected timeout of ITS tools.
[2022-05-20 22:17:24] [INFO ] Applying decomposition
[2022-05-20 22:17:24] [INFO ] Flatten gal took : 45 ms
[2022-05-20 22:17:24] [INFO ] Decomposing Gal with order
[2022-05-20 22:17:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:17:24] [INFO ] Flatten gal took : 31 ms
[2022-05-20 22:17:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2022-05-20 22:17:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality16737976523503212011.gal : 11 ms
[2022-05-20 22:17:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality8334654042555801481.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16737976523503212011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8334654042555801481.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(G(X((X("(((((((((gu200.voted_yes_1+gu199.voted_yes_2)+(gu198.voted_yes_3+gu197.voted_yes_4))+((gu196.voted_yes_5+gu195.vot...8465
Formula 0 simplified : !XXF(FGX(X"(((((((((gu200.voted_yes_1+gu199.voted_yes_2)+(gu198.voted_yes_3+gu197.voted_yes_4))+((gu196.voted_yes_5+gu195.voted_yes_...8446
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60694e+60 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: LTL layer: formula: X(X(<>((<>([](X((X((LTLAPp0==true)) U (LTLAPp1==true)))))||<>((LTLAPp2==true))))))
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: "X(X(<>((<>([](X((X((LTLAPp0==true)) U (LTLAPp1==true)))))||<>((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: There are 405 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.055: State length is 602, there are 407 groups
pins2lts-mc-linux64( 0/ 8), 0.055: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.055: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.055: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.055: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 2.658: [Blue] ~120 levels ~960 states ~277880 transitions
pins2lts-mc-linux64( 6/ 8), 3.012: [Blue] ~202 levels ~1920 states ~331672 transitions
pins2lts-mc-linux64( 6/ 8), 3.041: [Blue] ~202 levels ~3840 states ~338544 transitions
pins2lts-mc-linux64( 6/ 8), 3.127: [Blue] ~202 levels ~7680 states ~355496 transitions
pins2lts-mc-linux64( 6/ 8), 3.415: [Blue] ~202 levels ~15360 states ~390936 transitions
pins2lts-mc-linux64( 6/ 8), 3.951: [Blue] ~202 levels ~30720 states ~472184 transitions
pins2lts-mc-linux64( 6/ 8), 4.893: [Blue] ~202 levels ~61440 states ~645848 transitions
pins2lts-mc-linux64( 6/ 8), 7.214: [Blue] ~202 levels ~122880 states ~1012280 transitions
pins2lts-mc-linux64( 3/ 8), 11.004: [Blue] ~202 levels ~245760 states ~1793480 transitions
pins2lts-mc-linux64( 3/ 8), 20.103: [Blue] ~202 levels ~491520 states ~3568936 transitions
pins2lts-mc-linux64( 7/ 8), 32.902: [Blue] ~202 levels ~983040 states ~7074680 transitions
pins2lts-mc-linux64( 5/ 8), 49.454: [Blue] ~202 levels ~1966080 states ~14631784 transitions
pins2lts-mc-linux64( 5/ 8), 72.337: [Blue] ~202 levels ~3932160 states ~31077576 transitions
pins2lts-mc-linux64( 5/ 8), 118.470: [Blue] ~202 levels ~7864320 states ~64174280 transitions
pins2lts-mc-linux64( 7/ 8), 217.255: [Blue] ~202 levels ~15728640 states ~135487608 transitions
pins2lts-mc-linux64( 3/ 8), 423.628: [Blue] ~202 levels ~31457280 states ~283739720 transitions
pins2lts-mc-linux64( 7/ 8), 851.815: [Blue] ~202 levels ~62914560 states ~593001880 transitions
pins2lts-mc-linux64( 3/ 8), 1693.103: [Blue] ~202 levels ~125829120 states ~1246775368 transitions
pins2lts-mc-linux64( 0/ 8), 1798.806: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1798.829:
pins2lts-mc-linux64( 0/ 8), 1798.829: Explored 131054852 states 1295785812 transitions, fanout: 9.887
pins2lts-mc-linux64( 0/ 8), 1798.829: Total exploration time 1798.760 sec (1798.720 sec minimum, 1798.735 sec on average)
pins2lts-mc-linux64( 0/ 8), 1798.829: States per second: 72858, Transitions per second: 720377
pins2lts-mc-linux64( 0/ 8), 1798.829:
pins2lts-mc-linux64( 0/ 8), 1798.829: State space has 131379279 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1798.829: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1798.829: blue states: 131054852 (99.75%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1798.829: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1798.829: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1798.829:
pins2lts-mc-linux64( 0/ 8), 1798.829: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1798.829:
pins2lts-mc-linux64( 0/ 8), 1798.829: Queue width: 8B, total height: 1616, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1798.829: Tree memory: 1258.3MB, 10.0 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1798.829: Tree fill ratio (roots/leafs): 97.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1798.829: Stored 403 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1798.829: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1798.829: Est. total memory use: 1258.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16230099523785917124;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((<>([](X((X((LTLAPp0==true)) U (LTLAPp1==true)))))||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16230099523785917124;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((<>([](X((X((LTLAPp0==true)) U (LTLAPp1==true)))))||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 22:38:02] [INFO ] Flatten gal took : 31 ms
[2022-05-20 22:38:02] [INFO ] Input system was already deterministic with 401 transitions.
[2022-05-20 22:38:02] [INFO ] Transformed 601 places.
[2022-05-20 22:38:02] [INFO ] Transformed 401 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 22:38:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality16155731684259233343.gal : 3 ms
[2022-05-20 22:38:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality3404134096010410214.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16155731684259233343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3404134096010410214.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F((F(G(X((X("(((((((((voted_yes_1+voted_yes_2)+(voted_yes_3+voted_yes_4))+((voted_yes_5+voted_yes_6)+(voted_yes_7+voted_yes_8))...6269
Formula 0 simplified : !XXF(FGX(X"(((((((((voted_yes_1+voted_yes_2)+(voted_yes_3+voted_yes_4))+((voted_yes_5+voted_yes_6)+(voted_yes_7+voted_yes_8)))+(((vo...6250
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60694e+60 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
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-0200"
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-0200, 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-165281572300435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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