Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662362200387.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r329-tall-171662362200387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 119K Apr 11 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 85K Apr 11 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 626K Apr 11 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 125K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 417K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 206K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 195K Apr 11 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 939K Apr 11 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 233K Apr 11 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 52K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 228K May 18 16:43 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 1716861995920

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0200
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:06:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:06:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:06:37] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-28 02:06:37] [INFO ] Transformed 601 places.
[2024-05-28 02:06:37] [INFO ] Transformed 401 transitions.
[2024-05-28 02:06:37] [INFO ] Found NUPN structural information;
[2024-05-28 02:06:37] [INFO ] Parsed PT model containing 601 places and 401 transitions and 1001 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 49 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Referendum-PT-0200-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-11 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 11 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 601 cols
[2024-05-28 02:06:38] [INFO ] Computed 200 invariants in 18 ms
[2024-05-28 02:06:38] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-28 02:06:38] [INFO ] Invariant cache hit.
[2024-05-28 02:06:38] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2024-05-28 02:06:38] [INFO ] Invariant cache hit.
[2024-05-28 02:06:39] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 866 ms. Remains : 601/601 places, 401/401 transitions.
Support contains 601 out of 601 places after structural reductions.
[2024-05-28 02:06:39] [INFO ] Flatten gal took : 65 ms
[2024-05-28 02:06:39] [INFO ] Flatten gal took : 31 ms
[2024-05-28 02:06:39] [INFO ] Input system was already deterministic with 401 transitions.
Finished random walk after 359 steps, including 1 resets, run visited all 20 properties in 1233 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 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).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||((p1 U p2)&&(p2 U (p3&&F(!p0)))))))'
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 13 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-28 02:06:41] [INFO ] Invariant cache hit.
[2024-05-28 02:06:41] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-28 02:06:41] [INFO ] Invariant cache hit.
[2024-05-28 02:06:41] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-28 02:06:41] [INFO ] Invariant cache hit.
[2024-05-28 02:06:41] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 628 ms. Remains : 601/601 places, 401/401 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 455 ms :[true, (NOT p2), (OR (NOT p3) p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), p0]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p3), acceptance={0} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=4 dest: 6}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=p0, acceptance={0} source=8 dest: 8}]], initial=3, 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, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 8 ms.
FORMULA Referendum-PT-0200-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-00 finished in 1162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U (p2 U X(X(p3))))&&p0)))'
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 6 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-28 02:06:42] [INFO ] Invariant cache hit.
[2024-05-28 02:06:42] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 02:06:42] [INFO ] Invariant cache hit.
[2024-05-28 02:06:42] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-28 02:06:42] [INFO ] Invariant cache hit.
[2024-05-28 02:06:42] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 645 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
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=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 6}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 6}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=6 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=7 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (LEQ 3 (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...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8420 reset in 4970 ms.
Product exploration explored 100000 steps with 8385 reset in 5068 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 (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 4525 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 390 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 933 ms. (steps per millisecond=10 ) properties (out of 18) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-28 02:07:00] [INFO ] Invariant cache hit.
[2024-05-28 02:07:01] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2024-05-28 02:07:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2024-05-28 02:07:04] [INFO ] After 2938ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2024-05-28 02:07:05] [INFO ] After 3815ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 2081 ms.
[2024-05-28 02:07:07] [INFO ] After 6078ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 201 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 14 ms.
Support contains 600 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 401/401 transitions.
Applied a total of 0 rules in 11 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 601/601 places, 401/401 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Finished probabilistic random walk after 50123 steps, run visited all 2 properties in 1450 ms. (steps per millisecond=34 )
Probabilistic random walk after 50123 steps, saw 49871 distinct states, run finished after 1453 ms. (steps per millisecond=34 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p1) p2 p0 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND (NOT p1) p2 (NOT p3))), (F (NOT (AND p1 (NOT p3)))), (F (AND (NOT p1) p2 p0)), (F (AND p1 p0 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F p0), (F (OR (AND (NOT p1) p2 (NOT p3)) (AND p2 (NOT p0) (NOT p3)))), (F (AND p1 p0)), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 33 factoid took 20143 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 375 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
[2024-05-28 02:07:30] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2024-05-28 02:07:31] [INFO ] Invariant cache hit.
[2024-05-28 02:07:32] [INFO ] [Real]Absence check using 200 positive place invariants in 30 ms returned sat
[2024-05-28 02:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:07:32] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-28 02:07:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:07:33] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2024-05-28 02:07:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 02:07:33] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-28 02:07:33] [INFO ] Computed and/alt/rep : 400/400/400 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-28 02:07:34] [INFO ] Added : 0 causal constraints over 0 iterations in 69 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
[2024-05-28 02:07:34] [INFO ] Invariant cache hit.
[2024-05-28 02:07:35] [INFO ] [Real]Absence check using 200 positive place invariants in 58 ms returned sat
[2024-05-28 02:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:07:35] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2024-05-28 02:07:35] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (AND p1 (NOT p3))
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p1) p2 p0 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND (NOT p1) p2 (NOT p3))), (F (NOT (AND p1 (NOT p3)))), (F (AND (NOT p1) p2 p0)), (F (AND p1 p0 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F p0), (F (OR (AND (NOT p1) p2 (NOT p3)) (AND p2 (NOT p0) (NOT p3)))), (F (AND p1 p0)), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))))), (F (AND (NOT p1) p2)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 33 factoid took 21859 ms. Reduced automaton from 8 states, 26 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-02 finished in 82395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1 U p2))))'
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 6 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-28 02:08:04] [INFO ] Invariant cache hit.
[2024-05-28 02:08:04] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-28 02:08:04] [INFO ] Invariant cache hit.
[2024-05-28 02:08:05] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-28 02:08:05] [INFO ] Invariant cache hit.
[2024-05-28 02:08:05] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (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=[p2:(LEQ (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 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2351 ms.
Product exploration explored 100000 steps with 50000 reset in 2408 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 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-03 finished in 5714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U (p1&&F(p2))))))'
Support contains 600 out of 601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Applied a total of 0 rules in 14 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-28 02:08:10] [INFO ] Invariant cache hit.
[2024-05-28 02:08:10] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 02:08:10] [INFO ] Invariant cache hit.
[2024-05-28 02:08:10] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-28 02:08:10] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-28 02:08:10] [INFO ] Invariant cache hit.
[2024-05-28 02:08:11] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 660 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (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 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 731 reset in 6657 ms.
Product exploration explored 100000 steps with 733 reset in 6790 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 p1 p0 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 587 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-04 finished in 15092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))&&F(p1)) U X(X(G(p2)))))'
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 9 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-05-28 02:08:25] [INFO ] Computed 0 invariants in 2 ms
[2024-05-28 02:08:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 02:08:25] [INFO ] Invariant cache hit.
[2024-05-28 02:08:25] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-28 02:08:25] [INFO ] Invariant cache hit.
[2024-05-28 02:08:25] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 401/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=4, aps=[p1:(LEQ 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 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29708 reset in 2871 ms.
Product exploration explored 100000 steps with 29553 reset in 2951 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 (NOT p1) (NOT p0) p2), (X p2), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 333 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:08:33] [INFO ] Invariant cache hit.
[2024-05-28 02:08:33] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) p2))), (F p1), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 914 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 400 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-28 02:08:34] [INFO ] Invariant cache hit.
[2024-05-28 02:08:34] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 02:08:34] [INFO ] Invariant cache hit.
[2024-05-28 02:08:34] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-28 02:08:34] [INFO ] Invariant cache hit.
[2024-05-28 02:08:35] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. 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 (NOT p1) p2 (NOT p0)), (X p2), (X p1), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 271 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 199 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p2) (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 563 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 29528 reset in 2726 ms.
Product exploration explored 100000 steps with 29673 reset in 2783 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 400 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 5 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-28 02:08:43] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-28 02:08:43] [INFO ] Invariant cache hit.
[2024-05-28 02:08:43] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 401/401 places, 401/401 transitions.
Built C files in :
/tmp/ltsmin17294408196620361712
[2024-05-28 02:08:43] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17294408196620361712
Running compilation step : cd /tmp/ltsmin17294408196620361712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 630 ms.
Running link step : cd /tmp/ltsmin17294408196620361712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17294408196620361712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased668752643420098679.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 400 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 1 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-28 02:08:58] [INFO ] Invariant cache hit.
[2024-05-28 02:08:58] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 02:08:58] [INFO ] Invariant cache hit.
[2024-05-28 02:08:58] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-28 02:08:58] [INFO ] Invariant cache hit.
[2024-05-28 02:08:59] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 401/401 places, 401/401 transitions.
Built C files in :
/tmp/ltsmin14027606863057720155
[2024-05-28 02:08:59] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14027606863057720155
Running compilation step : cd /tmp/ltsmin14027606863057720155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 558 ms.
Running link step : cd /tmp/ltsmin14027606863057720155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14027606863057720155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15870359732925547141.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:09:14] [INFO ] Flatten gal took : 23 ms
[2024-05-28 02:09:14] [INFO ] Flatten gal took : 19 ms
[2024-05-28 02:09:14] [INFO ] Time to serialize gal into /tmp/LTL11247739589233390001.gal : 5 ms
[2024-05-28 02:09:14] [INFO ] Time to serialize properties into /tmp/LTL6370246633316909847.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11247739589233390001.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16169005266923440553.hoa' '-atoms' '/tmp/LTL6370246633316909847.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6370246633316909847.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16169005266923440553.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1253
Computing Next relation with stutter on 1.60694e+60 deadlock states
Detected timeout of ITS tools.
[2024-05-28 02:09:29] [INFO ] Flatten gal took : 17 ms
[2024-05-28 02:09:29] [INFO ] Flatten gal took : 17 ms
[2024-05-28 02:09:29] [INFO ] Time to serialize gal into /tmp/LTL9070568183758470935.gal : 3 ms
[2024-05-28 02:09:29] [INFO ] Time to serialize properties into /tmp/LTL4925701803918449813.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9070568183758470935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4925701803918449813.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((G(F("(((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((voted_no_9+vo...8342
Formula 0 simplified : (FG!"(((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((voted_no_9+voted...8327
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1253
Computing Next relation with stutter on 1.60694e+60 deadlock states
Detected timeout of ITS tools.
[2024-05-28 02:09:44] [INFO ] Flatten gal took : 15 ms
[2024-05-28 02:09:44] [INFO ] Applying decomposition
[2024-05-28 02:09:44] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11813255946713726236.txt' '-o' '/tmp/graph11813255946713726236.bin' '-w' '/tmp/graph11813255946713726236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11813255946713726236.bin' '-l' '-1' '-v' '-w' '/tmp/graph11813255946713726236.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:09:44] [INFO ] Decomposing Gal with order
[2024-05-28 02:09:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:09:45] [INFO ] Flatten gal took : 238 ms
[2024-05-28 02:09:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 02:09:45] [INFO ] Time to serialize gal into /tmp/LTL7932452579010306380.gal : 4 ms
[2024-05-28 02:09:45] [INFO ] Time to serialize properties into /tmp/LTL15909371369210995831.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7932452579010306380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15909371369210995831.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((G(F("(((((((((gu1.voted_no_1+gu1.voted_no_2)+(gu1.voted_no_3+gu1.voted_no_4))+((gu1.voted_no_5+gu1.voted_no_6)+(gu1.voted_no_7+gu...10742
Formula 0 simplified : (FG!"(((((((((gu1.voted_no_1+gu1.voted_no_2)+(gu1.voted_no_3+gu1.voted_no_4))+((gu1.voted_no_5+gu1.voted_no_6)+(gu1.voted_no_7+gu1.v...10727
Reverse transition relation is NOT exact ! Due to transitions gu0.t0, gu0.t1, gu0.t2, gu0.t3, gu0.t4, gu0.t5, gu0.t6, gu0.t7, gu0.t8, gu0.t9, gu0.t10, gu0....2053
Computing Next relation with stutter on 1.60694e+60 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15010267720273729323
[2024-05-28 02:10:00] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15010267720273729323
Running compilation step : cd /tmp/ltsmin15010267720273729323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 556 ms.
Running link step : cd /tmp/ltsmin15010267720273729323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15010267720273729323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))) U X(X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Referendum-PT-0200-LTLCardinality-05 finished in 109803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p0)||X(p1)))&&F(G(!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 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 34 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
[2024-05-28 02:10:15] [INFO ] Invariant cache hit.
[2024-05-28 02:10:15] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 02:10:15] [INFO ] Invariant cache hit.
[2024-05-28 02:10:15] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-28 02:10:15] [INFO ] Invariant cache hit.
[2024-05-28 02:10:15] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 401/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), p0, (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT 3 (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 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4602 steps with 57 reset in 118 ms.
FORMULA Referendum-PT-0200-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-06 finished in 897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||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 9 ms. Remains 6 /601 variables (removed 595) and now considering 6/401 (removed 395) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-28 02:10:16] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:10:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:10:16] [INFO ] Invariant cache hit.
[2024-05-28 02:10:16] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-28 02:10:16] [INFO ] Invariant cache hit.
[2024-05-28 02:10:16] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/601 places, 6/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 6/601 places, 6/401 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s5 0) (EQ s4 1)), p1:(OR (EQ s5 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 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 161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 3 are kept as prefixes of interest. Removing 598 places using SCC suffix rule.1 ms
Discarding 598 places :
Also discarding 398 output transitions
Drop transitions removed 398 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Applied a total of 2 rules in 5 ms. Remains 3 /601 variables (removed 598) and now considering 3/401 (removed 398) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-28 02:10:16] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:10:16] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-28 02:10:16] [INFO ] Invariant cache hit.
[2024-05-28 02:10:16] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2024-05-28 02:10:16] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:10:16] [INFO ] Invariant cache hit.
[2024-05-28 02:10:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/601 places, 3/401 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 3/601 places, 3/401 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s2 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 86 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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 p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-10 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 4 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 397 places and 0 transitions.
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 0 with 594 rules applied. Total rules applied 594 place count 204 transition count 204
Discarding 195 places :
Symmetric choice reduction at 1 with 195 rule applications. Total rules 789 place count 9 transition count 9
Iterating global reduction 1 with 195 rules applied. Total rules applied 984 place count 9 transition count 9
Applied a total of 984 rules in 8 ms. Remains 9 /601 variables (removed 592) and now considering 9/401 (removed 392) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-28 02:10:16] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:10:16] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-28 02:10:16] [INFO ] Invariant cache hit.
[2024-05-28 02:10:16] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-28 02:10:16] [INFO ] Invariant cache hit.
[2024-05-28 02:10:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9/601 places, 9/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 9/601 places, 9/401 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (EQ s5 0) (EQ s8 1)), p0:(AND (NEQ s6 0) (NEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-14 finished in 191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))&&F(p1)) U X(X(G(p2)))))'
Found a Lengthening insensitive property : Referendum-PT-0200-LTLCardinality-05
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Support contains 400 out of 601 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Graph (complete) has 600 edges and 601 vertex of which 401 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.3 ms
Discarding 200 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-05-28 02:10:17] [INFO ] Computed 0 invariants in 3 ms
[2024-05-28 02:10:17] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 02:10:17] [INFO ] Invariant cache hit.
[2024-05-28 02:10:17] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-28 02:10:17] [INFO ] Invariant cache hit.
[2024-05-28 02:10:17] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 387 ms. Remains : 401/601 places, 401/401 transitions.
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=4, aps=[p1:(LEQ 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 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29619 reset in 2840 ms.
Product exploration explored 100000 steps with 29603 reset in 2924 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 (NOT p1) (NOT p0) p2), (X p2), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 337 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:10:24] [INFO ] Invariant cache hit.
[2024-05-28 02:10:24] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) p2))), (F p1), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 922 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 400 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-28 02:10:26] [INFO ] Invariant cache hit.
[2024-05-28 02:10:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 02:10:26] [INFO ] Invariant cache hit.
[2024-05-28 02:10:26] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-28 02:10:26] [INFO ] Invariant cache hit.
[2024-05-28 02:10:26] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. 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 (NOT p1) p2 (NOT p0)), (X p2), (X p1), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 264 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 199 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p2) (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 591 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 29586 reset in 2713 ms.
Product exploration explored 100000 steps with 29671 reset in 2800 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 400 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 11 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-28 02:10:34] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 02:10:34] [INFO ] Invariant cache hit.
[2024-05-28 02:10:34] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 401/401 places, 401/401 transitions.
Built C files in :
/tmp/ltsmin15793251734912467994
[2024-05-28 02:10:34] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15793251734912467994
Running compilation step : cd /tmp/ltsmin15793251734912467994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 560 ms.
Running link step : cd /tmp/ltsmin15793251734912467994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15793251734912467994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12503025394894214829.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 400 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-28 02:10:49] [INFO ] Invariant cache hit.
[2024-05-28 02:10:50] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-28 02:10:50] [INFO ] Invariant cache hit.
[2024-05-28 02:10:50] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-28 02:10:50] [INFO ] Invariant cache hit.
[2024-05-28 02:10:50] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 401/401 places, 401/401 transitions.
Built C files in :
/tmp/ltsmin11247628986516840412
[2024-05-28 02:10:50] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11247628986516840412
Running compilation step : cd /tmp/ltsmin11247628986516840412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 552 ms.
Running link step : cd /tmp/ltsmin11247628986516840412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11247628986516840412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10311876049901778044.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:11:05] [INFO ] Flatten gal took : 14 ms
[2024-05-28 02:11:05] [INFO ] Flatten gal took : 14 ms
[2024-05-28 02:11:05] [INFO ] Time to serialize gal into /tmp/LTL14407614809355579767.gal : 2 ms
[2024-05-28 02:11:05] [INFO ] Time to serialize properties into /tmp/LTL18399679472115841950.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14407614809355579767.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14800432175950682045.hoa' '-atoms' '/tmp/LTL18399679472115841950.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18399679472115841950.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14800432175950682045.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1253
Computing Next relation with stutter on 1.60694e+60 deadlock states
Detected timeout of ITS tools.
[2024-05-28 02:11:20] [INFO ] Flatten gal took : 13 ms
[2024-05-28 02:11:20] [INFO ] Flatten gal took : 12 ms
[2024-05-28 02:11:20] [INFO ] Time to serialize gal into /tmp/LTL15896797153879145207.gal : 2 ms
[2024-05-28 02:11:20] [INFO ] Time to serialize properties into /tmp/LTL113394892076824296.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15896797153879145207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL113394892076824296.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((G(F("(((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((voted_no_9+vo...8342
Formula 0 simplified : (FG!"(((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((voted_no_9+voted...8327
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1253
Computing Next relation with stutter on 1.60694e+60 deadlock states
Detected timeout of ITS tools.
[2024-05-28 02:11:35] [INFO ] Flatten gal took : 14 ms
[2024-05-28 02:11:35] [INFO ] Applying decomposition
[2024-05-28 02:11:35] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12529578112059425573.txt' '-o' '/tmp/graph12529578112059425573.bin' '-w' '/tmp/graph12529578112059425573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12529578112059425573.bin' '-l' '-1' '-v' '-w' '/tmp/graph12529578112059425573.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:11:35] [INFO ] Decomposing Gal with order
[2024-05-28 02:11:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:11:35] [INFO ] Flatten gal took : 90 ms
[2024-05-28 02:11:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 02:11:36] [INFO ] Time to serialize gal into /tmp/LTL5746725895222178218.gal : 3 ms
[2024-05-28 02:11:36] [INFO ] Time to serialize properties into /tmp/LTL18005776364733697546.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5746725895222178218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18005776364733697546.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((G(F("(((((((((gu1.voted_no_1+gu1.voted_no_2)+(gu1.voted_no_3+gu1.voted_no_4))+((gu1.voted_no_5+gu1.voted_no_6)+(gu1.voted_no_7+gu...10742
Formula 0 simplified : (FG!"(((((((((gu1.voted_no_1+gu1.voted_no_2)+(gu1.voted_no_3+gu1.voted_no_4))+((gu1.voted_no_5+gu1.voted_no_6)+(gu1.voted_no_7+gu1.v...10727
Reverse transition relation is NOT exact ! Due to transitions gu0.t0, gu0.t1, gu0.t2, gu0.t3, gu0.t4, gu0.t5, gu0.t6, gu0.t7, gu0.t8, gu0.t9, gu0.t10, gu0....2053
Computing Next relation with stutter on 1.60694e+60 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6919667601374459747
[2024-05-28 02:11:51] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6919667601374459747
Running compilation step : cd /tmp/ltsmin6919667601374459747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 545 ms.
Running link step : cd /tmp/ltsmin6919667601374459747;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6919667601374459747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))) U X(X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Referendum-PT-0200-LTLCardinality-05 finished in 109359 ms.
[2024-05-28 02:12:06] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7657201848105494672
[2024-05-28 02:12:06] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2024-05-28 02:12:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:12:06] [INFO ] Applying decomposition
[2024-05-28 02:12:06] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2024-05-28 02:12:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:12:06] [INFO ] Flatten gal took : 16 ms
[2024-05-28 02:12:06] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2024-05-28 02:12:06] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:12:06] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7657201848105494672
Running compilation step : cd /tmp/ltsmin7657201848105494672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13923043050565930536.txt' '-o' '/tmp/graph13923043050565930536.bin' '-w' '/tmp/graph13923043050565930536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13923043050565930536.bin' '-l' '-1' '-v' '-w' '/tmp/graph13923043050565930536.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:12:06] [INFO ] Decomposing Gal with order
[2024-05-28 02:12:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:12:06] [INFO ] Flatten gal took : 74 ms
[2024-05-28 02:12:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 02:12:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality16109296469209953438.gal : 3 ms
[2024-05-28 02:12:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality10859907697246660020.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16109296469209953438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10859907697246660020.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((((G(F("(((((((((gu1.voted_no_1+gu1.voted_no_2)+(gu1.voted_no_3+gu1.voted_no_4))+((gu1.voted_no_5+gu1.voted_no_6)+(gu1.voted_no_7+gu...10742
Formula 0 simplified : (FG!"(((((((((gu1.voted_no_1+gu1.voted_no_2)+(gu1.voted_no_3+gu1.voted_no_4))+((gu1.voted_no_5+gu1.voted_no_6)+(gu1.voted_no_7+gu1.v...10727
Compilation finished in 887 ms.
Running link step : cd /tmp/ltsmin7657201848105494672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7657201848105494672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))) U X(X([]((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
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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: LTL layer: formula: (([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))) U X(X([]((LTLAPp2==true)))))
pins2lts-mc-linux64( 2/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: "(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))) U X(X([]((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: buchi has 9 states
pins2lts-mc-linux64( 5/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.129: There are 405 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.129: State length is 602, there are 418 groups
pins2lts-mc-linux64( 0/ 8), 0.129: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.129: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.129: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.129: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.379: [Blue] ~8 levels ~960 states ~31688 transitions
pins2lts-mc-linux64( 5/ 8), 0.402: [Blue] ~8 levels ~1920 states ~31688 transitions
pins2lts-mc-linux64( 5/ 8), 0.471: [Blue] ~8 levels ~3840 states ~34808 transitions
pins2lts-mc-linux64( 7/ 8), 0.593: [Blue] ~8 levels ~7680 states ~37928 transitions
pins2lts-mc-linux64( 5/ 8), 0.778: [Blue] ~8 levels ~15360 states ~44168 transitions
pins2lts-mc-linux64( 4/ 8), 1.202: [Blue] ~8 levels ~30720 states ~59768 transitions
pins2lts-mc-linux64( 1/ 8), 1.995: [Blue] ~14 levels ~61440 states ~129128 transitions
pins2lts-mc-linux64( 1/ 8), 3.353: [Blue] ~14 levels ~122880 states ~195656 transitions
pins2lts-mc-linux64( 1/ 8), 6.076: [Blue] ~14 levels ~245760 states ~346856 transitions
pins2lts-mc-linux64( 1/ 8), 11.219: [Blue] ~14 levels ~491520 states ~779288 transitions
pins2lts-mc-linux64( 1/ 8), 21.380: [Blue] ~15 levels ~983040 states ~1756248 transitions
pins2lts-mc-linux64( 1/ 8), 41.761: [Blue] ~17 levels ~1966080 states ~3795496 transitions
pins2lts-mc-linux64( 1/ 8), 82.007: [Blue] ~21 levels ~3932160 states ~7937672 transitions
pins2lts-mc-linux64( 1/ 8), 161.602: [Blue] ~28 levels ~7864320 states ~15598920 transitions
pins2lts-mc-linux64( 1/ 8), 317.788: [Blue] ~46 levels ~15728640 states ~31524792 transitions
pins2lts-mc-linux64( 4/ 8), 545.017: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 549.419:
pins2lts-mc-linux64( 0/ 8), 549.419: Explored 24885196 states 49894126 transitions, fanout: 2.005
pins2lts-mc-linux64( 0/ 8), 549.419: Total exploration time 549.260 sec (544.870 sec minimum, 546.843 sec on average)
pins2lts-mc-linux64( 0/ 8), 549.419: States per second: 45307, Transitions per second: 90839
pins2lts-mc-linux64( 0/ 8), 549.419:
pins2lts-mc-linux64( 0/ 8), 549.419: State space has 25220757 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 549.419: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 549.419: blue states: 24885196 (98.67%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 549.419: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 549.419: all-red states: 24884665 (98.67%), bogus 1 (0.00%)
pins2lts-mc-linux64( 0/ 8), 549.419:
pins2lts-mc-linux64( 0/ 8), 549.419: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 549.419:
pins2lts-mc-linux64( 0/ 8), 549.419: Queue width: 8B, total height: 538, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 549.419: Tree memory: 448.4MB, 18.6 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 549.419: Tree fill ratio (roots/leafs): 18.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 549.419: Stored 404 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 549.419: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 549.419: Est. total memory use: 448.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7657201848105494672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))) U X(X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7657201848105494672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))) U X(X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 02:33:56] [INFO ] Applying decomposition
[2024-05-28 02:33:56] [INFO ] Flatten gal took : 13 ms
[2024-05-28 02:33:56] [INFO ] Decomposing Gal with order
[2024-05-28 02:33:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:33:56] [INFO ] Flatten gal took : 17 ms
[2024-05-28 02:33:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-28 02:33:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality4106767886824669648.gal : 3 ms
[2024-05-28 02:33:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality9303516660616494131.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4106767886824669648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9303516660616494131.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((((G(F("(((((((((gu200.voted_no_1+gu199.voted_no_2)+(gu198.voted_no_3+gu197.voted_no_4))+((gu196.voted_no_5+gu195.voted_no_6)+(gu194...11618
Formula 0 simplified : (FG!"(((((((((gu200.voted_no_1+gu199.voted_no_2)+(gu198.voted_no_3+gu197.voted_no_4))+((gu196.voted_no_5+gu195.voted_no_6)+(gu194.vo...11603
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.
[2024-05-28 02:55:45] [INFO ] Flatten gal took : 14 ms
[2024-05-28 02:55:45] [INFO ] Input system was already deterministic with 401 transitions.
[2024-05-28 02:55:45] [INFO ] Transformed 601 places.
[2024-05-28 02:55:45] [INFO ] Transformed 401 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-28 02:55:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality5749334713458170411.gal : 3 ms
[2024-05-28 02:55:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality6144012378455082002.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5749334713458170411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6144012378455082002.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((G(F("(((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((voted_no_9+vo...8342
Formula 0 simplified : (FG!"(((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((voted_no_9+voted...8327
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60694e+60 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9791092 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16142272 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r329-tall-171662362200387"
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 ;