Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838849900123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Election2020-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838849900123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K Feb 25 21:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 21:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 21:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 21:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 21:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K Mar 5 18:22 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 Election2020-PT-none-LTLCardinality-00
FORMULA_NAME Election2020-PT-none-LTLCardinality-01
FORMULA_NAME Election2020-PT-none-LTLCardinality-02
FORMULA_NAME Election2020-PT-none-LTLCardinality-03
FORMULA_NAME Election2020-PT-none-LTLCardinality-04
FORMULA_NAME Election2020-PT-none-LTLCardinality-05
FORMULA_NAME Election2020-PT-none-LTLCardinality-06
FORMULA_NAME Election2020-PT-none-LTLCardinality-07
FORMULA_NAME Election2020-PT-none-LTLCardinality-08
FORMULA_NAME Election2020-PT-none-LTLCardinality-09
FORMULA_NAME Election2020-PT-none-LTLCardinality-10
FORMULA_NAME Election2020-PT-none-LTLCardinality-11
FORMULA_NAME Election2020-PT-none-LTLCardinality-12
FORMULA_NAME Election2020-PT-none-LTLCardinality-13
FORMULA_NAME Election2020-PT-none-LTLCardinality-14
FORMULA_NAME Election2020-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679442346637

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Election2020-PT-none
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-21 23:45:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 23:45:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:45:52] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-21 23:45:52] [INFO ] Transformed 53 places.
[2023-03-21 23:45:52] [INFO ] Transformed 102 transitions.
[2023-03-21 23:45:52] [INFO ] Parsed PT model containing 53 places and 102 transitions and 204 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Election2020-PT-none-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 102/102 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 46 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 46 transition count 88
Applied a total of 14 rules in 12 ms. Remains 46 /53 variables (removed 7) and now considering 88/102 (removed 14) transitions.
// Phase 1: matrix 88 rows 46 cols
[2023-03-21 23:45:52] [INFO ] Computed 1 place invariants in 12 ms
[2023-03-21 23:45:52] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
[2023-03-21 23:45:52] [INFO ] Invariant cache hit.
[2023-03-21 23:45:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-21 23:45:52] [INFO ] Invariant cache hit.
[2023-03-21 23:45:52] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-21 23:45:52] [INFO ] Invariant cache hit.
[2023-03-21 23:45:52] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 88/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 46/53 places, 88/102 transitions.
Support contains 29 out of 46 places after structural reductions.
[2023-03-21 23:45:54] [INFO ] Flatten gal took : 22 ms
[2023-03-21 23:45:54] [INFO ] Flatten gal took : 8 ms
[2023-03-21 23:45:54] [INFO ] Input system was already deterministic with 88 transitions.
Finished random walk after 521 steps, including 7 resets, run visited all 29 properties in 27 ms. (steps per millisecond=19 )
FORMULA Election2020-PT-none-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0)&&p1) U (!G((p2 U p3))&&p2)))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 25 transition count 48
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 25 transition count 48
Applied a total of 41 rules in 5 ms. Remains 25 /46 variables (removed 21) and now considering 48/88 (removed 40) transitions.
// Phase 1: matrix 48 rows 25 cols
[2023-03-21 23:45:55] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 23:45:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-21 23:45:55] [INFO ] Invariant cache hit.
[2023-03-21 23:45:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-21 23:45:55] [INFO ] Invariant cache hit.
[2023-03-21 23:45:55] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-21 23:45:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 23:45:55] [INFO ] Invariant cache hit.
[2023-03-21 23:45:55] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/46 places, 48/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 25/46 places, 48/88 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p2) p3), p0, p3]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 1 s3), p1:(LEQ 1 s8), p0:(LEQ s22 s14), p3:(LEQ s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5537 reset in 328 ms.
Product exploration explored 100000 steps with 5425 reset in 255 ms.
Computed a total of 25 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 48
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X (NOT (AND (NOT p2) p1 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (NOT p2)), (X p2), (X p0), (X (NOT p0)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 6 factoid took 547 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[p3, p3]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X (NOT (AND (NOT p2) p1 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (NOT p2)), (X p2), (X p0), (X (NOT p0)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (AND p2 (NOT p3))), (F (NOT p3))]
Knowledge based reduction with 6 factoid took 641 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[p3, p3]
Stuttering acceptance computed with spot in 78 ms :[p3, p3]
[2023-03-21 23:45:57] [INFO ] Invariant cache hit.
[2023-03-21 23:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:45:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-21 23:45:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:45:57] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 23:45:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-21 23:45:57] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG p3
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-21 23:45:57] [INFO ] Invariant cache hit.
[2023-03-21 23:45:57] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-21 23:45:57] [INFO ] Invariant cache hit.
[2023-03-21 23:45:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 23:45:57] [INFO ] Invariant cache hit.
[2023-03-21 23:45:57] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-21 23:45:57] [INFO ] Invariant cache hit.
[2023-03-21 23:45:57] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 25/25 places, 48/48 transitions.
Computed a total of 25 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 48
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p3), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 3 factoid took 2076 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[p3, p3]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p2 p3), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (AND p2 (NOT p3))), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 256 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[p3, p3]
Stuttering acceptance computed with spot in 72 ms :[p3, p3]
[2023-03-21 23:46:00] [INFO ] Invariant cache hit.
[2023-03-21 23:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:46:00] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-21 23:46:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:46:00] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-21 23:46:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 23:46:00] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 59 ms :[p3, p3]
Product exploration explored 100000 steps with 5443 reset in 191 ms.
Product exploration explored 100000 steps with 5482 reset in 214 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 58 ms :[p3, p3]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 23 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 23 transition count 44
Applied a total of 4 rules in 6 ms. Remains 23 /25 variables (removed 2) and now considering 44/48 (removed 4) transitions.
// Phase 1: matrix 44 rows 23 cols
[2023-03-21 23:46:01] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 23:46:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-21 23:46:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:46:01] [INFO ] Invariant cache hit.
[2023-03-21 23:46:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/25 places, 44/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 23/25 places, 44/48 transitions.
Built C files in :
/tmp/ltsmin12184569429369251464
[2023-03-21 23:46:01] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12184569429369251464
Running compilation step : cd /tmp/ltsmin12184569429369251464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 168 ms.
Running link step : cd /tmp/ltsmin12184569429369251464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12184569429369251464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13410812821009792752.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 23 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 23 transition count 44
Applied a total of 4 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 44/48 (removed 4) transitions.
[2023-03-21 23:46:16] [INFO ] Invariant cache hit.
[2023-03-21 23:46:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-21 23:46:16] [INFO ] Invariant cache hit.
[2023-03-21 23:46:16] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-21 23:46:16] [INFO ] Invariant cache hit.
[2023-03-21 23:46:16] [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.
[2023-03-21 23:46:16] [INFO ] Invariant cache hit.
[2023-03-21 23:46:16] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 44/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 23/25 places, 44/48 transitions.
Built C files in :
/tmp/ltsmin15117947630300652498
[2023-03-21 23:46:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15117947630300652498
Running compilation step : cd /tmp/ltsmin15117947630300652498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin15117947630300652498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15117947630300652498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3776734684052084093.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-21 23:46:31] [INFO ] Flatten gal took : 2 ms
[2023-03-21 23:46:31] [INFO ] Flatten gal took : 2 ms
[2023-03-21 23:46:32] [INFO ] Time to serialize gal into /tmp/LTL15560254501636398595.gal : 2 ms
[2023-03-21 23:46:32] [INFO ] Time to serialize properties into /tmp/LTL615939746084948540.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15560254501636398595.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7811902447541400027.hoa' '-atoms' '/tmp/LTL615939746084948540.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL615939746084948540.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7811902447541400027.hoa
Detected timeout of ITS tools.
[2023-03-21 23:46:47] [INFO ] Flatten gal took : 3 ms
[2023-03-21 23:46:47] [INFO ] Flatten gal took : 2 ms
[2023-03-21 23:46:47] [INFO ] Time to serialize gal into /tmp/LTL5498049844299545367.gal : 1 ms
[2023-03-21 23:46:47] [INFO ] Time to serialize properties into /tmp/LTL9431202434800481665.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5498049844299545367.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9431202434800481665.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((!((G("(TX<=IA)"))&&("(DE>=1)")))U((!(G(("(AZ>=1)")U("(Total_D<=AK)"))))&&("(AZ>=1)"))))
Formula 0 simplified : ("(DE>=1)" & G"(TX<=IA)") R (!"(AZ>=1)" | G("(AZ>=1)" U "(Total_D<=AK)"))
Detected timeout of ITS tools.
[2023-03-21 23:47:02] [INFO ] Flatten gal took : 2 ms
[2023-03-21 23:47:02] [INFO ] Applying decomposition
[2023-03-21 23:47:02] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1645125668699111164.txt' '-o' '/tmp/graph1645125668699111164.bin' '-w' '/tmp/graph1645125668699111164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1645125668699111164.bin' '-l' '-1' '-v' '-w' '/tmp/graph1645125668699111164.weights' '-q' '0' '-e' '0.001'
[2023-03-21 23:47:02] [INFO ] Decomposing Gal with order
[2023-03-21 23:47:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 23:47:02] [INFO ] Flatten gal took : 20 ms
[2023-03-21 23:47:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-21 23:47:02] [INFO ] Time to serialize gal into /tmp/LTL2496778217852724065.gal : 1 ms
[2023-03-21 23:47:02] [INFO ] Time to serialize properties into /tmp/LTL16017359127759637302.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2496778217852724065.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16017359127759637302.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((!((G("(gu1.TX<=gu1.IA)"))&&("(gu0.DE>=1)")))U((!(G(("(gu0.AZ>=1)")U("(gu0.Total_D<=gu0.AK)"))))&&("(gu0.AZ>=1)"))))
Formula 0 simplified : ("(gu0.DE>=1)" & G"(gu1.TX<=gu1.IA)") R (!"(gu0.AZ>=1)" | G("(gu0.AZ>=1)" U "(gu0.Total_D<=gu0.AK)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13457244026921241945
[2023-03-21 23:47:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13457244026921241945
Running compilation step : cd /tmp/ltsmin13457244026921241945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin13457244026921241945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13457244026921241945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!([]((LTLAPp0==true))&&(LTLAPp1==true)) U ( U (LTLAPp3==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Election2020-PT-none-LTLCardinality-00 finished in 98074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1||F(p2)))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 4 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.3 ms
Discarding 42 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 4 transition count 4
Applied a total of 5 rules in 6 ms. Remains 4 /46 variables (removed 42) and now considering 4/88 (removed 84) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-21 23:47:33] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 23:47:33] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-21 23:47:33] [INFO ] Invariant cache hit.
[2023-03-21 23:47:33] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-21 23:47:33] [INFO ] Invariant cache hit.
[2023-03-21 23:47:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-21 23:47:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:47:33] [INFO ] Invariant cache hit.
[2023-03-21 23:47:33] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/46 places, 4/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 4/46 places, 4/88 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s1), p2:(LEQ s0 s2), p0:(LEQ s3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 20155 reset in 91 ms.
Product exploration explored 100000 steps with 20169 reset in 87 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 388 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-21 23:47:34] [INFO ] Invariant cache hit.
[2023-03-21 23:47:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-21 23:47:34] [INFO ] Invariant cache hit.
[2023-03-21 23:47:34] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-21 23:47:34] [INFO ] Invariant cache hit.
[2023-03-21 23:47:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-21 23:47:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:47:34] [INFO ] Invariant cache hit.
[2023-03-21 23:47:34] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 57 steps, including 11 resets, run visited all 3 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 373 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 20173 reset in 58 ms.
Product exploration explored 100000 steps with 20175 reset in 47 ms.
Built C files in :
/tmp/ltsmin3280954469185350662
[2023-03-21 23:47:35] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2023-03-21 23:47:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:47:35] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2023-03-21 23:47:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:47:35] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2023-03-21 23:47:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:47:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3280954469185350662
Running compilation step : cd /tmp/ltsmin3280954469185350662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin3280954469185350662;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3280954469185350662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased716773261150946970.hoa' '--buchi-type=spotba'
LTSmin run took 321 ms.
FORMULA Election2020-PT-none-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Election2020-PT-none-LTLCardinality-01 finished in 3077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 3 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.0 ms
Discarding 43 places :
Also discarding 82 output transitions
Drop transitions removed 82 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 0 ms. Remains 3 /46 variables (removed 43) and now considering 3/88 (removed 85) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-21 23:47:36] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 23:47:36] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2023-03-21 23:47:36] [INFO ] Invariant cache hit.
[2023-03-21 23:47:36] [INFO ] Implicit Places using invariants in 11 ms returned []
[2023-03-21 23:47:36] [INFO ] Invariant cache hit.
[2023-03-21 23:47:36] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-21 23:47:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:47:36] [INFO ] Invariant cache hit.
[2023-03-21 23:47:36] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/46 places, 3/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 3/46 places, 3/88 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s0), p1:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-02 finished in 192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 3 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 82 output transitions
Drop transitions removed 82 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 8 ms. Remains 3 /46 variables (removed 43) and now considering 3/88 (removed 85) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-21 23:47:36] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 23:47:36] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2023-03-21 23:47:36] [INFO ] Invariant cache hit.
[2023-03-21 23:47:36] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-21 23:47:36] [INFO ] Invariant cache hit.
[2023-03-21 23:47:36] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-21 23:47:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:47:36] [INFO ] Invariant cache hit.
[2023-03-21 23:47:36] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/46 places, 3/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 3/46 places, 3/88 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s1), p1:(GT s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-04 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(X(X(X(p1)))))) U X(X(p2)))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 44 transition count 44
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 25 transition count 25
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 25 transition count 25
Applied a total of 84 rules in 4 ms. Remains 25 /46 variables (removed 21) and now considering 25/88 (removed 63) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-21 23:47:36] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 23:47:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-21 23:47:36] [INFO ] Invariant cache hit.
[2023-03-21 23:47:36] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-21 23:47:36] [INFO ] Invariant cache hit.
[2023-03-21 23:47:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-21 23:47:36] [INFO ] Invariant cache hit.
[2023-03-21 23:47:36] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/46 places, 25/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 25/46 places, 25/88 transitions.
Stuttering acceptance computed with spot in 1037 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 11}, { cond=(NOT p2), acceptance={0} source=4 dest: 12}], [{ cond=(NOT p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=true, acceptance={} source=10 dest: 7}], [{ cond=true, acceptance={} source=11 dest: 10}], [{ cond=(NOT p0), acceptance={} source=12 dest: 11}, { cond=true, acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(LEQ s14 s10), p2:(LEQ 2 s6), p1:(LEQ s2 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 2 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-05 finished in 1190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)&&X(((G(p0)&&p0) U p2)))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 25 transition count 48
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 25 transition count 48
Applied a total of 41 rules in 5 ms. Remains 25 /46 variables (removed 21) and now considering 48/88 (removed 40) transitions.
// Phase 1: matrix 48 rows 25 cols
[2023-03-21 23:47:37] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 23:47:37] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-21 23:47:37] [INFO ] Invariant cache hit.
[2023-03-21 23:47:37] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-21 23:47:37] [INFO ] Invariant cache hit.
[2023-03-21 23:47:37] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-21 23:47:37] [INFO ] Invariant cache hit.
[2023-03-21 23:47:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/46 places, 48/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 25/46 places, 48/88 transitions.
Stuttering acceptance computed with spot in 512 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (NOT p2), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s15 s21), p0:(LEQ s0 s19), p2:(GT 1 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-06 finished in 663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 24 transition count 46
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 24 transition count 46
Applied a total of 43 rules in 3 ms. Remains 24 /46 variables (removed 22) and now considering 46/88 (removed 42) transitions.
// Phase 1: matrix 46 rows 24 cols
[2023-03-21 23:47:38] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-21 23:47:38] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-21 23:47:38] [INFO ] Invariant cache hit.
[2023-03-21 23:47:38] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-21 23:47:38] [INFO ] Invariant cache hit.
[2023-03-21 23:47:38] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-21 23:47:38] [INFO ] Invariant cache hit.
[2023-03-21 23:47:38] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/46 places, 46/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 24/46 places, 46/88 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ s6 s0) (LEQ s16 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-07 finished in 236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(p1)))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 23 transition count 44
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 23 transition count 44
Applied a total of 45 rules in 3 ms. Remains 23 /46 variables (removed 23) and now considering 44/88 (removed 44) transitions.
// Phase 1: matrix 44 rows 23 cols
[2023-03-21 23:47:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 23:47:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-21 23:47:38] [INFO ] Invariant cache hit.
[2023-03-21 23:47:38] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-21 23:47:38] [INFO ] Invariant cache hit.
[2023-03-21 23:47:38] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-21 23:47:38] [INFO ] Invariant cache hit.
[2023-03-21 23:47:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/46 places, 44/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 23/46 places, 44/88 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(LEQ 1 s0), p0:(GT s13 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33832 reset in 157 ms.
Product exploration explored 100000 steps with 33927 reset in 172 ms.
Computed a total of 23 stabilizing places and 44 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 44
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 3 factoid took 252 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-21 23:47:40] [INFO ] Invariant cache hit.
[2023-03-21 23:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:47:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 23:47:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:47:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
Proved EG (AND (NOT p1) (NOT p0))
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (G (AND (NOT p1) (NOT p0)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLCardinality-08 finished in 1810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((X(X(p0)) U X(p1))))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 3 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.0 ms
Discarding 43 places :
Also discarding 82 output transitions
Drop transitions removed 82 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 2 ms. Remains 3 /46 variables (removed 43) and now considering 3/88 (removed 85) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-21 23:47:40] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-21 23:47:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-21 23:47:40] [INFO ] Invariant cache hit.
[2023-03-21 23:47:40] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-21 23:47:40] [INFO ] Invariant cache hit.
[2023-03-21 23:47:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-21 23:47:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:47:40] [INFO ] Invariant cache hit.
[2023-03-21 23:47:40] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/46 places, 3/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 3/46 places, 3/88 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25537 reset in 74 ms.
Product exploration explored 100000 steps with 25531 reset in 82 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 3 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-21 23:47:41] [INFO ] Invariant cache hit.
[2023-03-21 23:47:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-03-21 23:47:41] [INFO ] Invariant cache hit.
[2023-03-21 23:47:41] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-21 23:47:41] [INFO ] Invariant cache hit.
[2023-03-21 23:47:41] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2023-03-21 23:47:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:47:41] [INFO ] Invariant cache hit.
[2023-03-21 23:47:41] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25552 reset in 36 ms.
Product exploration explored 100000 steps with 25539 reset in 46 ms.
Built C files in :
/tmp/ltsmin10767804211511695512
[2023-03-21 23:47:42] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2023-03-21 23:47:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:47:42] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2023-03-21 23:47:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:47:42] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2023-03-21 23:47:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:47:42] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10767804211511695512
Running compilation step : cd /tmp/ltsmin10767804211511695512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin10767804211511695512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10767804211511695512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7947659113570368376.hoa' '--buchi-type=spotba'
LTSmin run took 39 ms.
FORMULA Election2020-PT-none-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Election2020-PT-none-LTLCardinality-11 finished in 1884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&G(p1)))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 44 transition count 44
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 68 place count 22 transition count 22
Iterating global reduction 1 with 22 rules applied. Total rules applied 90 place count 22 transition count 22
Applied a total of 90 rules in 2 ms. Remains 22 /46 variables (removed 24) and now considering 22/88 (removed 66) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-21 23:47:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 23:47:42] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-21 23:47:42] [INFO ] Invariant cache hit.
[2023-03-21 23:47:42] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-21 23:47:42] [INFO ] Invariant cache hit.
[2023-03-21 23:47:42] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-21 23:47:42] [INFO ] Invariant cache hit.
[2023-03-21 23:47:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/46 places, 22/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 22/46 places, 22/88 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 3 s5), p0:(GT 3 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1989 reset in 94 ms.
Product exploration explored 100000 steps with 2017 reset in 102 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 797 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 70 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 3 factoid took 365 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-21 23:47:44] [INFO ] Invariant cache hit.
[2023-03-21 23:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:47:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-21 23:47:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:47:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-21 23:47:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 23:47:44] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-21 23:47:44] [INFO ] Invariant cache hit.
[2023-03-21 23:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:47:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-21 23:47:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:47:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-21 23:47:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 23:47:44] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-21 23:47:44] [INFO ] Invariant cache hit.
[2023-03-21 23:47:44] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-21 23:47:44] [INFO ] Invariant cache hit.
[2023-03-21 23:47:44] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-21 23:47:44] [INFO ] Invariant cache hit.
[2023-03-21 23:47:44] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-21 23:47:44] [INFO ] Invariant cache hit.
[2023-03-21 23:47:44] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 22/22 places, 22/22 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 351 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 32 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 3 factoid took 390 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-21 23:47:46] [INFO ] Invariant cache hit.
[2023-03-21 23:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:47:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-21 23:47:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:47:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:47:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-21 23:47:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 23:47:46] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-21 23:47:46] [INFO ] Invariant cache hit.
[2023-03-21 23:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:47:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-21 23:47:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:47:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:47:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-21 23:47:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 23:47:46] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1992 reset in 96 ms.
Product exploration explored 100000 steps with 1972 reset in 102 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Graph (complete) has 0 edges and 22 vertex of which 2 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /22 variables (removed 20) and now considering 2/22 (removed 20) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-21 23:47:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 23:47:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-21 23:47:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:47:46] [INFO ] Invariant cache hit.
[2023-03-21 23:47:46] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 2/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 2/22 places, 2/22 transitions.
Built C files in :
/tmp/ltsmin4169682709586217312
[2023-03-21 23:47:46] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4169682709586217312
Running compilation step : cd /tmp/ltsmin4169682709586217312;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin4169682709586217312;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4169682709586217312;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1365301576536600163.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-21 23:48:01] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 23:48:02] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-21 23:48:02] [INFO ] Invariant cache hit.
[2023-03-21 23:48:02] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-21 23:48:02] [INFO ] Invariant cache hit.
[2023-03-21 23:48:02] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-21 23:48:02] [INFO ] Invariant cache hit.
[2023-03-21 23:48:02] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 22/22 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin4651709480113762356
[2023-03-21 23:48:02] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4651709480113762356
Running compilation step : cd /tmp/ltsmin4651709480113762356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 69 ms.
Running link step : cd /tmp/ltsmin4651709480113762356;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4651709480113762356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10328034570904526756.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-21 23:48:17] [INFO ] Flatten gal took : 2 ms
[2023-03-21 23:48:17] [INFO ] Flatten gal took : 1 ms
[2023-03-21 23:48:17] [INFO ] Time to serialize gal into /tmp/LTL8415425565482702129.gal : 1 ms
[2023-03-21 23:48:17] [INFO ] Time to serialize properties into /tmp/LTL7477334331956672213.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8415425565482702129.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3642096991082593670.hoa' '-atoms' '/tmp/LTL7477334331956672213.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7477334331956672213.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3642096991082593670.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
173 unique states visited
0 strongly connected components in search stack
230 transitions explored
60 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.172612,20392,1,0,566,31587,31,617,373,56858,2266
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Election2020-PT-none-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Election2020-PT-none-LTLCardinality-12 finished in 34983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(G(p1))))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 23 transition count 44
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 23 transition count 44
Applied a total of 45 rules in 1 ms. Remains 23 /46 variables (removed 23) and now considering 44/88 (removed 44) transitions.
// Phase 1: matrix 44 rows 23 cols
[2023-03-21 23:48:17] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 23:48:17] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-21 23:48:17] [INFO ] Invariant cache hit.
[2023-03-21 23:48:17] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 23:48:17] [INFO ] Invariant cache hit.
[2023-03-21 23:48:17] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-21 23:48:17] [INFO ] Invariant cache hit.
[2023-03-21 23:48:17] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/46 places, 44/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 23/46 places, 44/88 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LEQ 2 s15), p1:(LEQ s0 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-15 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0)&&p1) U (!G((p2 U p3))&&p2)))'
[2023-03-21 23:48:17] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13469644440689552488
[2023-03-21 23:48:17] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2023-03-21 23:48:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:48:17] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2023-03-21 23:48:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:48:17] [INFO ] Applying decomposition
[2023-03-21 23:48:17] [INFO ] Flatten gal took : 3 ms
[2023-03-21 23:48:17] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2023-03-21 23:48:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:48:17] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13469644440689552488
Running compilation step : cd /tmp/ltsmin13469644440689552488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14094656105998300055.txt' '-o' '/tmp/graph14094656105998300055.bin' '-w' '/tmp/graph14094656105998300055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14094656105998300055.bin' '-l' '-1' '-v' '-w' '/tmp/graph14094656105998300055.weights' '-q' '0' '-e' '0.001'
[2023-03-21 23:48:17] [INFO ] Decomposing Gal with order
[2023-03-21 23:48:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 23:48:17] [INFO ] Removed a total of 25 redundant transitions.
[2023-03-21 23:48:17] [INFO ] Flatten gal took : 15 ms
[2023-03-21 23:48:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 2 ms.
[2023-03-21 23:48:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality17951072947878949331.gal : 1 ms
[2023-03-21 23:48:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality9355413241233387793.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17951072947878949331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9355413241233387793.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((!((G("(gu2.TX<=gu2.IA)"))&&("(gu0.DE>=1)")))U((!(G(("(gu0.AZ>=1)")U("(gu1.Total_D<=gu1.AK)"))))&&("(gu0.AZ>=1)"))))
Formula 0 simplified : ("(gu0.DE>=1)" & G"(gu2.TX<=gu2.IA)") R (!"(gu0.AZ>=1)" | G("(gu0.AZ>=1)" U "(gu1.Total_D<=gu1.AK)"))
Compilation finished in 152 ms.
Running link step : cd /tmp/ltsmin13469644440689552488;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin13469644440689552488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(!([]((LTLAPp0==true))&&(LTLAPp1==true)) U ( U (LTLAPp3==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-22 00:09:06] [INFO ] Flatten gal took : 3 ms
[2023-03-22 00:09:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality5752230599839243895.gal : 2 ms
[2023-03-22 00:09:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality6357465038840568096.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5752230599839243895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6357465038840568096.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !(((!((G("(TX<=IA)"))&&("(DE>=1)")))U((!(G(("(AZ>=1)")U("(Total_D<=AK)"))))&&("(AZ>=1)"))))
Formula 0 simplified : ("(DE>=1)" & G"(TX<=IA)") R (!"(AZ>=1)" | G("(AZ>=1)" U "(Total_D<=AK)"))
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: LTL layer: formula: (!([]((LTLAPp0==true))&&(LTLAPp1==true)) U ( U (LTLAPp3==true)))&&(LTLAPp2==true)))
pins2lts-mc-linux64( 1/ 8), 0.009: "(!([]((LTLAPp0==true))&&(LTLAPp1==true)) U ( U (LTLAPp3==true)))&&(LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Initializing POR dependencies: labels 92, guards 88
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.055: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.056: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.056: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.056: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.084: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.088: There are 93 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.088: State length is 47, there are 96 groups
pins2lts-mc-linux64( 0/ 8), 0.088: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.088: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.088: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.088: Visible groups: 0 / 96, labels: 4 / 93
pins2lts-mc-linux64( 0/ 8), 0.088: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.088: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.351: [Blue] ~48 levels ~960 states ~17840 transitions
pins2lts-mc-linux64( 4/ 8), 0.361: [Blue] ~59 levels ~1920 states ~23200 transitions
pins2lts-mc-linux64( 2/ 8), 0.376: [Blue] ~59 levels ~3840 states ~23504 transitions
pins2lts-mc-linux64( 2/ 8), 0.417: [Blue] ~59 levels ~7680 states ~31808 transitions
pins2lts-mc-linux64( 2/ 8), 0.488: [Blue] ~59 levels ~15360 states ~51168 transitions
pins2lts-mc-linux64( 2/ 8), 0.612: [Blue] ~59 levels ~30720 states ~96080 transitions
pins2lts-mc-linux64( 2/ 8), 0.877: [Blue] ~59 levels ~61440 states ~196400 transitions
pins2lts-mc-linux64( 2/ 8), 1.319: [Blue] ~59 levels ~122880 states ~408864 transitions
pins2lts-mc-linux64( 7/ 8), 2.237: [Blue] ~59 levels ~245760 states ~820880 transitions
pins2lts-mc-linux64( 7/ 8), 3.760: [Blue] ~59 levels ~491520 states ~1843744 transitions
pins2lts-mc-linux64( 7/ 8), 6.545: [Blue] ~59 levels ~983040 states ~4086544 transitions
pins2lts-mc-linux64( 7/ 8), 12.044: [Blue] ~59 levels ~1966080 states ~8901520 transitions
pins2lts-mc-linux64( 2/ 8), 23.993: [Blue] ~59 levels ~3932160 states ~19434208 transitions
pins2lts-mc-linux64( 2/ 8), 50.698: [Blue] ~59 levels ~7864320 states ~42982640 transitions
pins2lts-mc-linux64( 2/ 8), 109.443: [Blue] ~59 levels ~15728640 states ~92794128 transitions
pins2lts-mc-linux64( 2/ 8), 228.236: [Blue] ~59 levels ~31457280 states ~193980864 transitions
pins2lts-mc-linux64( 2/ 8), 493.201: [Blue] ~59 levels ~62914560 states ~415546384 transitions
pins2lts-mc-linux64( 2/ 8), 1083.277: [Blue] ~59 levels ~125829120 states ~876851808 transitions
pins2lts-mc-linux64( 3/ 8), 1441.660: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1441.702:
pins2lts-mc-linux64( 0/ 8), 1441.702: Explored 134204187 states 1093399554 transitions, fanout: 8.147
pins2lts-mc-linux64( 0/ 8), 1441.702: Total exploration time 1441.580 sec (1441.520 sec minimum, 1441.554 sec on average)
pins2lts-mc-linux64( 0/ 8), 1441.702: States per second: 93095, Transitions per second: 758473
pins2lts-mc-linux64( 0/ 8), 1441.702:
pins2lts-mc-linux64( 0/ 8), 1441.702: State space has 134217337 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1441.702: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1441.702: blue states: 134204187 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1441.702: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1441.702: all-red states: 134178338 (99.97%), bogus 4683 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1441.702:
pins2lts-mc-linux64( 0/ 8), 1441.702: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1441.702:
pins2lts-mc-linux64( 0/ 8), 1441.702: Queue width: 8B, total height: 472, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1441.702: Tree memory: 1057.0MB, 8.3 B/state, compr.: 4.3%
pins2lts-mc-linux64( 0/ 8), 1441.702: Tree fill ratio (roots/leafs): 99.0%/12.0%
pins2lts-mc-linux64( 0/ 8), 1441.702: Stored 88 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1441.702: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1441.702: Est. total memory use: 1057.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13469644440689552488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(!([]((LTLAPp0==true))&&(LTLAPp1==true)) U ( U (LTLAPp3==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13469644440689552488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(!([]((LTLAPp0==true))&&(LTLAPp1==true)) U ( U (LTLAPp3==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-22 00:29:56] [INFO ] Flatten gal took : 140 ms
[2023-03-22 00:29:56] [INFO ] Input system was already deterministic with 88 transitions.
[2023-03-22 00:30:04] [INFO ] Transformed 46 places.
[2023-03-22 00:30:04] [INFO ] Transformed 88 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-22 00:30:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality16338441497932807536.gal : 2 ms
[2023-03-22 00:30:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality9384178999965256660.ltl : 2 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16338441497932807536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9384178999965256660.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((!((G("(TX<=IA)"))&&("(DE>=1)")))U((!(G(("(AZ>=1)")U("(Total_D<=AK)"))))&&("(AZ>=1)"))))
Formula 0 simplified : ("(DE>=1)" & G"(TX<=IA)") R (!"(AZ>=1)" | G("(AZ>=1)" U "(Total_D<=AK)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 162708 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16214612 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Election2020-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Election2020-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838849900123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Election2020-PT-none.tgz
mv Election2020-PT-none execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;