Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 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 1716573606773

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
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-24 18:00:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 18:00:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 18:00:09] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-24 18:00:09] [INFO ] Transformed 53 places.
[2024-05-24 18:00:09] [INFO ] Transformed 102 transitions.
[2024-05-24 18:00:09] [INFO ] Parsed PT model containing 53 places and 102 transitions and 204 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Election2020-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 102/102 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 38 transition count 72
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 38 transition count 72
Applied a total of 30 rules in 44 ms. Remains 38 /53 variables (removed 15) and now considering 72/102 (removed 30) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 4ms
// Phase 1: matrix 72 rows 38 cols
[2024-05-24 18:00:10] [INFO ] Computed 1 invariants in 10 ms
[2024-05-24 18:00:10] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-24 18:00:10] [INFO ] Invariant cache hit.
[2024-05-24 18:00:10] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 38/53 places, 72/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 38/53 places, 72/102 transitions.
Support contains 22 out of 38 places after structural reductions.
[2024-05-24 18:00:10] [INFO ] Flatten gal took : 48 ms
[2024-05-24 18:00:10] [INFO ] Flatten gal took : 19 ms
[2024-05-24 18:00:10] [INFO ] Input system was already deterministic with 72 transitions.
RANDOM walk for 679 steps (8 resets) in 121 ms. (5 steps per ms) remains 0/16 properties
FORMULA Election2020-PT-none-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 38 stabilizing places and 72 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 38 transition count 72
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 2 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 68 output transitions
Drop transitions (Output transitions of discarded places.) removed 68 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 27 ms. Remains 2 /38 variables (removed 36) and now considering 2/72 (removed 70) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 18:00:11] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 18:00:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 18:00:11] [INFO ] Invariant cache hit.
[2024-05-24 18:00:11] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 18:00:11] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/38 places, 2/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 2/38 places, 2/72 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA Election2020-PT-none-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-00 finished in 543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 1 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 70 output transitions
Drop transitions (Output transitions of discarded places.) removed 70 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1 transition count 1
Applied a total of 2 rules in 4 ms. Remains 1 /38 variables (removed 37) and now considering 1/72 (removed 71) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 1 rows 1 cols
[2024-05-24 18:00:11] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 18:00:11] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 18:00:11] [INFO ] Invariant cache hit.
[2024-05-24 18:00:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 18:00:11] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1/38 places, 1/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 1/38 places, 1/72 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 452 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 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 99 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 165 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 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
[2024-05-24 18:00:13] [INFO ] Invariant cache hit.
[2024-05-24 18:00:13] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 18:00:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 18:00:13] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 18:00:13] [INFO ] Invariant cache hit.
[2024-05-24 18:00:13] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 18:00:13] [INFO ] Invariant cache hit.
[2024-05-24 18:00:13] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-24 18:00:13] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44 ms. Remains : 1/1 places, 1/1 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 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 p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-24 18:00:13] [INFO ] Invariant cache hit.
[2024-05-24 18:00:14] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 18:00:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 18:00:14] [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 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Built C files in :
/tmp/ltsmin6742806221887176455
[2024-05-24 18:00:14] [INFO ] Computing symmetric may disable matrix : 1 transitions.
[2024-05-24 18:00:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:14] [INFO ] Computing symmetric may enable matrix : 1 transitions.
[2024-05-24 18:00:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:14] [INFO ] Computing Do-Not-Accords matrix : 1 transitions.
[2024-05-24 18:00:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:14] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6742806221887176455
Running compilation step : cd /tmp/ltsmin6742806221887176455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 329 ms.
Running link step : cd /tmp/ltsmin6742806221887176455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin6742806221887176455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased140516739602531080.hoa' '--buchi-type=spotba'
LTSmin run took 125 ms.
FORMULA Election2020-PT-none-LTLCardinality-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Election2020-PT-none-LTLCardinality-04 finished in 3176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 51 place count 23 transition count 23
Iterating global reduction 1 with 13 rules applied. Total rules applied 64 place count 23 transition count 23
Applied a total of 64 rules in 10 ms. Remains 23 /38 variables (removed 15) and now considering 23/72 (removed 49) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 23 rows 23 cols
[2024-05-24 18:00:15] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 18:00:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 18:00:15] [INFO ] Invariant cache hit.
[2024-05-24 18:00:15] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 23/38 places, 23/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 23/38 places, 23/72 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-05
Product exploration explored 100000 steps with 1694 reset in 258 ms.
Product exploration explored 100000 steps with 1694 reset in 273 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 23
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 1044 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1560 steps (19 resets) in 37 ms. (41 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 1927 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Graph (complete) has 0 edges and 23 vertex of which 4 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Applied a total of 1 rules in 3 ms. Remains 4 /23 variables (removed 19) and now considering 4/23 (removed 19) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 18:00:19] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 18:00:19] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 18:00:19] [INFO ] Invariant cache hit.
[2024-05-24 18:00:19] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-24 18:00:19] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/23 places, 4/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 4/23 places, 4/23 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 (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 12 factoid took 1256 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 204 steps (17 resets) in 5 ms. (34 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 1967 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11111 reset in 188 ms.
Product exploration explored 100000 steps with 11111 reset in 417 ms.
Built C files in :
/tmp/ltsmin2472182309273193344
[2024-05-24 18:00:23] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-24 18:00:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:23] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-24 18:00:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:23] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-24 18:00:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2472182309273193344
Running compilation step : cd /tmp/ltsmin2472182309273193344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 168 ms.
Running link step : cd /tmp/ltsmin2472182309273193344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin2472182309273193344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14994512916164122523.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA Election2020-PT-none-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Election2020-PT-none-LTLCardinality-05 finished in 8932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&X(G(p1))) U (p2||X(!p0))))'
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 22 transition count 22
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 22 transition count 22
Applied a total of 66 rules in 3 ms. Remains 22 /38 variables (removed 16) and now considering 22/72 (removed 50) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 22 rows 22 cols
[2024-05-24 18:00:24] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 18:00:24] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 18:00:24] [INFO ] Invariant cache hit.
[2024-05-24 18:00:24] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 22/38 places, 22/72 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 49 steps with 1 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-06 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 21 transition count 21
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 21 transition count 21
Applied a total of 68 rules in 4 ms. Remains 21 /38 variables (removed 17) and now considering 21/72 (removed 51) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 21 rows 21 cols
[2024-05-24 18:00:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 18:00:24] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 18:00:24] [INFO ] Invariant cache hit.
[2024-05-24 18:00:24] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 21/38 places, 21/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 21/38 places, 21/72 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Election2020-PT-none-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-08 finished in 333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((!p1||F(p2)))||p0))))'
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 26 transition count 50
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 26 transition count 50
Applied a total of 23 rules in 6 ms. Remains 26 /38 variables (removed 12) and now considering 50/72 (removed 22) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 50 rows 26 cols
[2024-05-24 18:00:24] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 18:00:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 18:00:24] [INFO ] Invariant cache hit.
[2024-05-24 18:00:24] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-24 18:00:24] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/38 places, 50/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 26/38 places, 50/72 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-10
Product exploration explored 100000 steps with 1706 reset in 416 ms.
Product exploration explored 100000 steps with 1699 reset in 309 ms.
Computed a total of 26 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 2361 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 109 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 24084 steps (344 resets) in 207 ms. (115 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p1 p0))), (F (NOT (OR p2 (NOT p1) p0)))]
Knowledge based reduction with 5 factoid took 3166 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 109 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 18:00:31] [INFO ] Invariant cache hit.
[2024-05-24 18:00:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 18:00:31] [INFO ] Invariant cache hit.
[2024-05-24 18:00:31] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-24 18:00:31] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 26/26 places, 50/50 transitions.
Computed a total of 26 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 2656 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 110 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 28688 steps (409 resets) in 129 ms. (220 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p1 p0))), (F (NOT (OR p2 (NOT p1) p0)))]
Knowledge based reduction with 5 factoid took 3228 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 111 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Product exploration explored 100000 steps with 1701 reset in 420 ms.
Product exploration explored 100000 steps with 1701 reset in 448 ms.
Built C files in :
/tmp/ltsmin2282497176529946483
[2024-05-24 18:00:39] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-05-24 18:00:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:39] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-05-24 18:00:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:39] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-05-24 18:00:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:39] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2282497176529946483
Running compilation step : cd /tmp/ltsmin2282497176529946483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 345 ms.
Running link step : cd /tmp/ltsmin2282497176529946483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2282497176529946483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7539657690473182434.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 18:00:54] [INFO ] Invariant cache hit.
[2024-05-24 18:00:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 18:00:54] [INFO ] Invariant cache hit.
[2024-05-24 18:00:54] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-24 18:00:54] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 26/26 places, 50/50 transitions.
Built C files in :
/tmp/ltsmin14000696474448185111
[2024-05-24 18:00:54] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-05-24 18:00:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:54] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-05-24 18:00:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:54] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-05-24 18:00:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:00:54] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14000696474448185111
Running compilation step : cd /tmp/ltsmin14000696474448185111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 289 ms.
Running link step : cd /tmp/ltsmin14000696474448185111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14000696474448185111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12138455083730443295.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 18:01:09] [INFO ] Flatten gal took : 4 ms
[2024-05-24 18:01:09] [INFO ] Flatten gal took : 3 ms
[2024-05-24 18:01:09] [INFO ] Time to serialize gal into /tmp/LTL17164755997066391364.gal : 2 ms
[2024-05-24 18:01:09] [INFO ] Time to serialize properties into /tmp/LTL10617158753387590006.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17164755997066391364.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15001561838841413529.hoa' '-atoms' '/tmp/LTL10617158753387590006.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10617158753387590006.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15001561838841413529.hoa
Detected timeout of ITS tools.
[2024-05-24 18:01:24] [INFO ] Flatten gal took : 6 ms
[2024-05-24 18:01:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 18:01:24] [INFO ] Time to serialize gal into /tmp/LTL16166759312185925006.gal : 2 ms
[2024-05-24 18:01:24] [INFO ] Time to serialize properties into /tmp/LTL12366920528042400633.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16166759312185925006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12366920528042400633.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((MI>NY)||(Total_R>AK))")||(G(("(MT>=1)")||(F("(WI>=3)"))))))))
Formula 0 simplified : G(F!"(MT>=1)" & FG(!"((MI>NY)||(Total_R>AK))" & !"(WI>=3)"))
Detected timeout of ITS tools.
[2024-05-24 18:01:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 18:01:39] [INFO ] Applying decomposition
[2024-05-24 18:01:39] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6849304194451860580.txt' '-o' '/tmp/graph6849304194451860580.bin' '-w' '/tmp/graph6849304194451860580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6849304194451860580.bin' '-l' '-1' '-v' '-w' '/tmp/graph6849304194451860580.weights' '-q' '0' '-e' '0.001'
[2024-05-24 18:01:39] [INFO ] Decomposing Gal with order
[2024-05-24 18:01:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 18:01:39] [INFO ] Flatten gal took : 48 ms
[2024-05-24 18:01:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 18:01:39] [INFO ] Time to serialize gal into /tmp/LTL85609904361662765.gal : 2 ms
[2024-05-24 18:01:39] [INFO ] Time to serialize properties into /tmp/LTL14658298734102204824.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL85609904361662765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14658298734102204824.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("((gu1.MI>gu1.NY)||(gu0.Total_R>gu0.AK))")||(G(("(gu0.MT>=1)")||(F("(gu0.WI>=3)"))))))))
Formula 0 simplified : G(F!"(gu0.MT>=1)" & FG(!"((gu1.MI>gu1.NY)||(gu0.Total_R>gu0.AK))" & !"(gu0.WI>=3)"))
Detected timeout of ITS tools.
Treatment of property Election2020-PT-none-LTLCardinality-10 finished in 90187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 24 transition count 46
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 24 transition count 46
Applied a total of 27 rules in 4 ms. Remains 24 /38 variables (removed 14) and now considering 46/72 (removed 26) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 46 rows 24 cols
[2024-05-24 18:01:54] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 18:01:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 18:01:54] [INFO ] Invariant cache hit.
[2024-05-24 18:01:54] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-24 18:01:54] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/38 places, 46/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 24/38 places, 46/72 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-11
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA Election2020-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-11 finished in 134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&G(p1)))))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 22 transition count 22
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 22 transition count 22
Applied a total of 66 rules in 1 ms. Remains 22 /38 variables (removed 16) and now considering 22/72 (removed 50) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 22 rows 22 cols
[2024-05-24 18:01:55] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 18:01:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 18:01:55] [INFO ] Invariant cache hit.
[2024-05-24 18:01:55] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 22/38 places, 22/72 transitions.
Stuttering acceptance computed with spot in 145 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
Product exploration explored 100000 steps with 1964 reset in 138 ms.
Product exploration explored 100000 steps with 2001 reset in 195 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 (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 532 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
RANDOM walk for 868 steps (10 resets) in 10 ms. (78 steps per ms) remains 0/4 properties
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 (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 3 factoid took 999 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
[2024-05-24 18:01:58] [INFO ] Invariant cache hit.
[2024-05-24 18:01:58] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-24 18:01:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:01:58] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 18:01:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 18:01:58] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-24 18:01:58] [INFO ] Invariant cache hit.
[2024-05-24 18:01:58] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 18:01:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:01:58] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 18:01:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 18:01:58] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (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 (Output transitions of discarded places.) 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.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 18:01:58] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 18:01:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 18:01:58] [INFO ] Invariant cache hit.
[2024-05-24 18:01:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-24 18:01:58] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
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 62 ms. Remains : 2/22 places, 2/22 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0))]
Knowledge based reduction with 8 factoid took 851 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
RANDOM walk for 10 steps (1 resets) in 6 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F p0)]
Knowledge based reduction with 8 factoid took 1242 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
[2024-05-24 18:02:01] [INFO ] Invariant cache hit.
[2024-05-24 18:02:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 18:02:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 18:02:01] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-24 18:02:01] [INFO ] Invariant cache hit.
[2024-05-24 18:02:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 18:02:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 18:02:01] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-24 18:02:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 18:02:01] [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 376 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Product exploration explored 100000 steps with 33333 reset in 90 ms.
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Built C files in :
/tmp/ltsmin17026730171482433412
[2024-05-24 18:02:02] [INFO ] Computing symmetric may disable matrix : 2 transitions.
[2024-05-24 18:02:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:02:02] [INFO ] Computing symmetric may enable matrix : 2 transitions.
[2024-05-24 18:02:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:02:02] [INFO ] Computing Do-Not-Accords matrix : 2 transitions.
[2024-05-24 18:02:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:02:02] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17026730171482433412
Running compilation step : cd /tmp/ltsmin17026730171482433412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 152 ms.
Running link step : cd /tmp/ltsmin17026730171482433412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17026730171482433412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14396936674957463509.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA Election2020-PT-none-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Election2020-PT-none-LTLCardinality-12 finished in 7619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 2 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 68 output transitions
Drop transitions (Output transitions of discarded places.) removed 68 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 3 ms. Remains 2 /38 variables (removed 36) and now considering 2/72 (removed 70) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 18:02:02] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 18:02:02] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 18:02:02] [INFO ] Invariant cache hit.
[2024-05-24 18:02:02] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-24 18:02:02] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/38 places, 2/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 2/38 places, 2/72 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-13
Product exploration explored 100000 steps with 40015 reset in 263 ms.
Product exploration explored 100000 steps with 40030 reset in 248 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLCardinality-13 finished in 692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 22 transition count 22
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 22 transition count 22
Applied a total of 66 rules in 14 ms. Remains 22 /38 variables (removed 16) and now considering 22/72 (removed 50) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 22 rows 22 cols
[2024-05-24 18:02:03] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 18:02:03] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 18:02:03] [INFO ] Invariant cache hit.
[2024-05-24 18:02:03] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 22/38 places, 22/72 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-14
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA Election2020-PT-none-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-14 finished in 183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((!p1||F(p2)))||p0))))'
[2024-05-24 18:02:03] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin963776766064159338
[2024-05-24 18:02:03] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2024-05-24 18:02:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:02:03] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2024-05-24 18:02:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:02:03] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2024-05-24 18:02:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:02:03] [INFO ] Applying decomposition
[2024-05-24 18:02:03] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin963776766064159338
Running compilation step : cd /tmp/ltsmin963776766064159338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 18:02:03] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12075910279930364164.txt' '-o' '/tmp/graph12075910279930364164.bin' '-w' '/tmp/graph12075910279930364164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12075910279930364164.bin' '-l' '-1' '-v' '-w' '/tmp/graph12075910279930364164.weights' '-q' '0' '-e' '0.001'
[2024-05-24 18:02:03] [INFO ] Decomposing Gal with order
[2024-05-24 18:02:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 18:02:03] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-24 18:02:03] [INFO ] Flatten gal took : 18 ms
[2024-05-24 18:02:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2024-05-24 18:02:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality11166901930559575785.gal : 2 ms
[2024-05-24 18:02:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality15243069717134347894.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11166901930559575785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15243069717134347894.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G(F(("((gu2.MI>gu2.NY)||(gu1.Total_R>gu1.AK))")||(G(("(gu0.MT>=1)")||(F("(gu0.WI>=3)"))))))))
Formula 0 simplified : G(F!"(gu0.MT>=1)" & FG(!"((gu2.MI>gu2.NY)||(gu1.Total_R>gu1.AK))" & !"(gu0.WI>=3)"))
Compilation finished in 294 ms.
Running link step : cd /tmp/ltsmin963776766064159338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin963776766064159338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((!(LTLAPp1==true)||<>((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 18:22:42] [INFO ] Flatten gal took : 5 ms
[2024-05-24 18:22:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality10470902895402549195.gal : 2 ms
[2024-05-24 18:22:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality7998059274088578226.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10470902895402549195.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7998059274088578226.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F(("((MI>NY)||(Total_R>AK))")||(G(("(MT>=1)")||(F("(WI>=3)"))))))))
Formula 0 simplified : G(F!"(MT>=1)" & FG(!"((MI>NY)||(Total_R>AK))" & !"(WI>=3)"))
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Initializing POR dependencies: labels 75, guards 72
pins2lts-mc-linux64( 3/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: LTL layer: formula: [](<>(([]((!(LTLAPp1==true)||<>((LTLAPp2==true))))||(LTLAPp0==true))))
pins2lts-mc-linux64( 0/ 8), 0.028: "[](<>(([]((!(LTLAPp1==true)||<>((LTLAPp2==true))))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.028: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.090: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 0.093: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.112: There are 76 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.112: State length is 39, there are 78 groups
pins2lts-mc-linux64( 0/ 8), 0.112: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.112: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.112: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.112: Visible groups: 0 / 78, labels: 3 / 76
pins2lts-mc-linux64( 0/ 8), 0.112: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.112: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.406: [Blue] ~59 levels ~960 states ~16768 transitions
pins2lts-mc-linux64( 2/ 8), 0.434: [Blue] ~59 levels ~1920 states ~19904 transitions
pins2lts-mc-linux64( 2/ 8), 0.489: [Blue] ~59 levels ~3840 states ~27584 transitions
pins2lts-mc-linux64( 2/ 8), 0.652: [Blue] ~59 levels ~7680 states ~45024 transitions
pins2lts-mc-linux64( 2/ 8), 0.864: [Blue] ~59 levels ~15360 states ~86328 transitions
pins2lts-mc-linux64( 2/ 8), 1.134: [Blue] ~59 levels ~30720 states ~183768 transitions
pins2lts-mc-linux64( 0/ 8), 1.636: [Blue] ~59 levels ~61440 states ~373816 transitions
pins2lts-mc-linux64( 0/ 8), 2.458: [Blue] ~59 levels ~122880 states ~787640 transitions
pins2lts-mc-linux64( 0/ 8), 4.066: [Blue] ~59 levels ~245760 states ~1719096 transitions
pins2lts-mc-linux64( 3/ 8), 6.876: [Blue] ~59 levels ~491520 states ~3866824 transitions
pins2lts-mc-linux64( 3/ 8), 11.494: [Blue] ~59 levels ~983040 states ~8333192 transitions
pins2lts-mc-linux64( 6/ 8), 20.200: [Blue] ~59 levels ~1966080 states ~18104344 transitions
pins2lts-mc-linux64( 2/ 8), 39.195: [Blue] ~59 levels ~3932160 states ~39805384 transitions
pins2lts-mc-linux64( 2/ 8), 77.864: [Blue] ~59 levels ~7864320 states ~83273080 transitions
pins2lts-mc-linux64( 2/ 8), 163.667: [Blue] ~59 levels ~15728640 states ~180221368 transitions
pins2lts-mc-linux64( 2/ 8), 343.364: [Blue] ~59 levels ~31457280 states ~378386776 transitions
pins2lts-mc-linux64( 2/ 8), 736.597: [Blue] ~59 levels ~62914560 states ~804994200 transitions
pins2lts-mc-linux64( 2/ 8), 1637.842: [Blue] ~59 levels ~125829120 states ~1728670360 transitions
pins2lts-mc-linux64( 1/ 8), 1993.912: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1993.964:
pins2lts-mc-linux64( 0/ 8), 1993.964: Explored 134207102 states 1967080424 transitions, fanout: 14.657
pins2lts-mc-linux64( 0/ 8), 1993.964: Total exploration time 1993.840 sec (1993.780 sec minimum, 1993.807 sec on average)
pins2lts-mc-linux64( 0/ 8), 1993.964: States per second: 67311, Transitions per second: 986579
pins2lts-mc-linux64( 0/ 8), 1993.964:
pins2lts-mc-linux64( 0/ 8), 1993.964: State space has 134217384 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1993.964: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1993.964: blue states: 134207102 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1993.964: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1993.964: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1993.964:
pins2lts-mc-linux64( 0/ 8), 1993.964: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1993.964:
pins2lts-mc-linux64( 0/ 8), 1993.964: Queue width: 8B, total height: 472, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1993.964: Tree memory: 1213.6MB, 9.5 B/state, compr.: 6.0%
pins2lts-mc-linux64( 0/ 8), 1993.964: Tree fill ratio (roots/leafs): 99.0%/74.0%
pins2lts-mc-linux64( 0/ 8), 1993.964: Stored 73 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1993.964: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1993.964: Est. total memory use: 1213.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin963776766064159338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((!(LTLAPp1==true)||<>((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin963776766064159338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((!(LTLAPp1==true)||<>((LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-24 18:43:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 18:43:21] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-24 18:43:21] [INFO ] Transformed 38 places.
[2024-05-24 18:43:21] [INFO ] Transformed 72 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 18:43:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality11925803653296210991.gal : 1 ms
[2024-05-24 18:43:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality11598878533407551699.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11925803653296210991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11598878533407551699.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((MI>NY)||(Total_R>AK))")||(G(("(MT>=1)")||(F("(WI>=3)"))))))))
Formula 0 simplified : G(F!"(MT>=1)" & FG(!"((MI>NY)||(Total_R>AK))" & !"(WI>=3)"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="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-5568"
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 r158-smll-171636266400211"
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 ;