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.r492-smll-171636266400212.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 ltsminxred
Input is Election2020-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266400212
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME Election2020-PT-none-LTLFireability-01
FORMULA_NAME Election2020-PT-none-LTLFireability-02
FORMULA_NAME Election2020-PT-none-LTLFireability-03
FORMULA_NAME Election2020-PT-none-LTLFireability-04
FORMULA_NAME Election2020-PT-none-LTLFireability-05
FORMULA_NAME Election2020-PT-none-LTLFireability-06
FORMULA_NAME Election2020-PT-none-LTLFireability-07
FORMULA_NAME Election2020-PT-none-LTLFireability-08
FORMULA_NAME Election2020-PT-none-LTLFireability-09
FORMULA_NAME Election2020-PT-none-LTLFireability-10
FORMULA_NAME Election2020-PT-none-LTLFireability-11
FORMULA_NAME Election2020-PT-none-LTLFireability-12
FORMULA_NAME Election2020-PT-none-LTLFireability-13
FORMULA_NAME Election2020-PT-none-LTLFireability-14
FORMULA_NAME Election2020-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717237948046

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Election2020-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:32:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:32:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:32:30] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-06-01 10:32:30] [INFO ] Transformed 53 places.
[2024-06-01 10:32:30] [INFO ] Transformed 102 transitions.
[2024-06-01 10:32:30] [INFO ] Parsed PT model containing 53 places and 102 transitions and 204 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Election2020-PT-none-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 102/102 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 51 transition count 51
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 65 place count 39 transition count 39
Iterating global reduction 1 with 12 rules applied. Total rules applied 77 place count 39 transition count 39
Applied a total of 77 rules in 58 ms. Remains 39 /53 variables (removed 14) and now considering 39/102 (removed 63) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
// Phase 1: matrix 39 rows 39 cols
[2024-06-01 10:32:31] [INFO ] Computed 0 invariants in 6 ms
[2024-06-01 10:32:31] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 10:32:31] [INFO ] Invariant cache hit.
[2024-06-01 10:32:31] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 39/53 places, 39/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 39/53 places, 39/102 transitions.
Support contains 21 out of 39 places after structural reductions.
[2024-06-01 10:32:32] [INFO ] Flatten gal took : 35 ms
[2024-06-01 10:32:32] [INFO ] Flatten gal took : 11 ms
[2024-06-01 10:32:32] [INFO ] Input system was already deterministic with 39 transitions.
RANDOM walk for 242 steps (0 resets) in 79 ms. (3 steps per ms) remains 0/21 properties
Computed a total of 39 stabilizing places and 39 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 39 transition count 39
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)&&F((G(p1)||G(p2))))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Graph (complete) has 0 edges and 39 vertex of which 4 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 35 output transitions
Drop transitions (Output transitions of discarded places.) removed 35 transitions
Applied a total of 1 rules in 12 ms. Remains 4 /39 variables (removed 35) and now considering 4/39 (removed 35) 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-06-01 10:32:32] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:32:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 10:32:32] [INFO ] Invariant cache hit.
[2024-06-01 10:32:32] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-01 10:32:32] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/39 places, 4/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 4/39 places, 4/39 transitions.
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Election2020-PT-none-LTLFireability-01
Product exploration explored 100000 steps with 24435 reset in 518 ms.
Product exploration explored 100000 steps with 24405 reset in 236 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 (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (F (G p0)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLFireability-01 finished in 1486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G(X(F(X(F(X(!(p0 U p1)))))))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 22 transition count 22
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 22 transition count 22
Applied a total of 34 rules in 3 ms. Remains 22 /39 variables (removed 17) and now considering 22/39 (removed 17) 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-06-01 10:32:34] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:32:34] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 10:32:34] [INFO ] Invariant cache hit.
[2024-06-01 10:32:34] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 96 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/39 places, 22/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 22/39 places, 22/39 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : Election2020-PT-none-LTLFireability-03
Entered a terminal (fully accepting) state of product in 340 steps with 12 reset in 2 ms.
FORMULA Election2020-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-03 finished in 304 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)&&F(G(p1))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Graph (complete) has 0 edges and 39 vertex of which 2 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 37 output transitions
Drop transitions (Output transitions of discarded places.) removed 37 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /39 variables (removed 37) and now considering 2/39 (removed 37) 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-06-01 10:32:34] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:32:34] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 10:32:34] [INFO ] Invariant cache hit.
[2024-06-01 10:32:34] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 10:32:34] [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/39 places, 2/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44 ms. Remains : 2/39 places, 2/39 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-04 finished in 171 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 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Graph (complete) has 0 edges and 39 vertex of which 1 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 38 output transitions
Drop transitions (Output transitions of discarded places.) removed 38 transitions
Applied a total of 1 rules in 3 ms. Remains 1 /39 variables (removed 38) and now considering 1/39 (removed 38) 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-06-01 10:32:34] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:32:34] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 10:32:34] [INFO ] Invariant cache hit.
[2024-06-01 10:32:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-01 10:32:34] [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/39 places, 1/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 1/39 places, 1/39 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-05 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' '!(G(F(p0)))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Graph (complete) has 0 edges and 39 vertex of which 1 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 38 output transitions
Drop transitions (Output transitions of discarded places.) removed 38 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /39 variables (removed 38) and now considering 1/39 (removed 38) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-06-01 10:32:34] [INFO ] Invariant cache hit.
[2024-06-01 10:32:34] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 10:32:34] [INFO ] Invariant cache hit.
[2024-06-01 10:32:34] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 10:32:34] [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/39 places, 1/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 1/39 places, 1/39 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Product exploration explored 100000 steps with 50000 reset in 197 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 (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLFireability-07 finished in 660 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 U (G(!p0)||(!p0&&(p1 U G(!p2))))))))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Graph (complete) has 0 edges and 39 vertex of which 3 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 36 output transitions
Drop transitions (Output transitions of discarded places.) removed 36 transitions
Applied a total of 1 rules in 2 ms. Remains 3 /39 variables (removed 36) and now considering 3/39 (removed 36) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 3 rows 3 cols
[2024-06-01 10:32:35] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:32:35] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 10:32:35] [INFO ] Invariant cache hit.
[2024-06-01 10:32:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 10:32:35] [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 : 3/39 places, 3/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 3/39 places, 3/39 transitions.
Stuttering acceptance computed with spot in 310 ms :[p0, p0, (AND p0 p2), (AND p0 p2)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-08
Product exploration explored 100000 steps with 25000 reset in 162 ms.
Product exploration explored 100000 steps with 25000 reset in 145 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 : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 (NOT p1) p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND p2 p1 (NOT p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (AND (NOT p2) p1 p0)), (X (NOT (AND (NOT p2) p1 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) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 29 ms. Reduced automaton from 4 states, 22 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLFireability-08 finished in 799 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 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Graph (complete) has 0 edges and 39 vertex of which 1 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 38 output transitions
Drop transitions (Output transitions of discarded places.) removed 38 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /39 variables (removed 38) and now considering 1/39 (removed 38) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
// Phase 1: matrix 1 rows 1 cols
[2024-06-01 10:32:36] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:32:36] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 10:32:36] [INFO ] Invariant cache hit.
[2024-06-01 10:32:36] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-01 10:32:36] [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/39 places, 1/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 1/39 places, 1/39 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-09 finished in 177 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((X(G(p0)) U G(p1))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 22 transition count 22
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 22 transition count 22
Applied a total of 34 rules in 3 ms. Remains 22 /39 variables (removed 17) and now considering 22/39 (removed 17) 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-06-01 10:32:36] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:32:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 10:32:36] [INFO ] Invariant cache hit.
[2024-06-01 10:32:36] [INFO ] Implicit Places using invariants and state equation in 57 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 : 22/39 places, 22/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 22/39 places, 22/39 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-10
Entered a terminal (fully accepting) state of product in 38 steps with 9 reset in 0 ms.
FORMULA Election2020-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-10 finished in 410 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' '!(((p0 U p1)&&X(X(X(G(p2))))))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 23 transition count 23
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 23 transition count 23
Applied a total of 32 rules in 3 ms. Remains 23 /39 variables (removed 16) and now considering 23/39 (removed 16) 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-06-01 10:32:36] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:32:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 10:32:36] [INFO ] Invariant cache hit.
[2024-06-01 10:32:36] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 92 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/39 places, 23/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 23/39 places, 23/39 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-11
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-11 finished in 403 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&&F(G(p1))))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 22 transition count 22
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 22 transition count 22
Applied a total of 34 rules in 3 ms. Remains 22 /39 variables (removed 17) and now considering 22/39 (removed 17) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
// Phase 1: matrix 22 rows 22 cols
[2024-06-01 10:32:37] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:32:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 10:32:37] [INFO ] Invariant cache hit.
[2024-06-01 10:32:37] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 86 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/39 places, 22/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 22/39 places, 22/39 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLFireability-12
Stuttering criterion allowed to conclude after 8023 steps with 135 reset in 30 ms.
FORMULA Election2020-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-12 finished in 353 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((p1||(p2&&G(!p1))))))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 23 transition count 23
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 23 transition count 23
Applied a total of 32 rules in 3 ms. Remains 23 /39 variables (removed 16) and now considering 23/39 (removed 16) 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-06-01 10:32:37] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:32:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 10:32:37] [INFO ] Invariant cache hit.
[2024-06-01 10:32:37] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 91 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/39 places, 23/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 23/39 places, 23/39 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true, p1]
Running random walk in product with property : Election2020-PT-none-LTLFireability-14
Product exploration explored 100000 steps with 21723 reset in 270 ms.
Product exploration explored 100000 steps with 21927 reset in 334 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 p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 725 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, false, false, p1]
RANDOM walk for 184 steps (0 resets) in 13 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 774 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, false, false, p1]
Stuttering acceptance computed with spot in 274 ms :[true, false, false, p1]
Support contains 1 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-06-01 10:32:40] [INFO ] Invariant cache hit.
[2024-06-01 10:32:40] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 10:32:40] [INFO ] Invariant cache hit.
[2024-06-01 10:32:40] [INFO ] Implicit Places using invariants and state equation in 52 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 1ms
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 23/23 places, 23/23 transitions.
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 : [p1, (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 255 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, false, false, p1]
RANDOM walk for 115 steps (0 resets) in 6 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 269 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, false, false, p1]
Stuttering acceptance computed with spot in 164 ms :[true, false, false, p1]
Stuttering acceptance computed with spot in 174 ms :[true, false, false, p1]
Product exploration explored 100000 steps with 22337 reset in 187 ms.
Product exploration explored 100000 steps with 22223 reset in 227 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 162 ms :[true, false, false, p1]
Support contains 1 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 1 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Applied a total of 1 rules in 3 ms. Remains 1 /23 variables (removed 22) and now considering 1/23 (removed 22) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
[2024-06-01 10:32:43] [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/23 places, 1/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16 ms. Remains : 1/23 places, 1/23 transitions.
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 21
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 21
Applied a total of 4 rules in 9 ms. Remains 21 /23 variables (removed 2) and now considering 21/23 (removed 2) 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-06-01 10:32:43] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:32:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 10:32:43] [INFO ] Invariant cache hit.
[2024-06-01 10:32:43] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 73 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/23 places, 21/23 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 21/23 places, 21/23 transitions.
Treatment of property Election2020-PT-none-LTLFireability-14 finished in 5647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 21 transition count 21
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 21 transition count 21
Applied a total of 36 rules in 2 ms. Remains 21 /39 variables (removed 18) and now considering 21/39 (removed 18) 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-06-01 10:32:43] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:32:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 10:32:43] [INFO ] Invariant cache hit.
[2024-06-01 10:32:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 79 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/39 places, 21/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 21/39 places, 21/39 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLFireability-15
Entered a terminal (fully accepting) state of product in 15 steps with 7 reset in 0 ms.
FORMULA Election2020-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLFireability-15 finished in 272 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((p1||(p2&&G(!p1))))))'
[2024-06-01 10:32:43] [INFO ] Flatten gal took : 8 ms
[2024-06-01 10:32:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 10:32:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 39 places, 39 transitions and 39 arcs took 8 ms.
Total runtime 13217 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Election2020-PT-none-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717238076533

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Election2020-PT-none-LTLFireability-14
ltl formula formula --ltl=/tmp/1052/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 39 places, 39 transitions and 39 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1052/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1052/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1052/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1052/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 40 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 40, there are 54 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~59 levels ~10000 states ~56776 transitions
pnml2lts-mc( 3/ 4): ~59 levels ~20000 states ~120340 transitions
pnml2lts-mc( 3/ 4): ~59 levels ~40000 states ~257692 transitions
pnml2lts-mc( 3/ 4): ~59 levels ~80000 states ~552412 transitions
pnml2lts-mc( 3/ 4): ~59 levels ~160000 states ~1181020 transitions
pnml2lts-mc( 3/ 4): ~59 levels ~320000 states ~2492916 transitions
pnml2lts-mc( 1/ 4): ~58 levels ~640000 states ~5274032 transitions
pnml2lts-mc( 0/ 4): ~58 levels ~1280000 states ~10917328 transitions
pnml2lts-mc( 0/ 4): ~58 levels ~2560000 states ~23010936 transitions
pnml2lts-mc( 0/ 4): ~58 levels ~5120000 states ~48432132 transitions
pnml2lts-mc( 0/ 4): ~58 levels ~10240000 states ~101086432 transitions
pnml2lts-mc( 0/ 4): ~58 levels ~20480000 states ~212276516 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33550331
pnml2lts-mc( 0/ 4): unique states count: 33550498
pnml2lts-mc( 0/ 4): unique transitions count: 358392784
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 324838407
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33550504
pnml2lts-mc( 0/ 4): - cum. max stack depth: 233
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33550504 states 358393018 transitions, fanout: 10.682
pnml2lts-mc( 0/ 4): Total exploration time 111.790 sec (111.740 sec minimum, 111.757 sec on average)
pnml2lts-mc( 0/ 4): States per second: 300121, Transitions per second: 3205949
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.3MB, 8.1 B/state, compr.: 5.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 39 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.3MB (~256.0MB paged-in)

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="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Election2020-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636266400212"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;