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.r312-tall-171662338900619.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 itstools
Input is Referendum-PT-0200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662338900619
=====================================================================

--------------------
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 1716700330109

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-26 05:12:11] [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-26 05:12:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 05:12:11] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-26 05:12:11] [INFO ] Transformed 601 places.
[2024-05-26 05:12:11] [INFO ] Transformed 401 transitions.
[2024-05-26 05:12:11] [INFO ] Found NUPN structural information;
[2024-05-26 05:12:11] [INFO ] Parsed PT model containing 601 places and 401 transitions and 1001 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 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-26 05:12:11] [INFO ] Computed 200 invariants in 17 ms
[2024-05-26 05:12:12] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-26 05:12:12] [INFO ] Invariant cache hit.
[2024-05-26 05:12:12] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-26 05:12:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 25780 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 400/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21817 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 47766ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 47790ms
Finished structural reductions in LTL mode , in 1 iterations and 48421 ms. Remains : 601/601 places, 401/401 transitions.
Support contains 601 out of 601 places after structural reductions.
[2024-05-26 05:13:00] [INFO ] Flatten gal took : 68 ms
[2024-05-26 05:13:00] [INFO ] Flatten gal took : 36 ms
[2024-05-26 05:13:00] [INFO ] Input system was already deterministic with 401 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 4505 steps (20 resets) in 634 ms. (7 steps per ms) remains 0/19 properties
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.202405141337/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 2 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-26 05:13:01] [INFO ] Invariant cache hit.
[2024-05-26 05:13:01] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-26 05:13:01] [INFO ] Invariant cache hit.
[2024-05-26 05:13:01] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-26 05:13:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 25566 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 400/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21510 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 47167ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 47172ms
Finished structural reductions in LTL mode , in 1 iterations and 47566 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 454 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
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0200-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-00 finished in 48109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 3 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-26 05:13:49] [INFO ] Invariant cache hit.
[2024-05-26 05:13:49] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-26 05:13:49] [INFO ] Invariant cache hit.
[2024-05-26 05:13:49] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-26 05:13:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 25874 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 400/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21745 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 47696ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 47700ms
Finished structural reductions in LTL mode , in 1 iterations and 48069 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 382 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
Product exploration explored 100000 steps with 8382 reset in 4472 ms.
Product exploration explored 100000 steps with 8448 reset in 4454 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 p2), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X p1)), (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 35 factoid took 1497 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 377 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (196 resets) in 4638 ms. (8 steps per ms) remains 5/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1016 ms. (39 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1223 ms. (32 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 883 ms. (45 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 642 ms. (62 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 916 ms. (43 steps per ms) remains 5/5 properties
[2024-05-26 05:14:51] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 600/600 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/600 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/601 variables, 200/800 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 1/801 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 3 solved, 2 unsolved in 427 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 600/600 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/600 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/601 variables, 200/800 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 1/801 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 2/1404 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1404 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1404 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1404 constraints, problems are : Problem set: 3 solved, 2 unsolved in 4374 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 5563ms problems are : Problem set: 3 solved, 2 unsolved
Finished Parikh walk after 201 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=33 )
Parikh walk visited 2 properties in 182 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X p2), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X p1)), (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 (OR (NOT p0) (NOT p1) p3)), (G (OR (NOT p0) p2 p1 p3)), (G (OR (NOT p0) (NOT p2) p1 p3))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (AND (OR p0 (NOT p2) p3) (OR (NOT p2) p1 p3)))), (F p0), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p1 p3))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p3), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (F (NOT (AND p1 (NOT p3))))]
Knowledge based reduction with 38 factoid took 6232 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
[2024-05-26 05:15:04] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2024-05-26 05:15:04] [INFO ] Invariant cache hit.
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X p2), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X p1)), (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 (OR (NOT p0) (NOT p1) p3)), (G (OR (NOT p0) p2 p1 p3)), (G (OR (NOT p0) (NOT p2) p1 p3))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (AND (OR p0 (NOT p2) p3) (OR (NOT p2) p1 p3)))), (F p0), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p1 p3))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p3), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (F (NOT (AND p1 (NOT p3)))), (G (NOT p0)), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 38 factoid took 6573 ms. Reduced automaton from 8 states, 21 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 82639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 3 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-26 05:15:11] [INFO ] Invariant cache hit.
[2024-05-26 05:15:11] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-26 05:15:11] [INFO ] Invariant cache hit.
[2024-05-26 05:15:12] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-26 05:15:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 25262 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 400/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21564 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 46900ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 46909ms
Finished structural reductions in LTL mode , in 1 iterations and 47277 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 130 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
Product exploration explored 100000 steps with 50000 reset in 2229 ms.
Product exploration explored 100000 steps with 50000 reset in 2275 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 p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (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 11 factoid took 17 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 52094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 16 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-26 05:16:03] [INFO ] Invariant cache hit.
[2024-05-26 05:16:04] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-26 05:16:04] [INFO ] Invariant cache hit.
[2024-05-26 05:16:04] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-26 05:16:04] [INFO ] Redundant transitions in 19 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-26 05:16:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 25641 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 400/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21384 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 47089ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 47093ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47507 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 181 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
Product exploration explored 100000 steps with 731 reset in 5557 ms.
Product exploration explored 100000 steps with 732 reset in 5690 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 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (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 19 factoid took 207 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 59328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 13 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-05-26 05:17:03] [INFO ] Computed 0 invariants in 1 ms
[2024-05-26 05:17:03] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-26 05:17:03] [INFO ] Invariant cache hit.
[2024-05-26 05:17:03] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-26 05:17:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17233 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15581 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 32923ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 32927ms
Starting structural reductions in LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33157 ms. Remains : 401/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 313 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
Product exploration explored 100000 steps with 29666 reset in 2725 ms.
Product exploration explored 100000 steps with 29569 reset in 2785 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), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (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 343 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 275 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), (AND (NOT p0) p2), (NOT p1)]
RANDOM walk for 40000 steps (196 resets) in 1201 ms. (33 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 535 ms. (74 steps per ms) remains 1/1 properties
[2024-05-26 05:17:43] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 200/802 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Domain max(s): 0/401 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 12 factoid took 1050 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 303 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 390 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-26 05:17:45] [INFO ] Invariant cache hit.
[2024-05-26 05:17:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-26 05:17:45] [INFO ] Invariant cache hit.
[2024-05-26 05:17:45] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-26 05:17:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17032 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15727 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 32821ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 32824ms
Finished structural reductions in LTL mode , in 1 iterations and 33051 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), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X 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 9 factoid took 278 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 296 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)]
RANDOM walk for 796 steps (0 resets) in 38 ms. (20 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p2 p1))), (F p0), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 604 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 325 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 307 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 310 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 29518 reset in 2588 ms.
Product exploration explored 100000 steps with 29575 reset in 2653 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 292 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 13 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-26 05:18:26] [INFO ] Redundant transitions in 9 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-26 05:18:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17309 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15668 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 33032ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 33035ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33062 ms. Remains : 401/401 places, 401/401 transitions.
Built C files in :
/tmp/ltsmin3743774805223818210
[2024-05-26 05:18:59] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3743774805223818210
Running compilation step : cd /tmp/ltsmin3743774805223818210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 784 ms.
Running link step : cd /tmp/ltsmin3743774805223818210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3743774805223818210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1830804732173800023.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 4 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-26 05:19:14] [INFO ] Invariant cache hit.
[2024-05-26 05:19:14] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-26 05:19:14] [INFO ] Invariant cache hit.
[2024-05-26 05:19:14] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-26 05:19:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17489 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 16029 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 33580ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 33584ms
Finished structural reductions in LTL mode , in 1 iterations and 33870 ms. Remains : 401/401 places, 401/401 transitions.
Built C files in :
/tmp/ltsmin18329685946409810297
[2024-05-26 05:19:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18329685946409810297
Running compilation step : cd /tmp/ltsmin18329685946409810297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 692 ms.
Running link step : cd /tmp/ltsmin18329685946409810297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin18329685946409810297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5840173077396020372.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 05:20:03] [INFO ] Flatten gal took : 23 ms
[2024-05-26 05:20:03] [INFO ] Flatten gal took : 18 ms
[2024-05-26 05:20:03] [INFO ] Time to serialize gal into /tmp/LTL6860745956729023090.gal : 4 ms
[2024-05-26 05:20:03] [INFO ] Time to serialize properties into /tmp/LTL4539155084058220108.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6860745956729023090.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13519912365579387975.hoa' '-atoms' '/tmp/LTL4539155084058220108.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4539155084058220108.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13519912365579387975.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-26 05:20:18] [INFO ] Flatten gal took : 18 ms
[2024-05-26 05:20:18] [INFO ] Flatten gal took : 17 ms
[2024-05-26 05:20:18] [INFO ] Time to serialize gal into /tmp/LTL12524702235356824042.gal : 3 ms
[2024-05-26 05:20:18] [INFO ] Time to serialize properties into /tmp/LTL1131676818959047032.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12524702235356824042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1131676818959047032.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
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-26 05:20:33] [INFO ] Flatten gal took : 16 ms
[2024-05-26 05:20:33] [INFO ] Applying decomposition
[2024-05-26 05:20:33] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph15650819103452149397.txt' '-o' '/tmp/graph15650819103452149397.bin' '-w' '/tmp/graph15650819103452149397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15650819103452149397.bin' '-l' '-1' '-v' '-w' '/tmp/graph15650819103452149397.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:20:34] [INFO ] Decomposing Gal with order
[2024-05-26 05:20:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:20:34] [INFO ] Flatten gal took : 251 ms
[2024-05-26 05:20:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-26 05:20:34] [INFO ] Time to serialize gal into /tmp/LTL3385792710799963164.gal : 5 ms
[2024-05-26 05:20:34] [INFO ] Time to serialize properties into /tmp/LTL8980012206432084795.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3385792710799963164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8980012206432084795.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
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.
Treatment of property Referendum-PT-0200-LTLCardinality-05 finished in 226319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 36 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
[2024-05-26 05:20:49] [INFO ] Invariant cache hit.
[2024-05-26 05:20:49] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-26 05:20:49] [INFO ] Invariant cache hit.
[2024-05-26 05:20:49] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-26 05:20:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17398 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15790 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 33260ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 33264ms
Starting structural reductions in LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33552 ms. Remains : 401/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 250 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
Entered a terminal (fully accepting) state of product in 10931 steps with 102 reset in 263 ms.
FORMULA Referendum-PT-0200-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-06 finished in 34093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 13 ms. Remains 6 /601 variables (removed 595) and now considering 6/401 (removed 395) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-26 05:21:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 05:21:23] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-26 05:21:23] [INFO ] Invariant cache hit.
[2024-05-26 05:21:23] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-05-26 05:21:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 40 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 34 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 77ms
Starting structural reductions in LTL mode, iteration 1 : 6/601 places, 6/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 6/601 places, 6/401 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 408 steps with 2 reset in 3 ms.
FORMULA Referendum-PT-0200-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-08 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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.3 ms
Discarding 598 places :
Also discarding 398 output transitions
Drop transitions (Output transitions of discarded places.) removed 398 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) 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 14 ms. Remains 3 /601 variables (removed 598) and now considering 3/401 (removed 398) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-26 05:21:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 05:21:23] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-26 05:21:23] [INFO ] Invariant cache hit.
[2024-05-26 05:21:23] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-26 05:21:23] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-26 05:21:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Domain max(s): 3/3 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Domain max(s): 3/3 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 52ms
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 106 ms. Remains : 3/601 places, 3/401 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 82 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 17 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 363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 9 ms. Remains 9 /601 variables (removed 592) and now considering 9/401 (removed 392) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-26 05:21:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 05:21:24] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 05:21:24] [INFO ] Invariant cache hit.
[2024-05-26 05:21:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-05-26 05:21:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 9 constraints, problems are : Problem set: 0 solved, 8 unsolved in 57 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/18 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 49 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Starting structural reductions in LTL mode, iteration 1 : 9/601 places, 9/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 9/601 places, 9/401 transitions.
Stuttering acceptance computed with spot in 113 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
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0200-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-14 finished in 285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 272 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 11 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-05-26 05:21:24] [INFO ] Computed 0 invariants in 1 ms
[2024-05-26 05:21:25] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-26 05:21:25] [INFO ] Invariant cache hit.
[2024-05-26 05:21:25] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-26 05:21:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17007 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15629 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 32717ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 32720ms
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 32954 ms. Remains : 401/601 places, 401/401 transitions.
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-05
Product exploration explored 100000 steps with 29715 reset in 2604 ms.
Product exploration explored 100000 steps with 29597 reset in 2672 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), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (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 352 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 297 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), (AND (NOT p0) p2), (NOT p1)]
RANDOM walk for 40000 steps (196 resets) in 1213 ms. (32 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 1/1 properties
[2024-05-26 05:22:04] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 200/802 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Domain max(s): 0/401 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 12 factoid took 1067 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 325 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 325 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-26 05:22:06] [INFO ] Invariant cache hit.
[2024-05-26 05:22:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-26 05:22:06] [INFO ] Invariant cache hit.
[2024-05-26 05:22:06] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-26 05:22:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 16909 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 16046 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 33010ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 33013ms
Finished structural reductions in LTL mode , in 1 iterations and 33263 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), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X 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 9 factoid took 297 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 303 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)]
RANDOM walk for 796 steps (0 resets) in 48 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p2 p1))), (F p0), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 610 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 350 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 332 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 334 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 29353 reset in 2478 ms.
Product exploration explored 100000 steps with 29454 reset in 2534 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 333 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 23 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-26 05:22:47] [INFO ] Redundant transitions in 15 ms returned []
Running 400 sub problems to find dead transitions.
[2024-05-26 05:22:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17655 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15914 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 33630ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 33634ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33681 ms. Remains : 401/401 places, 401/401 transitions.
Built C files in :
/tmp/ltsmin11241755337068810778
[2024-05-26 05:23:21] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11241755337068810778
Running compilation step : cd /tmp/ltsmin11241755337068810778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 755 ms.
Running link step : cd /tmp/ltsmin11241755337068810778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11241755337068810778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15331358454506924034.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 6 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-26 05:23:36] [INFO ] Invariant cache hit.
[2024-05-26 05:23:36] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-26 05:23:36] [INFO ] Invariant cache hit.
[2024-05-26 05:23:36] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-26 05:23:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17323 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15618 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 32997ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 33004ms
Finished structural reductions in LTL mode , in 1 iterations and 33255 ms. Remains : 401/401 places, 401/401 transitions.
Built C files in :
/tmp/ltsmin8246545183567945818
[2024-05-26 05:24:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8246545183567945818
Running compilation step : cd /tmp/ltsmin8246545183567945818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 751 ms.
Running link step : cd /tmp/ltsmin8246545183567945818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8246545183567945818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14123915222703167761.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 05:24:24] [INFO ] Flatten gal took : 18 ms
[2024-05-26 05:24:24] [INFO ] Flatten gal took : 15 ms
[2024-05-26 05:24:24] [INFO ] Time to serialize gal into /tmp/LTL14019505811280481058.gal : 2 ms
[2024-05-26 05:24:24] [INFO ] Time to serialize properties into /tmp/LTL3290517021888829642.prop : 0 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14019505811280481058.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4235973772338751388.hoa' '-atoms' '/tmp/LTL3290517021888829642.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3290517021888829642.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4235973772338751388.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-26 05:24:39] [INFO ] Flatten gal took : 15 ms
[2024-05-26 05:24:39] [INFO ] Flatten gal took : 14 ms
[2024-05-26 05:24:39] [INFO ] Time to serialize gal into /tmp/LTL215050283729981984.gal : 2 ms
[2024-05-26 05:24:39] [INFO ] Time to serialize properties into /tmp/LTL13631790983312545487.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL215050283729981984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13631790983312545487.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.202405141337/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-26 05:24:54] [INFO ] Flatten gal took : 17 ms
[2024-05-26 05:24:54] [INFO ] Applying decomposition
[2024-05-26 05:24:54] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph15186106163532430608.txt' '-o' '/tmp/graph15186106163532430608.bin' '-w' '/tmp/graph15186106163532430608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15186106163532430608.bin' '-l' '-1' '-v' '-w' '/tmp/graph15186106163532430608.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:24:55] [INFO ] Decomposing Gal with order
[2024-05-26 05:24:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:24:55] [INFO ] Flatten gal took : 93 ms
[2024-05-26 05:24:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 05:24:55] [INFO ] Time to serialize gal into /tmp/LTL6599134176796967706.gal : 3 ms
[2024-05-26 05:24:55] [INFO ] Time to serialize properties into /tmp/LTL16949346538436071757.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6599134176796967706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16949346538436071757.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.202405141337/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.
Treatment of property Referendum-PT-0200-LTLCardinality-05 finished in 225744 ms.
[2024-05-26 05:25:10] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8585556462698029756
[2024-05-26 05:25:10] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2024-05-26 05:25:10] [INFO ] Applying decomposition
[2024-05-26 05:25:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:25:10] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2024-05-26 05:25:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:25:10] [INFO ] Flatten gal took : 12 ms
[2024-05-26 05:25:10] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2024-05-26 05:25:10] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 05:25:10] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8585556462698029756
Running compilation step : cd /tmp/ltsmin8585556462698029756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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.202405141337/bin/convert-linux64' '-i' '/tmp/graph13649303123605455702.txt' '-o' '/tmp/graph13649303123605455702.bin' '-w' '/tmp/graph13649303123605455702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13649303123605455702.bin' '-l' '-1' '-v' '-w' '/tmp/graph13649303123605455702.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:25:10] [INFO ] Decomposing Gal with order
[2024-05-26 05:25:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:25:10] [INFO ] Flatten gal took : 64 ms
[2024-05-26 05:25:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 05:25:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality1403794384730949674.gal : 3 ms
[2024-05-26 05:25:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality16524022032635175635.ltl : 0 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1403794384730949674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16524022032635175635.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
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 963 ms.
Running link step : cd /tmp/ltsmin8585556462698029756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8585556462698029756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.228: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.228: LTL layer: formula: (([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))) U X(X([]((LTLAPp2==true)))))
pins2lts-mc-linux64( 4/ 8), 0.228: "(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))) U X(X([]((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.228: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.230: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.233: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.239: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.244: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.248: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.251: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.252: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.371: There are 405 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.371: State length is 602, there are 418 groups
pins2lts-mc-linux64( 0/ 8), 0.371: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.371: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.371: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.371: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.467: [Blue] ~4 levels ~960 states ~9608 transitions
pins2lts-mc-linux64( 4/ 8), 0.506: [Blue] ~4 levels ~1920 states ~9608 transitions
pins2lts-mc-linux64( 6/ 8), 0.734: [Blue] ~8 levels ~3840 states ~34808 transitions
pins2lts-mc-linux64( 6/ 8), 0.817: [Blue] ~8 levels ~7680 states ~37928 transitions
pins2lts-mc-linux64( 6/ 8), 1.017: [Blue] ~8 levels ~15360 states ~44168 transitions
pins2lts-mc-linux64( 7/ 8), 1.490: [Blue] ~9 levels ~30720 states ~65944 transitions
pins2lts-mc-linux64( 5/ 8), 2.325: [Blue] ~8 levels ~61440 states ~94088 transitions
pins2lts-mc-linux64( 4/ 8), 3.789: [Blue] ~8 levels ~122880 states ~159672 transitions
pins2lts-mc-linux64( 4/ 8), 6.709: [Blue] ~8 levels ~245760 states ~306312 transitions
pins2lts-mc-linux64( 3/ 8), 12.304: [Blue] ~8 levels ~491520 states ~714968 transitions
pins2lts-mc-linux64( 3/ 8), 23.357: [Blue] ~10 levels ~983040 states ~1724184 transitions
pins2lts-mc-linux64( 3/ 8), 45.313: [Blue] ~12 levels ~1966080 states ~3837656 transitions
pins2lts-mc-linux64( 7/ 8), 89.348: [Blue] ~15 levels ~3932160 states ~7637992 transitions
pins2lts-mc-linux64( 3/ 8), 174.648: [Blue] ~22 levels ~7864320 states ~15548312 transitions
pins2lts-mc-linux64( 3/ 8), 342.296: [Blue] ~39 levels ~15728640 states ~31533928 transitions
pins2lts-mc-linux64( 5/ 8), 556.040: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 563.255:
pins2lts-mc-linux64( 0/ 8), 563.255: Explored 25800021 states 51696700 transitions, fanout: 2.004
pins2lts-mc-linux64( 0/ 8), 563.255: Total exploration time 562.860 sec (556.420 sec minimum, 558.926 sec on average)
pins2lts-mc-linux64( 0/ 8), 563.255: States per second: 45837, Transitions per second: 91846
pins2lts-mc-linux64( 0/ 8), 563.255:
pins2lts-mc-linux64( 0/ 8), 563.255: State space has 26126197 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 563.255: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 563.255: blue states: 25800021 (98.75%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 563.255: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 563.255: all-red states: 25799510 (98.75%), bogus 1 (0.00%)
pins2lts-mc-linux64( 0/ 8), 563.255:
pins2lts-mc-linux64( 0/ 8), 563.255: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 563.255:
pins2lts-mc-linux64( 0/ 8), 563.255: Queue width: 8B, total height: 518, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 563.255: Tree memory: 455.3MB, 18.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 563.255: Tree fill ratio (roots/leafs): 19.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 563.255: Stored 403 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 563.255: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 563.255: Est. total memory use: 455.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8585556462698029756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8585556462698029756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-26 05:47:08] [INFO ] Applying decomposition
[2024-05-26 05:47:08] [INFO ] Flatten gal took : 20 ms
[2024-05-26 05:47:08] [INFO ] Decomposing Gal with order
[2024-05-26 05:47:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:47:09] [INFO ] Flatten gal took : 17 ms
[2024-05-26 05:47:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-26 05:47:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality2572050882475584533.gal : 3 ms
[2024-05-26 05:47:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality8600230262306447438.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2572050882475584533.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8600230262306447438.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.202405141337/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
ITS-tools command line returned an error code 137
[2024-05-26 06:09:23] [INFO ] Flatten gal took : 16 ms
[2024-05-26 06:09:23] [INFO ] Input system was already deterministic with 401 transitions.
[2024-05-26 06:09:23] [INFO ] Transformed 601 places.
[2024-05-26 06:09:23] [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-26 06:09:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality5678696093162095399.gal : 3 ms
[2024-05-26 06:09:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality9835314256491639068.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5678696093162095399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9835314256491639068.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.202405141337/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

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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Referendum-PT-0200, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-171662338900619"
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 ;