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-171662338800577.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-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662338800577
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 17K Apr 11 16:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 11 16:19 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 7.4K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 11 16:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 11 16:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 158K Apr 11 16:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:46 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 12K 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-0010-CTLCardinality-2024-00
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-01
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-02
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-03
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-04
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-05
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-06
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-07
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-08
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-09
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-10
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-11
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-12
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-13
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-14
FORMULA_NAME Referendum-PT-0010-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716699877193

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-26 05:04:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 05:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 05:04:38] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2024-05-26 05:04:38] [INFO ] Transformed 31 places.
[2024-05-26 05:04:38] [INFO ] Transformed 21 transitions.
[2024-05-26 05:04:38] [INFO ] Found NUPN structural information;
[2024-05-26 05:04:38] [INFO ] Parsed PT model containing 31 places and 21 transitions and 51 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-26 05:04:38] [INFO ] Computed 10 invariants in 8 ms
[2024-05-26 05:04:38] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-26 05:04:38] [INFO ] Invariant cache hit.
[2024-05-26 05:04:38] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-26 05:04:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 21/31 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/52 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 72 constraints, problems are : Problem set: 0 solved, 20 unsolved in 292 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 21/31 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/52 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 92 constraints, problems are : Problem set: 0 solved, 20 unsolved in 187 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 501ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 511ms
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 31/31 places, 21/21 transitions.
Support contains 31 out of 31 places after structural reductions.
[2024-05-26 05:04:39] [INFO ] Flatten gal took : 15 ms
[2024-05-26 05:04:39] [INFO ] Flatten gal took : 5 ms
[2024-05-26 05:04:39] [INFO ] Input system was already deterministic with 21 transitions.
Reduction of identical properties reduced properties to check from 61 to 60
RANDOM walk for 40000 steps (3332 resets) in 2152 ms. (18 steps per ms) remains 20/60 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
[2024-05-26 05:04:40] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Real declared 30/52 variables, and 30 constraints, problems are : Problem set: 20 solved, 0 unsolved in 30 ms.
Refiners :[Domain max(s): 30/31 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 20 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
FORMULA Referendum-PT-0010-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 05:04:40] [INFO ] Flatten gal took : 3 ms
[2024-05-26 05:04:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Referendum-PT-0010-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 05:04:40] [INFO ] Flatten gal took : 3 ms
[2024-05-26 05:04:40] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 31 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 21
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA Referendum-PT-0010-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-26 05:04:40] [INFO ] Invariant cache hit.
[2024-05-26 05:04:40] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-26 05:04:40] [INFO ] Invariant cache hit.
[2024-05-26 05:04:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-26 05:04:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 21/31 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/52 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 72 constraints, problems are : Problem set: 0 solved, 20 unsolved in 166 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 21/31 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/52 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 92 constraints, problems are : Problem set: 0 solved, 20 unsolved in 143 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 315ms
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 31/31 places, 21/21 transitions.
[2024-05-26 05:04:40] [INFO ] Flatten gal took : 2 ms
[2024-05-26 05:04:40] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:40] [INFO ] Input system was already deterministic with 21 transitions.
[2024-05-26 05:04:40] [INFO ] Flatten gal took : 6 ms
[2024-05-26 05:04:40] [INFO ] Flatten gal took : 2 ms
[2024-05-26 05:04:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality13715425834380058872.gal : 1 ms
[2024-05-26 05:04:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality9746813165430730790.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13715425834380058872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9746813165430730790.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,59050,0.00964,3256,2,80,5,252,6,0,87,161,0


Converting to forward existential form...Done !
original formula: A((EX(TRUE) * EG(!(AG((((((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...327
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!((EX(TRUE) * EG(!(!(E(TRUE U !((((((voted_no_1...452
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.092187,6548,1,0,56,9477,23,46,3137,17634,58
FORMULA Referendum-PT-0010-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-26 05:04:40] [INFO ] Invariant cache hit.
[2024-05-26 05:04:41] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-26 05:04:41] [INFO ] Invariant cache hit.
[2024-05-26 05:04:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-26 05:04:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 21/31 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/52 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 72 constraints, problems are : Problem set: 0 solved, 20 unsolved in 223 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 21/31 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/52 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 92 constraints, problems are : Problem set: 0 solved, 20 unsolved in 144 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 407ms
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 31/31 places, 21/21 transitions.
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 3 ms
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 3 ms
[2024-05-26 05:04:41] [INFO ] Input system was already deterministic with 21 transitions.
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality16617054357056233676.gal : 1 ms
[2024-05-26 05:04:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality2676056750938735852.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16617054357056233676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2676056750938735852.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,59050,0.0034,3416,2,80,5,252,6,0,87,161,0


Converting to forward existential form...Done !
original formula: ((EG(AX(EX((((((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_no_1...867
=> equivalent forward existential formula: (([(Init * !(EG(!(EX(!(EX((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_n...983
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 10/0/11
Hit Full ! (commute/partial/dont) 10/0/11
(forward)formula 0,0,0.018086,4260,1,0,22,1837,26,8,848,1622,24
FORMULA Referendum-PT-0010-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 21
Applied a total of 10 rules in 5 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2024-05-26 05:04:41] [INFO ] Computed 0 invariants in 1 ms
[2024-05-26 05:04:41] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-26 05:04:41] [INFO ] Invariant cache hit.
[2024-05-26 05:04:41] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-26 05:04:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 21/31 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 11/42 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 128 ms.
Refiners :[Domain max(s): 21/21 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 21/31 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 11/42 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 114 ms.
Refiners :[Domain max(s): 21/21 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 249ms
Starting structural reductions in LTL mode, iteration 1 : 21/31 places, 21/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 21/31 places, 21/21 transitions.
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 2 ms
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:41] [INFO ] Input system was already deterministic with 21 transitions.
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality1599607453751837006.gal : 1 ms
[2024-05-26 05:04:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality17741966654432965229.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1599607453751837006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17741966654432965229.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,59050,0.002605,3404,2,51,5,173,6,0,67,131,0


Converting to forward existential form...Done !
original formula: AX(AG((((((voting_1+voting_2)+(voting_3+voting_4))+((voting_5+voting_6)+(voting_7+voting_8)))+(voting_9+voting_10))<=((((voted_no_1+voted...266
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((((((voting_1+voting_2)+(voting_3+voting_4))+((voting_5+voting_6)+(voting_7+voting_8))...320
(forward)formula 0,0,0.054914,4512,1,0,10,601,10,2,2833,641,4
FORMULA Referendum-PT-0010-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 11 transition count 11
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 2 transition count 2
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 2 transition count 2
Applied a total of 48 rules in 6 ms. Remains 2 /31 variables (removed 29) and now considering 2/21 (removed 19) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-26 05:04:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 05:04:41] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-26 05:04:41] [INFO ] Invariant cache hit.
[2024-05-26 05:04:41] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-05-26 05:04:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20 ms.
Refiners :[State Equation: 2/2 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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/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) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 42ms
Starting structural reductions in LTL mode, iteration 1 : 2/31 places, 2/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 2/31 places, 2/21 transitions.
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:41] [INFO ] Input system was already deterministic with 2 transitions.
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:41] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality9368301806663430643.gal : 0 ms
[2024-05-26 05:04:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality2176170518756953756.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9368301806663430643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2176170518756953756.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,12,0.001283,3276,2,4,5,40,6,0,11,44,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.001348,3276,1,0,6,40,7,1,15,44,1
FORMULA Referendum-PT-0010-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 11 transition count 11
Applied a total of 30 rules in 1 ms. Remains 11 /31 variables (removed 20) and now considering 11/21 (removed 10) transitions.
// Phase 1: matrix 11 rows 11 cols
[2024-05-26 05:04:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 05:04:41] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-26 05:04:41] [INFO ] Invariant cache hit.
[2024-05-26 05:04:42] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-26 05:04:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 11/21 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 91 ms.
Refiners :[Domain max(s): 11/11 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 11/21 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/22 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 74 ms.
Refiners :[Domain max(s): 11/11 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 168ms
Starting structural reductions in LTL mode, iteration 1 : 11/31 places, 11/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 11/31 places, 11/21 transitions.
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:42] [INFO ] Input system was already deterministic with 11 transitions.
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality6100948118111182836.gal : 2 ms
[2024-05-26 05:04:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality984236250676613167.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6100948118111182836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality984236250676613167.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1025,0.001835,3336,2,22,5,85,6,0,47,72,0


Converting to forward existential form...Done !
original formula: AF(((((((voting_1+voting_2)+(voting_3+voting_4))+((voting_5+voting_6)+(voting_7+voting_8)))+(voting_9+voting_10))<=ready) * AX(EX(TRUE)))...156
=> equivalent forward existential formula: [FwdG(Init,!(((((((voting_1+voting_2)+(voting_3+voting_4))+((voting_5+voting_6)+(voting_7+voting_8)))+(voting_9+...207
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, Intersection with reachable at each step enabled. (...200
dead was empty
(forward)formula 0,1,0.007549,3652,1,0,55,586,38,21,433,584,45
FORMULA Referendum-PT-0010-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 4 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 4 transition count 4
Applied a total of 3 rules in 8 ms. Remains 4 /31 variables (removed 27) and now considering 4/21 (removed 17) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-26 05:04:42] [INFO ] Computed 0 invariants in 1 ms
[2024-05-26 05:04:42] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-26 05:04:42] [INFO ] Invariant cache hit.
[2024-05-26 05:04:42] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-05-26 05:04:42] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-26 05:04:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 4/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31 ms.
Refiners :[Domain max(s): 4/4 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 4/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/8 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 10 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32 ms.
Refiners :[Domain max(s): 4/4 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/31 places, 4/21 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 110 ms. Remains : 4/31 places, 4/21 transitions.
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:42] [INFO ] Input system was already deterministic with 4 transitions.
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17024365489510195902.gal : 1 ms
[2024-05-26 05:04:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality16696586198572002025.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17024365489510195902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16696586198572002025.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7,0.001289,3296,2,8,5,33,6,0,18,26,0


Converting to forward existential form...Done !
original formula: AF(EG(((voting_7==0)&&(voted_yes_2==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((voting_7==0)&&(voted_yes_2==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,0,0.002427,3612,1,0,28,99,32,19,87,125,30
FORMULA Referendum-PT-0010-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 21 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 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 21 transition count 19
Applied a total of 2 rules in 1 ms. Remains 21 /31 variables (removed 10) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 21 cols
[2024-05-26 05:04:42] [INFO ] Computed 2 invariants in 0 ms
[2024-05-26 05:04:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 05:04:42] [INFO ] Invariant cache hit.
[2024-05-26 05:04:42] [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.
[2024-05-26 05:04:42] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-26 05:04:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 5/14 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 19/33 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 7/40 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 139 ms.
Refiners :[Domain max(s): 21/21 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 5/14 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 19/33 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 7/40 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 61 constraints, problems are : Problem set: 0 solved, 17 unsolved in 155 ms.
Refiners :[Domain max(s): 21/21 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 299ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/31 places, 19/21 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 350 ms. Remains : 21/31 places, 19/21 transitions.
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:42] [INFO ] Input system was already deterministic with 19 transitions.
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality10088772170142442932.gal : 1 ms
[2024-05-26 05:04:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality4128548511160370552.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10088772170142442932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4128548511160370552.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,19684,0.002701,3392,2,52,5,180,6,0,66,129,0


Converting to forward existential form...Done !
original formula: E((voting_5!=1) U (A(A((voted_yes_6!=0) U EF((voting_1==1))) U (!(E(((voted_yes_10==0)||(voted_yes_5==1)) U (voted_no_3==1))) * (!(((vote...472
=> equivalent forward existential formula: ([((FwdU(Init,(voting_5!=1)) * !(EG(!((!(E(((voted_yes_10==0)||(voted_yes_5==1)) U (voted_no_3==1))) * (!(((vote...1162
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t9, t18, Intersection with reachable at each step enabled. (destroyed/re...188
Hit Full ! (commute/partial/dont) 15/0/4
(forward)formula 0,1,0.039276,5292,1,0,308,9580,100,218,515,16706,368
FORMULA Referendum-PT-0010-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 14 transition count 14
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 10 transition count 10
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 10 transition count 10
Applied a total of 32 rules in 1 ms. Remains 10 /31 variables (removed 21) and now considering 10/21 (removed 11) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-26 05:04:42] [INFO ] Computed 0 invariants in 2 ms
[2024-05-26 05:04:42] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-26 05:04:42] [INFO ] Invariant cache hit.
[2024-05-26 05:04:42] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-26 05:04:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/20 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 10 constraints, problems are : Problem set: 0 solved, 9 unsolved in 49 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 53 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Starting structural reductions in LTL mode, iteration 1 : 10/31 places, 10/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 10/31 places, 10/21 transitions.
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:42] [INFO ] Input system was already deterministic with 10 transitions.
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:42] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality15911746884699921059.gal : 0 ms
[2024-05-26 05:04:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality6397088581652591854.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15911746884699921059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6397088581652591854.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,649,0.001802,3336,2,21,5,95,6,0,37,75,0


Converting to forward existential form...Done !
original formula: E(EF(((EF((voted_yes_2==1)) + (voting_1!=1)) + (((!((voting_5==0)||(voting_4==1)))&&(ready==1))&&((voted_yes_4==0)||(voted_no_7==1))))) U...204
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(TRUE U ((E(TRUE U (voted_yes_2==1)) + (voting_1!=1)) + (((!((voting_5==0)||(voting_4==1)))&&(r...260
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t8, t9, Intersection with reachable at each step enabled. (destroyed/reverse...182
(forward)formula 0,1,0.006587,3804,1,0,59,922,51,26,267,1108,65
FORMULA Referendum-PT-0010-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 13 transition count 13
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 7 transition count 7
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 7 transition count 7
Applied a total of 38 rules in 1 ms. Remains 7 /31 variables (removed 24) and now considering 7/21 (removed 14) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-26 05:04:42] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 05:04:42] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-26 05:04:42] [INFO ] Invariant cache hit.
[2024-05-26 05:04:42] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Running 6 sub problems to find dead transitions.
[2024-05-26 05:04:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/14 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 35 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Starting structural reductions in LTL mode, iteration 1 : 7/31 places, 7/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 7/31 places, 7/21 transitions.
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:43] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality17331694584625482706.gal : 0 ms
[2024-05-26 05:04:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14013407798442131497.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17331694584625482706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14013407798442131497.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,145,0.001537,3304,2,14,5,78,6,0,27,63,0


Converting to forward existential form...Done !
original formula: EF(EG((AX(((voting_9==0)||(voted_yes_9==1))) * ((voting_7==0)||(voted_no_10==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EX(!(((voting_9==0)||(voted_yes_9==1))))) * ((voting_7==0)||(voted_no_10==1))))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, Intersection with reachable at each step enabled. (destroyed/reverse/interse...173
(forward)formula 0,1,0.004167,3620,1,0,43,454,37,17,175,496,38
FORMULA Referendum-PT-0010-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 16 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 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 16 transition count 15
Applied a total of 2 rules in 1 ms. Remains 16 /31 variables (removed 15) and now considering 15/21 (removed 6) transitions.
// Phase 1: matrix 15 rows 16 cols
[2024-05-26 05:04:43] [INFO ] Computed 1 invariants in 0 ms
[2024-05-26 05:04:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 05:04:43] [INFO ] Invariant cache hit.
[2024-05-26 05:04:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-26 05:04:43] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-26 05:04:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 3/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 15/25 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 6/31 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 33 constraints, problems are : Problem set: 0 solved, 13 unsolved in 143 ms.
Refiners :[Domain max(s): 16/16 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 3/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 15/25 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 6/31 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/31 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/31 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/31 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 46 constraints, problems are : Problem set: 0 solved, 13 unsolved in 94 ms.
Refiners :[Domain max(s): 16/16 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 239ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/31 places, 15/21 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 289 ms. Remains : 16/31 places, 15/21 transitions.
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:43] [INFO ] Input system was already deterministic with 15 transitions.
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality7614011831539107256.gal : 0 ms
[2024-05-26 05:04:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality6064426875940114401.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7614011831539107256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6064426875940114401.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2188,0.002354,3368,2,39,5,163,6,0,52,117,0


Converting to forward existential form...Done !
original formula: EG((EF((((voted_yes_7==0)&&(voted_no_10==1))||((voted_yes_9==0)&&(voting_9==1)))) + !(E((((voted_yes_10==0)||(voted_no_1==1))||((((voting...273
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((voted_yes_7==0)&&(voted_no_10==1))||((voted_yes_9==0)&&(voting_9==1)))) + !(E((((voted_y...322
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t8, t9, t10, t14, Intersection with reachable at each step enabled. (destroyed/rever...184
(forward)formula 0,1,0.01042,3948,1,0,83,2206,61,43,381,2625,78
FORMULA Referendum-PT-0010-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 17 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 15 transition count 14
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 15 transition count 14
Applied a total of 23 rules in 0 ms. Remains 15 /31 variables (removed 16) and now considering 14/21 (removed 7) transitions.
// Phase 1: matrix 14 rows 15 cols
[2024-05-26 05:04:43] [INFO ] Computed 1 invariants in 0 ms
[2024-05-26 05:04:43] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-26 05:04:43] [INFO ] Invariant cache hit.
[2024-05-26 05:04:43] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Running 13 sub problems to find dead transitions.
[2024-05-26 05:04:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 14/25 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 4/29 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 16 constraints, problems are : Problem set: 0 solved, 13 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 14/25 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 4/29 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 29 constraints, problems are : Problem set: 0 solved, 13 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 165ms
Starting structural reductions in LTL mode, iteration 1 : 15/31 places, 14/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 15/31 places, 14/21 transitions.
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:43] [INFO ] Input system was already deterministic with 14 transitions.
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10621533426969800073.gal : 0 ms
[2024-05-26 05:04:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14089053134588103536.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10621533426969800073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14089053134588103536.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3889,0.002533,3360,2,35,5,136,6,0,51,104,0


Converting to forward existential form...Done !
original formula: (E((voted_no_5==0) U (!(EX(EX((voted_no_5==1)))) * EG((EG(((voted_yes_2==0)||(voted_no_8==1))) + AG((voted_yes_3==0)))))) + AX((!(E((vote...223
=> equivalent forward existential formula: ([(FwdU(EY((Init * !(E((voted_no_5==0) U (!(EX(EX((voted_no_5==1)))) * EG((EG(((voted_yes_2==0)||(voted_no_8==1)...446
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t6, t9, t10, t11, t13, Intersection with reachable at each step enabled. (destroyed/...189
(forward)formula 0,1,0.023026,4996,1,0,216,5924,73,118,357,9688,216
FORMULA Referendum-PT-0010-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 13 transition count 13
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 7 transition count 7
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 7 transition count 7
Applied a total of 38 rules in 1 ms. Remains 7 /31 variables (removed 24) and now considering 7/21 (removed 14) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-26 05:04:43] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 05:04:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-26 05:04:43] [INFO ] Invariant cache hit.
[2024-05-26 05:04:43] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 6 sub problems to find dead transitions.
[2024-05-26 05:04:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/14 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 34 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Starting structural reductions in LTL mode, iteration 1 : 7/31 places, 7/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 7/31 places, 7/21 transitions.
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:43] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 0 ms
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality9948593716511048043.gal : 0 ms
[2024-05-26 05:04:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality7656956168829161955.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9948593716511048043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7656956168829161955.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,145,0.001868,3308,2,14,5,78,6,0,27,63,0


Converting to forward existential form...Done !
original formula: AX(E(((voted_no_10==0)||(voting_10==1)) U AX(EG(((voting_3==1)||(voted_yes_5==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(((voted_no_10==0)||(voting_10==1)) U !(EX(!(EG(((voting_3==1)||(voted_yes_5==1)))))))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, Intersection with reachable at each step enabled. (destroyed/reverse/interse...173
(forward)formula 0,1,0.008857,3888,1,0,152,1743,39,76,170,2380,163
FORMULA Referendum-PT-0010-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2024-05-26 05:04:43] [INFO ] Flatten gal took : 1 ms
[2024-05-26 05:04:43] [INFO ] Flatten gal took : 1 ms
Total runtime 5454 ms.

BK_STOP 1716699883773

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-0010"
export BK_EXAMINATION="CTLCardinality"
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-0010, examination is CTLCardinality"
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-171662338800577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0010.tgz
mv Referendum-PT-0010 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;