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.r423-tajo-167905976300131.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 lolaxred
Input is ShieldRVs-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976300131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 256K 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 ShieldRVs-PT-040A-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-040A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679242651087

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:17:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 16:17:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:17:33] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-19 16:17:33] [INFO ] Transformed 563 places.
[2023-03-19 16:17:33] [INFO ] Transformed 763 transitions.
[2023-03-19 16:17:33] [INFO ] Found NUPN structural information;
[2023-03-19 16:17:33] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-040A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 95 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-19 16:17:34] [INFO ] Computed 161 place invariants in 30 ms
[2023-03-19 16:17:34] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-19 16:17:34] [INFO ] Invariant cache hit.
[2023-03-19 16:17:35] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
[2023-03-19 16:17:35] [INFO ] Invariant cache hit.
[2023-03-19 16:17:47] [INFO ] Dead Transitions using invariants and state equation in 12030 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13629 ms. Remains : 563/563 places, 763/763 transitions.
Support contains 28 out of 563 places after structural reductions.
[2023-03-19 16:17:48] [INFO ] Flatten gal took : 189 ms
[2023-03-19 16:17:48] [INFO ] Flatten gal took : 106 ms
[2023-03-19 16:17:48] [INFO ] Input system was already deterministic with 763 transitions.
Finished random walk after 2376 steps, including 4 resets, run visited all 19 properties in 150 ms. (steps per millisecond=15 )
FORMULA ShieldRVs-PT-040A-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 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' '!((X(G(p0))||F(p1)))'
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 25 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-19 16:17:48] [INFO ] Invariant cache hit.
[2023-03-19 16:17:49] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-19 16:17:49] [INFO ] Invariant cache hit.
[2023-03-19 16:17:49] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
[2023-03-19 16:17:49] [INFO ] Invariant cache hit.
[2023-03-19 16:17:50] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1404 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s267 1), p0:(OR (EQ s233 0) (EQ s294 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][false, false, false]]
Product exploration explored 100000 steps with 387 reset in 518 ms.
Product exploration explored 100000 steps with 385 reset in 548 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 346 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 260 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 26 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-19 16:17:52] [INFO ] Invariant cache hit.
[2023-03-19 16:17:53] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-19 16:17:53] [INFO ] Invariant cache hit.
[2023-03-19 16:17:53] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
[2023-03-19 16:17:53] [INFO ] Invariant cache hit.
[2023-03-19 16:17:54] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1722 ms. Remains : 563/563 places, 763/763 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 323 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 334 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 389 reset in 418 ms.
Product exploration explored 100000 steps with 386 reset in 475 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 563 transition count 763
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 67 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-19 16:17:57] [INFO ] Redundant transitions in 321 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 762 rows 563 cols
[2023-03-19 16:17:57] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-19 16:17:57] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 563/563 places, 762/763 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 58 ms. Remains 563 /563 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1194 ms. Remains : 563/563 places, 762/763 transitions.
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 10 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-19 16:17:57] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-19 16:18:02] [INFO ] Implicit Places using invariants in 4193 ms returned []
[2023-03-19 16:18:02] [INFO ] Invariant cache hit.
[2023-03-19 16:18:02] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 4912 ms to find 0 implicit places.
[2023-03-19 16:18:02] [INFO ] Invariant cache hit.
[2023-03-19 16:18:03] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5538 ms. Remains : 563/563 places, 763/763 transitions.
Treatment of property ShieldRVs-PT-040A-LTLCardinality-00 finished in 14743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 61 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-19 16:18:03] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-19 16:18:04] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-19 16:18:04] [INFO ] Invariant cache hit.
[2023-03-19 16:18:04] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2023-03-19 16:18:04] [INFO ] Redundant transitions in 122 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2023-03-19 16:18:04] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-19 16:18:05] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/563 places, 760/763 transitions.
Applied a total of 0 rules in 26 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1832 ms. Remains : 561/563 places, 760/763 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s191 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 532 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-03 finished in 1946 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((((!F(p1)||p0) U p2)&&(G(p4)||p3)))))'
Support contains 6 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 40 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2023-03-19 16:18:05] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-19 16:18:20] [INFO ] Implicit Places using invariants in 14439 ms returned []
[2023-03-19 16:18:20] [INFO ] Invariant cache hit.
[2023-03-19 16:18:20] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 15100 ms to find 0 implicit places.
[2023-03-19 16:18:20] [INFO ] Redundant transitions in 134 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2023-03-19 16:18:20] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-19 16:18:21] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/563 places, 761/763 transitions.
Applied a total of 0 rules in 19 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15732 ms. Remains : 562/563 places, 761/763 transitions.
Stuttering acceptance computed with spot in 664 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p4)), (AND p1 (NOT p2) (NOT p4))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4)), acceptance={1} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4)), acceptance={0, 1} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4)), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) p1 (NOT p4))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1) (NOT p4))), acceptance={1} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p0 p3 p1) (AND (NOT p2) p0 p1 p4)), acceptance={0, 1} source=2 dest: 3}, { cond=(OR (AND p2 (NOT p3) p1 p4) (AND p0 (NOT p3) p1 p4)), acceptance={0} source=2 dest: 4}, { cond=(OR (AND (NOT p2) p0 p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1) p4)), acceptance={1} source=2 dest: 5}, { cond=(OR (AND p2 (NOT p3) (NOT p1) p4) (AND p0 (NOT p3) (NOT p1) p4)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) (NOT p4))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p3 (NOT p1) (NOT p4)), acceptance={1} source=4 dest: 2}, { cond=(OR (AND (NOT p2) p0 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p1) (NOT p4))), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p4)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p3 (NOT p1) p4), acceptance={} source=4 dest: 6}, { cond=(OR (AND (NOT p2) p0 p3 p4) (AND (NOT p2) p3 (NOT p1) p4)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=5 dest: 5}], [{ cond=(OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) p1 (NOT p4))), acceptance={0, 1} source=6 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p1) (NOT p4))), acceptance={1} source=6 dest: 2}, { cond=(AND (NOT p2) p0 p3 p1 (NOT p4)), acceptance={0, 1} source=6 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p1 p4)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p0 p3 (NOT p1) (NOT p4)), acceptance={1} source=6 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1) p4) (AND (NOT p3) (NOT p1) p4)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p0 p3 p1 p4), acceptance={0} source=6 dest: 7}, { cond=(AND (NOT p2) p0 p3 (NOT p1) p4), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) p1 (NOT p4)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)), acceptance={1} source=7 dest: 2}, { cond=(OR (AND (NOT p2) p0 (NOT p4)) (AND (NOT p2) (NOT p1) (NOT p4))), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1 p4), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) p4), acceptance={} source=7 dest: 6}, { cond=(OR (AND (NOT p2) p0 p4) (AND (NOT p2) (NOT p1) p4)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1 (NOT p4)), acceptance={0, 1} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)), acceptance={1} source=8 dest: 2}, { cond=(AND (NOT p2) p0 p1 (NOT p4)), acceptance={0, 1} source=8 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1 p4), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p4)), acceptance={1} source=8 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) p4), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p0 p1 p4), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p1) p4), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(OR (EQ s174 0) (EQ s535 1)), p0:(OR (EQ s174 0) (EQ s535 1)), p1:(OR (EQ s382 0) (EQ s553 1)), p3:(OR (EQ s429 0) (EQ s175 1)), p4:(AND (EQ s175 0) (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 3457 reset in 688 ms.
Product exploration explored 100000 steps with 3499 reset in 808 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 p1 p3 (NOT p4)), (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0 p3 p4) (AND (NOT p2) p3 (NOT p1) p4)))), (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p0 (NOT p3) p1 p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p1) (NOT p4))))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 p1) (AND (NOT p2) p0 p1 p4)))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p1) p4) (AND p0 (NOT p3) (NOT p1) p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1) (NOT p4))))), (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1) p4)))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) p4))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4)))), (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) p1 (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p4)))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p4)) (AND (NOT p2) (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 p4) (AND (NOT p2) p3 (NOT p1) p4))))), (X (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p0 (NOT p3) p1 p4))))), (X (X (NOT (AND (NOT p2) p0 p3 p1 (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p4) (AND (NOT p2) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) p4) (AND (NOT p3) (NOT p1) p4))))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) p4)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))), (X (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4))))), (X (X (AND (NOT p2) (NOT p0) p1 (NOT p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p1 p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4))))), (X (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) p1 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1) p4)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 p1) (AND (NOT p2) p0 p1 p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4))))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p1) p4) (AND p0 (NOT p3) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1) (NOT p4)))))), (X (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0 p3 p1 p4)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1) p4))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 p4)))), (X (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) p1 (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p4)))))]
False Knowledge obtained : []
Knowledge based reduction with 55 factoid took 30483 ms. Reduced automaton from 9 states, 50 edges and 5 AP (stutter insensitive) to 9 states, 50 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 776 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p4)), (AND p1 (NOT p2) (NOT p4))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 39) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-19 16:18:56] [INFO ] Invariant cache hit.
[2023-03-19 16:18:56] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :14 sat :0
Fused 14 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 14 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1 p3 (NOT p4)), (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0 p3 p4) (AND (NOT p2) p3 (NOT p1) p4)))), (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p0 (NOT p3) p1 p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p1) (NOT p4))))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 p1) (AND (NOT p2) p0 p1 p4)))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p1) p4) (AND p0 (NOT p3) (NOT p1) p4)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1) (NOT p4))))), (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1) p4)))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) p4))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4)))), (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) p1 (NOT p4)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p4)))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p4)) (AND (NOT p2) (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 p4) (AND (NOT p2) p3 (NOT p1) p4))))), (X (X (NOT (OR (AND p2 (NOT p3) p1 p4) (AND p0 (NOT p3) p1 p4))))), (X (X (NOT (AND (NOT p2) p0 p3 p1 (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p4) (AND (NOT p2) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p4)) (AND (NOT p2) p3 (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) p4) (AND (NOT p3) (NOT p1) p4))))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p1) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) p4)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (OR (AND p2 (NOT p3) p4) (AND p0 (NOT p3) p4) (AND (NOT p3) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))), (X (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) (NOT p4))))), (X (X (AND (NOT p2) (NOT p0) p1 (NOT p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p1 p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1) p4))))), (X (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) p1 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p4)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1) p4)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 p1) (AND (NOT p2) p0 p1 p4))))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p1) p4))))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p1) p4) (AND p0 (NOT p3) (NOT p1) p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1) (NOT p4)))))), (X (X (OR (AND (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0 p3 p1 p4)))), (X (X (NOT (OR (AND (NOT p2) p0 p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1) p4))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 p4)))), (X (X (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p3) p1 (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p1 p4) (AND (NOT p3) p4))))), (G (NOT (AND (NOT p1) (NOT p2) p0 (NOT p4) p3))), (G (NOT (OR (AND p1 (NOT p2) p0 p4) (AND p1 (NOT p2) p0 p3)))), (G (NOT (AND p1 (NOT p2) p0 (NOT p4) p3))), (G (NOT (AND (NOT p1) (NOT p2) p0 p4 p3))), (G (NOT (AND p1 (NOT p2) p0 p4 p3))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (OR (AND (NOT p1) (NOT p2) p0 p4) (AND (NOT p1) (NOT p2) p0 p3)))), (G (NOT (AND p1 (NOT p2) p0 p4))), (G (NOT (AND (NOT p1) (NOT p2) p0 (NOT p4)))), (G (NOT (AND p1 (NOT p2) p0 (NOT p4)))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (OR (AND (NOT p1) (NOT p2) p4 p3) (AND (NOT p2) p0 p4 p3)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0) p4 p3))), (G (NOT (AND (NOT p1) (NOT p2) p0 p4)))]
False Knowledge obtained : [(F (OR (AND (NOT p1) (NOT p2) (NOT p0) p4) (AND (NOT p1) p4 (NOT p3)))), (F (OR (AND p1 (NOT p2) (NOT p0)) (AND p1 (NOT p4) (NOT p3)))), (F (OR (AND (NOT p1) p4 (NOT p3)) (AND p2 p4 (NOT p3)) (AND p0 p4 (NOT p3)))), (F (OR (AND p1 (NOT p2) (NOT p0) p4) (AND p1 p4 (NOT p3)))), (F (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p4) (NOT p3)))), (F (OR (AND p1 (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p3)))), (F (AND p1 (NOT p2) (NOT p0) (NOT p4))), (F (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p0 p3))), (F (OR (AND (NOT p1) (NOT p2) (NOT p0) p4) (AND (NOT p1) (NOT p2) (NOT p0) p3))), (F (OR (AND (NOT p1) (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4) (NOT p3)))), (F (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND p1 (NOT p4) (NOT p3)))), (F (OR (AND p1 p2 p4 (NOT p3)) (AND p1 p0 p4 (NOT p3)))), (F (OR (AND (NOT p1) p2 p4 (NOT p3)) (AND (NOT p1) p0 p4 (NOT p3)))), (F (OR (AND (NOT p1) (NOT p2) (NOT p4) p3) (AND (NOT p2) p0 (NOT p4) p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p4) p3)), (F (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p4) (NOT p3)))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0))), (F (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p2) p0 p4))), (F (OR (AND p1 (NOT p2) (NOT p0) p4) (AND p4 (NOT p3)))), (F (AND (NOT p1) (NOT p2) (NOT p0) p4)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0) p4)), (F (AND p1 (NOT p2) (NOT p0))), (F (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) p0 (NOT p4)))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p4)))]
Knowledge based reduction with 69 factoid took 60289 ms. Reduced automaton from 9 states, 50 edges and 5 AP (stutter insensitive) to 6 states, 24 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 518 ms :[(OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) p4) (AND (NOT p2) p3) (AND p1 (NOT p2))), (OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) p4) (AND (NOT p2) p3) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p4)) (AND p2 (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) p3 p4) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Stuttering acceptance computed with spot in 517 ms :[(OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) p4) (AND (NOT p2) p3) (AND p1 (NOT p2))), (OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) p4) (AND (NOT p2) p3) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p4)) (AND p2 (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) p3 p4) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-19 16:19:58] [INFO ] Invariant cache hit.
[2023-03-19 16:19:58] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-19 16:19:58] [INFO ] Invariant cache hit.
[2023-03-19 16:19:59] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
[2023-03-19 16:19:59] [INFO ] Invariant cache hit.
[2023-03-19 16:19:59] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1456 ms. Remains : 562/562 places, 761/761 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3 (NOT p4)), (X (NOT (AND p1 p2 p4 (NOT p3)))), (X (NOT (OR (AND (NOT p2) p4) (AND p4 (NOT p3))))), (X (NOT (OR (AND (NOT p1) p4 (NOT p3)) (AND p2 p4 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p4) (NOT p3)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p3))))), (X (OR p1 (NOT p0) p2 p3)), (X (NOT (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3)))), (X (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) p2 p4 (NOT p3)))), (X (X (NOT (AND p1 p2 p4 (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) p4) (AND p4 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p3)) (AND p2 p4 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p4) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p1 p4 (NOT p3)) (AND (NOT p2) p4 p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p3)))))), (X (X (OR p1 (NOT p0) p2 p3))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3))))), (X (X (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p4) (NOT p3)))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 p4 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 4223 ms. Reduced automaton from 6 states, 24 edges and 5 AP (stutter sensitive) to 6 states, 24 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[(OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) p4) (AND (NOT p2) p3) (AND p1 (NOT p2))), (OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3) (AND (NOT p2) p4)), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) p3) (AND p1 (NOT p2) (NOT p4)) (AND p2 (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) p3 p4) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:20:04] [INFO ] Invariant cache hit.
[2023-03-19 16:20:04] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2 p3 (NOT p4)), (X (NOT (AND p1 p2 p4 (NOT p3)))), (X (NOT (OR (AND (NOT p2) p4) (AND p4 (NOT p3))))), (X (NOT (OR (AND (NOT p1) p4 (NOT p3)) (AND p2 p4 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p4) (NOT p3)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p3))))), (X (OR p1 (NOT p0) p2 p3)), (X (NOT (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3)))), (X (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) p2 p4 (NOT p3)))), (X (X (NOT (AND p1 p2 p4 (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) p4) (AND p4 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p3)) (AND p2 p4 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p4) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND p1 p4 (NOT p3)) (AND (NOT p2) p4 p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p3)))))), (X (X (OR p1 (NOT p0) p2 p3))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) p3))))), (X (X (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4) (NOT p3)) (AND p2 (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p4) (NOT p3)))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 p4 (NOT p3))))), (G (OR p1 p2 (NOT p0) p3))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) p2 (NOT p3) p4)), (F (AND (NOT p1) (NOT p2))), (F (OR (AND p1 (NOT p3) p4) (AND (NOT p2) p3 p4))), (F (OR (AND p1 (NOT p2)) (AND p1 (NOT p3) (NOT p4)))), (F (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)))), (F (OR (AND (NOT p1) (NOT p3) p4) (AND p2 (NOT p3) p4))), (F (OR (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))), (F (AND p1 p2 (NOT p3) p4)), (F (OR (AND (NOT p2) p4) (AND (NOT p3) p4))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4)))), (F (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4))), (F (AND (NOT p1) (NOT p3) p4)), (F (OR (AND p1 (NOT p2)) (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)))), (F (AND (NOT p1) (NOT p2) p3)), (F (OR (AND p1 (NOT p2) (NOT p4)) (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))))]
Knowledge based reduction with 32 factoid took 4523 ms. Reduced automaton from 6 states, 24 edges and 5 AP (stutter sensitive) to 6 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 473 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) p3 p4) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) p3 p4) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Stuttering acceptance computed with spot in 433 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) p3 p4) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p3) (NOT p4)))]
Product exploration explored 100000 steps with 3551 reset in 719 ms.
Product exploration explored 100000 steps with 3494 reset in 595 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 16 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-19 16:20:12] [INFO ] Invariant cache hit.
[2023-03-19 16:20:12] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-19 16:20:12] [INFO ] Invariant cache hit.
[2023-03-19 16:20:12] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2023-03-19 16:20:13] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-19 16:20:13] [INFO ] Invariant cache hit.
[2023-03-19 16:20:13] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1398 ms. Remains : 562/562 places, 761/761 transitions.
Treatment of property ShieldRVs-PT-040A-LTLCardinality-04 finished in 127935 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' '!((p0 U X((p1||F(p2)))))'
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 9 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-19 16:20:13] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-19 16:20:13] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-19 16:20:13] [INFO ] Invariant cache hit.
[2023-03-19 16:20:14] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2023-03-19 16:20:14] [INFO ] Invariant cache hit.
[2023-03-19 16:20:14] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1301 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (EQ s264 1) (EQ s122 1)), p2:(NEQ s174 1), p1:(NEQ s122 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 1733 ms.
Product exploration explored 100000 steps with 50000 reset in 1472 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 8 factoid took 148 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-040A-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-040A-LTLCardinality-11 finished in 4892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 24 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-19 16:20:18] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-19 16:20:18] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-19 16:20:18] [INFO ] Invariant cache hit.
[2023-03-19 16:20:19] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
[2023-03-19 16:20:19] [INFO ] Redundant transitions in 167 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2023-03-19 16:20:19] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-19 16:20:19] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/563 places, 760/763 transitions.
Applied a total of 0 rules in 14 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1509 ms. Remains : 561/563 places, 760/763 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s465 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4364 steps with 48 reset in 19 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-12 finished in 1596 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 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-19 16:20:20] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-19 16:20:20] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-19 16:20:20] [INFO ] Invariant cache hit.
[2023-03-19 16:20:20] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2023-03-19 16:20:20] [INFO ] Invariant cache hit.
[2023-03-19 16:20:21] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1364 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-13 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 s419 0) (EQ s437 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 646 steps with 1 reset in 9 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-13 finished in 1472 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((G(p0)||(F(p2)&&p1)))||X(G(p3)))))'
Support contains 8 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 14 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-19 16:20:21] [INFO ] Invariant cache hit.
[2023-03-19 16:20:21] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-19 16:20:21] [INFO ] Invariant cache hit.
[2023-03-19 16:20:22] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2023-03-19 16:20:22] [INFO ] Invariant cache hit.
[2023-03-19 16:20:22] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1128 ms. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s445 0) (EQ s59 1)), p2:(AND (EQ s13 0) (EQ s238 1)), p3:(AND (EQ s339 0) (EQ s383 1)), p0:(AND (EQ s76 0) (EQ s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4329 steps with 7 reset in 42 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-14 finished in 1376 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 4 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 37 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-19 16:20:22] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-19 16:20:23] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-19 16:20:23] [INFO ] Invariant cache hit.
[2023-03-19 16:20:23] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2023-03-19 16:20:23] [INFO ] Redundant transitions in 162 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2023-03-19 16:20:23] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-19 16:20:24] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/563 places, 760/763 transitions.
Applied a total of 0 rules in 14 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1492 ms. Remains : 561/563 places, 760/763 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-15 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 (OR (EQ s114 0) (EQ s149 1)) (OR (EQ s317 0) (EQ s464 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 559 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-040A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLCardinality-15 finished in 1561 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(p1)))'
Found a Lengthening insensitive property : ShieldRVs-PT-040A-LTLCardinality-00
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 561 transition count 761
Applied a total of 2 rules in 51 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-19 16:20:24] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-19 16:20:25] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-19 16:20:25] [INFO ] Invariant cache hit.
[2023-03-19 16:20:25] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2023-03-19 16:20:25] [INFO ] Invariant cache hit.
[2023-03-19 16:20:26] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 561/563 places, 761/763 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1377 ms. Remains : 561/563 places, 761/763 transitions.
Running random walk in product with property : ShieldRVs-PT-040A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s266 1), p0:(OR (EQ s232 0) (EQ s293 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 391 reset in 398 ms.
Product exploration explored 100000 steps with 393 reset in 450 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 266 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 258 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 14 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-19 16:20:28] [INFO ] Invariant cache hit.
[2023-03-19 16:20:28] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-19 16:20:28] [INFO ] Invariant cache hit.
[2023-03-19 16:20:29] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
[2023-03-19 16:20:29] [INFO ] Invariant cache hit.
[2023-03-19 16:20:29] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1396 ms. Remains : 561/561 places, 761/761 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 291 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 390 reset in 571 ms.
Product exploration explored 100000 steps with 392 reset in 543 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 26 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-19 16:20:32] [INFO ] Redundant transitions in 158 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2023-03-19 16:20:32] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-19 16:20:32] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/561 places, 760/761 transitions.
Applied a total of 0 rules in 19 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 629 ms. Remains : 561/561 places, 760/761 transitions.
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 8 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-19 16:20:32] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-19 16:20:32] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-19 16:20:32] [INFO ] Invariant cache hit.
[2023-03-19 16:20:33] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2023-03-19 16:20:33] [INFO ] Invariant cache hit.
[2023-03-19 16:20:33] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1312 ms. Remains : 561/561 places, 761/761 transitions.
Treatment of property ShieldRVs-PT-040A-LTLCardinality-00 finished in 9558 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((((!F(p1)||p0) U p2)&&(G(p4)||p3)))))'
Warning : SL/CL computation failed.
[2023-03-19 16:20:44] [INFO ] Flatten gal took : 74 ms
[2023-03-19 16:20:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-19 16:20:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 563 places, 763 transitions and 3680 arcs took 9 ms.
Total runtime 190842 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-040A
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

BK_STOP 1679242969719

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVs-PT-040A-LTLCardinality-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 4/32 ShieldRVs-PT-040A-LTLCardinality-00 399602 m, 79920 m/sec, 1845380 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 8/32 ShieldRVs-PT-040A-LTLCardinality-00 803948 m, 80869 m/sec, 3694898 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 12/32 ShieldRVs-PT-040A-LTLCardinality-00 1192295 m, 77669 m/sec, 5698400 t fired, .

Time elapsed: 15 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1800 16/32 ShieldRVs-PT-040A-LTLCardinality-00 1570496 m, 75640 m/sec, 7685483 t fired, .

Time elapsed: 20 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1800 19/32 ShieldRVs-PT-040A-LTLCardinality-00 1923207 m, 70542 m/sec, 9644999 t fired, .

Time elapsed: 25 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1800 23/32 ShieldRVs-PT-040A-LTLCardinality-00 2320099 m, 79378 m/sec, 11745233 t fired, .

Time elapsed: 30 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1800 27/32 ShieldRVs-PT-040A-LTLCardinality-00 2681795 m, 72339 m/sec, 13801480 t fired, .

Time elapsed: 35 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1800 30/32 ShieldRVs-PT-040A-LTLCardinality-00 3040087 m, 71658 m/sec, 15833951 t fired, .

Time elapsed: 40 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for ShieldRVs-PT-040A-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldRVs-PT-040A-LTLCardinality-04
lola: time limit : 3555 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3555 3/32 ShieldRVs-PT-040A-LTLCardinality-04 274005 m, 54801 m/sec, 1727309 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3555 5/32 ShieldRVs-PT-040A-LTLCardinality-04 544772 m, 54153 m/sec, 3528626 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3555 7/32 ShieldRVs-PT-040A-LTLCardinality-04 820524 m, 55150 m/sec, 5362373 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3555 9/32 ShieldRVs-PT-040A-LTLCardinality-04 1066884 m, 49272 m/sec, 7101744 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3555 11/32 ShieldRVs-PT-040A-LTLCardinality-04 1302391 m, 47101 m/sec, 8840792 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3555 13/32 ShieldRVs-PT-040A-LTLCardinality-04 1535824 m, 46686 m/sec, 10611560 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3555 15/32 ShieldRVs-PT-040A-LTLCardinality-04 1778979 m, 48631 m/sec, 12353438 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3555 17/32 ShieldRVs-PT-040A-LTLCardinality-04 2055557 m, 55315 m/sec, 14312033 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3555 20/32 ShieldRVs-PT-040A-LTLCardinality-04 2312932 m, 51475 m/sec, 16133697 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3555 22/32 ShieldRVs-PT-040A-LTLCardinality-04 2552720 m, 47957 m/sec, 17877547 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3555 23/32 ShieldRVs-PT-040A-LTLCardinality-04 2780758 m, 45607 m/sec, 19579127 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/3555 25/32 ShieldRVs-PT-040A-LTLCardinality-04 3008460 m, 45540 m/sec, 21269572 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/3555 27/32 ShieldRVs-PT-040A-LTLCardinality-04 3243455 m, 46999 m/sec, 22943020 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/3555 29/32 ShieldRVs-PT-040A-LTLCardinality-04 3476489 m, 46606 m/sec, 24615877 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/3555 31/32 ShieldRVs-PT-040A-LTLCardinality-04 3739071 m, 52516 m/sec, 26244883 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for ShieldRVs-PT-040A-LTLCardinality-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040A-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-040A-LTLCardinality-00: LTL unknown AGGR
ShieldRVs-PT-040A-LTLCardinality-04: LTL unknown AGGR


Time elapsed: 125 secs. Pages in use: 32

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="ShieldRVs-PT-040A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldRVs-PT-040A, 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 r423-tajo-167905976300131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040A.tgz
mv ShieldRVs-PT-040A 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 ;