fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r425-tajo-167905977900251
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ShieldRVt-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
436.147 17287.00 32163.00 68.10 TFFFFFTTFFFFT?FT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977900251.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVt-PT-005B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977900251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 23:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 23:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 23:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 23:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 23:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 23:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 60K Mar 5 18:23 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 ShieldRVt-PT-005B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679306129204

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-005B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:55:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 09:55:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:55:30] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-20 09:55:30] [INFO ] Transformed 253 places.
[2023-03-20 09:55:30] [INFO ] Transformed 253 transitions.
[2023-03-20 09:55:30] [INFO ] Found NUPN structural information;
[2023-03-20 09:55:30] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVt-PT-005B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 253/253 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 208 transition count 208
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 208 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 207 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 207 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 206 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 206 transition count 206
Applied a total of 94 rules in 48 ms. Remains 206 /253 variables (removed 47) and now considering 206/253 (removed 47) transitions.
// Phase 1: matrix 206 rows 206 cols
[2023-03-20 09:55:31] [INFO ] Computed 21 place invariants in 12 ms
[2023-03-20 09:55:31] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-20 09:55:31] [INFO ] Invariant cache hit.
[2023-03-20 09:55:31] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-20 09:55:31] [INFO ] Invariant cache hit.
[2023-03-20 09:55:31] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/253 places, 206/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 206/253 places, 206/253 transitions.
Support contains 36 out of 206 places after structural reductions.
[2023-03-20 09:55:31] [INFO ] Flatten gal took : 38 ms
[2023-03-20 09:55:31] [INFO ] Flatten gal took : 15 ms
[2023-03-20 09:55:31] [INFO ] Input system was already deterministic with 206 transitions.
Finished random walk after 8936 steps, including 2 resets, run visited all 19 properties in 119 ms. (steps per millisecond=75 )
Computed a total of 61 stabilizing places and 61 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(X((F(p2)&&p1)))))'
Support contains 7 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 196 transition count 196
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 196 transition count 196
Applied a total of 20 rules in 7 ms. Remains 196 /206 variables (removed 10) and now considering 196/206 (removed 10) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-20 09:55:32] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 09:55:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-20 09:55:32] [INFO ] Invariant cache hit.
[2023-03-20 09:55:32] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-20 09:55:32] [INFO ] Invariant cache hit.
[2023-03-20 09:55:32] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/206 places, 196/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 196/206 places, 196/206 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), p0]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s72 1)), p1:(AND (OR (EQ s17 0) (EQ s187 1)) (OR (EQ s10 0) (EQ s137 1))), p2:(EQ s143 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4279 reset in 298 ms.
Product exploration explored 100000 steps with 4241 reset in 175 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/196 stabilizing places and 58/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2023-03-20 09:55:34] [INFO ] Invariant cache hit.
[2023-03-20 09:55:34] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-20 09:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:55:34] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-20 09:55:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:55:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 09:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:55:34] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-20 09:55:34] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 3 ms to minimize.
[2023-03-20 09:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-20 09:55:34] [INFO ] Computed and/alt/rep : 195/286/195 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-20 09:55:35] [INFO ] Added : 186 causal constraints over 38 iterations in 486 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 196 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-20 09:55:35] [INFO ] Invariant cache hit.
[2023-03-20 09:55:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-20 09:55:35] [INFO ] Invariant cache hit.
[2023-03-20 09:55:35] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-20 09:55:35] [INFO ] Invariant cache hit.
[2023-03-20 09:55:35] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 196/196 places, 196/196 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/196 stabilizing places and 58/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p2), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2023-03-20 09:55:35] [INFO ] Invariant cache hit.
[2023-03-20 09:55:36] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-20 09:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:55:36] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-20 09:55:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:55:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 09:55:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:55:36] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-20 09:55:36] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2023-03-20 09:55:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-20 09:55:36] [INFO ] Computed and/alt/rep : 195/286/195 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-20 09:55:36] [INFO ] Added : 186 causal constraints over 38 iterations in 539 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4317 reset in 147 ms.
Stack based approach found an accepted trace after 71777 steps with 3106 reset with depth 24 and stack size 24 in 150 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-01 finished in 5068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 197 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 197 transition count 197
Applied a total of 18 rules in 6 ms. Remains 197 /206 variables (removed 9) and now considering 197/206 (removed 9) transitions.
// Phase 1: matrix 197 rows 197 cols
[2023-03-20 09:55:37] [INFO ] Computed 21 place invariants in 11 ms
[2023-03-20 09:55:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-20 09:55:37] [INFO ] Invariant cache hit.
[2023-03-20 09:55:37] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-20 09:55:37] [INFO ] Invariant cache hit.
[2023-03-20 09:55:37] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s30 0) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 443 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-02 finished in 424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 197 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 197 transition count 197
Applied a total of 18 rules in 6 ms. Remains 197 /206 variables (removed 9) and now considering 197/206 (removed 9) transitions.
// Phase 1: matrix 197 rows 197 cols
[2023-03-20 09:55:37] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 09:55:37] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 09:55:37] [INFO ] Invariant cache hit.
[2023-03-20 09:55:37] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-20 09:55:37] [INFO ] Invariant cache hit.
[2023-03-20 09:55:37] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (NEQ s0 0) (NEQ s88 1)) (AND (NEQ s23 0) (NEQ s135 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 60269 steps with 54 reset in 117 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-04 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1&&G(p2))))'
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 205 transition count 156
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 156 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 155 transition count 155
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 100 place count 155 transition count 119
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 172 place count 119 transition count 119
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 181 place count 110 transition count 110
Iterating global reduction 3 with 9 rules applied. Total rules applied 190 place count 110 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 192 place count 110 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 193 place count 109 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 193 place count 109 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 201 place count 105 transition count 104
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 283 place count 64 transition count 63
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 307 place count 52 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 309 place count 50 transition count 69
Applied a total of 309 rules in 61 ms. Remains 50 /206 variables (removed 156) and now considering 69/206 (removed 137) transitions.
// Phase 1: matrix 69 rows 50 cols
[2023-03-20 09:55:38] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 09:55:38] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-20 09:55:38] [INFO ] Invariant cache hit.
[2023-03-20 09:55:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 09:55:38] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-20 09:55:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 09:55:38] [INFO ] Invariant cache hit.
[2023-03-20 09:55:38] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/206 places, 69/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 50/206 places, 69/206 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s9 0) (EQ s30 1)), p0:(OR (EQ s39 0) (EQ s18 1)), p2:(AND (OR (EQ s32 0) (EQ s43 1)) (OR (EQ s9 0) (EQ s30 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-05 finished in 432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 205 transition count 151
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 151 transition count 151
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 108 place count 151 transition count 115
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 180 place count 115 transition count 115
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 189 place count 106 transition count 106
Iterating global reduction 2 with 9 rules applied. Total rules applied 198 place count 106 transition count 106
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 198 place count 106 transition count 99
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 212 place count 99 transition count 99
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 288 place count 61 transition count 61
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 316 place count 47 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 318 place count 45 transition count 72
Applied a total of 318 rules in 22 ms. Remains 45 /206 variables (removed 161) and now considering 72/206 (removed 134) transitions.
// Phase 1: matrix 72 rows 45 cols
[2023-03-20 09:55:38] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-20 09:55:38] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 09:55:38] [INFO ] Invariant cache hit.
[2023-03-20 09:55:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 09:55:38] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-20 09:55:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 09:55:38] [INFO ] Invariant cache hit.
[2023-03-20 09:55:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/206 places, 72/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 45/206 places, 72/206 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-08 finished in 231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 196 transition count 196
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 196 transition count 196
Applied a total of 20 rules in 4 ms. Remains 196 /206 variables (removed 10) and now considering 196/206 (removed 10) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-20 09:55:38] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 09:55:38] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-20 09:55:38] [INFO ] Invariant cache hit.
[2023-03-20 09:55:39] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-20 09:55:39] [INFO ] Invariant cache hit.
[2023-03-20 09:55:39] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/206 places, 196/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 196/206 places, 196/206 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s119 0) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 122 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-09 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 205 transition count 154
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 154 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 153 transition count 153
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 104 place count 153 transition count 116
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 178 place count 116 transition count 116
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 186 place count 108 transition count 108
Iterating global reduction 3 with 8 rules applied. Total rules applied 194 place count 108 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 194 place count 108 transition count 102
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 206 place count 102 transition count 102
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 288 place count 61 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 289 place count 61 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 291 place count 60 transition count 59
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 317 place count 47 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 45 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 320 place count 44 transition count 68
Applied a total of 320 rules in 27 ms. Remains 44 /206 variables (removed 162) and now considering 68/206 (removed 138) transitions.
// Phase 1: matrix 68 rows 44 cols
[2023-03-20 09:55:39] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-20 09:55:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-20 09:55:39] [INFO ] Invariant cache hit.
[2023-03-20 09:55:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 09:55:39] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-20 09:55:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 09:55:39] [INFO ] Invariant cache hit.
[2023-03-20 09:55:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/206 places, 68/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 44/206 places, 68/206 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s27 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-11 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&(p1 U (p2||G(p1))))||((p1 U (p2||G(p1)))&&X(!p1))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 197 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 197 transition count 197
Applied a total of 18 rules in 6 ms. Remains 197 /206 variables (removed 9) and now considering 197/206 (removed 9) transitions.
// Phase 1: matrix 197 rows 197 cols
[2023-03-20 09:55:39] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 09:55:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 09:55:39] [INFO ] Invariant cache hit.
[2023-03-20 09:55:39] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-20 09:55:39] [INFO ] Invariant cache hit.
[2023-03-20 09:55:39] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NEQ s135 1) (NEQ s80 1)), p1:(NEQ s80 1), p0:(OR (EQ s19 0) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 254 reset in 176 ms.
Product exploration explored 100000 steps with 271 reset in 271 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 380 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1)]
Finished random walk after 725 steps, including 0 resets, run visited all 4 properties in 15 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 485 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1)]
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 197 /197 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-20 09:55:41] [INFO ] Invariant cache hit.
[2023-03-20 09:55:41] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-20 09:55:41] [INFO ] Invariant cache hit.
[2023-03-20 09:55:41] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-20 09:55:41] [INFO ] Invariant cache hit.
[2023-03-20 09:55:42] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 197/197 places, 197/197 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 342 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1)]
Finished random walk after 355 steps, including 0 resets, run visited all 4 properties in 16 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))]
Knowledge based reduction with 9 factoid took 443 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 264 reset in 153 ms.
Product exploration explored 100000 steps with 255 reset in 227 ms.
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 197 /197 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-20 09:55:44] [INFO ] Invariant cache hit.
[2023-03-20 09:55:44] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 09:55:44] [INFO ] Invariant cache hit.
[2023-03-20 09:55:44] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-20 09:55:44] [INFO ] Invariant cache hit.
[2023-03-20 09:55:44] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 197/197 places, 197/197 transitions.
Treatment of property ShieldRVt-PT-005B-LTLCardinality-13 finished in 4917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 199 transition count 199
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 199 transition count 199
Applied a total of 14 rules in 4 ms. Remains 199 /206 variables (removed 7) and now considering 199/206 (removed 7) transitions.
// Phase 1: matrix 199 rows 199 cols
[2023-03-20 09:55:44] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 09:55:44] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-20 09:55:44] [INFO ] Invariant cache hit.
[2023-03-20 09:55:44] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-20 09:55:44] [INFO ] Invariant cache hit.
[2023-03-20 09:55:44] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 199/206 places, 199/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 199/206 places, 199/206 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s175 0) (EQ s171 1)), p1:(OR (EQ s73 0) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 123 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-14 finished in 408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 197 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 197 transition count 197
Applied a total of 18 rules in 3 ms. Remains 197 /206 variables (removed 9) and now considering 197/206 (removed 9) transitions.
// Phase 1: matrix 197 rows 197 cols
[2023-03-20 09:55:44] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 09:55:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-20 09:55:44] [INFO ] Invariant cache hit.
[2023-03-20 09:55:45] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-20 09:55:45] [INFO ] Invariant cache hit.
[2023-03-20 09:55:45] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s81 0) (EQ s28 1)), p1:(OR (EQ s105 0) (EQ s20 1)), p2:(OR (EQ s20 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/197 stabilizing places and 59/197 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 p2)))
Knowledge based reduction with 8 factoid took 127 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-005B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-005B-LTLCardinality-15 finished in 865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&(p1 U (p2||G(p1))))||((p1 U (p2||G(p1)))&&X(!p1))))))'
Found a Shortening insensitive property : ShieldRVt-PT-005B-LTLCardinality-13
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1)]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 205 transition count 152
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 152 transition count 152
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 106 place count 152 transition count 116
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 178 place count 116 transition count 116
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 186 place count 108 transition count 108
Iterating global reduction 2 with 8 rules applied. Total rules applied 194 place count 108 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 194 place count 108 transition count 102
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 102 transition count 102
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 284 place count 63 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 285 place count 63 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 62 transition count 61
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 315 place count 48 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 317 place count 46 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 318 place count 45 transition count 71
Applied a total of 318 rules in 29 ms. Remains 45 /206 variables (removed 161) and now considering 71/206 (removed 135) transitions.
// Phase 1: matrix 71 rows 45 cols
[2023-03-20 09:55:45] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-20 09:55:46] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 09:55:46] [INFO ] Invariant cache hit.
[2023-03-20 09:55:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 09:55:46] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-20 09:55:46] [INFO ] Invariant cache hit.
[2023-03-20 09:55:46] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 45/206 places, 71/206 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 171 ms. Remains : 45/206 places, 71/206 transitions.
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NEQ s32 1) (NEQ s18 1)), p1:(NEQ s18 1), p0:(OR (EQ s4 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
Treatment of property ShieldRVt-PT-005B-LTLCardinality-13 finished in 404 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-20 09:55:46] [INFO ] Flatten gal took : 9 ms
[2023-03-20 09:55:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 09:55:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 206 places, 206 transitions and 502 arcs took 1 ms.
Total runtime 15356 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1274/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVt-PT-005B-LTLCardinality-13

BK_STOP 1679306146491

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVt-PT-005B-LTLCardinality-13
ltl formula formula --ltl=/tmp/1274/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 206 places, 206 transitions and 502 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.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1274/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1274/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1274/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1274/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="ShieldRVt-PT-005B"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-005B, 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 r425-tajo-167905977900251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-005B.tgz
mv ShieldRVt-PT-005B 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 ;