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

About the Execution of LTSMin+red for ShieldPPPs-PT-050A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1288.743 138154.00 206353.00 97.00 FTFFF?F?FF?FFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717100499.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPs-PT-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100499
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.2K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 02:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 02:03 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 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 02:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 02:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 02:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 447K 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 ShieldPPPs-PT-050A-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679455577235

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=ShieldPPPs-PT-050A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:26:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 03:26:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:26:21] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-22 03:26:21] [INFO ] Transformed 1553 places.
[2023-03-22 03:26:21] [INFO ] Transformed 1303 transitions.
[2023-03-22 03:26:21] [INFO ] Found NUPN structural information;
[2023-03-22 03:26:21] [INFO ] Parsed PT model containing 1553 places and 1303 transitions and 5006 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 296 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:26:21] [INFO ] Computed 551 place invariants in 23 ms
[2023-03-22 03:26:23] [INFO ] Implicit Places using invariants in 1892 ms returned []
[2023-03-22 03:26:23] [INFO ] Invariant cache hit.
[2023-03-22 03:26:27] [INFO ] Implicit Places using invariants and state equation in 3827 ms returned []
Implicit Place search using SMT with State Equation took 5783 ms to find 0 implicit places.
[2023-03-22 03:26:27] [INFO ] Invariant cache hit.
[2023-03-22 03:26:29] [INFO ] Dead Transitions using invariants and state equation in 1801 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7894 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 29 out of 1553 places after structural reductions.
[2023-03-22 03:26:29] [INFO ] Flatten gal took : 175 ms
[2023-03-22 03:26:30] [INFO ] Flatten gal took : 125 ms
[2023-03-22 03:26:30] [INFO ] Input system was already deterministic with 1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 03:26:30] [INFO ] Invariant cache hit.
[2023-03-22 03:26:31] [INFO ] [Real]Absence check using 551 positive place invariants in 381 ms returned sat
[2023-03-22 03:26:32] [INFO ] After 1271ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 03:26:33] [INFO ] Deduced a trap composed of 18 places in 558 ms of which 27 ms to minimize.
[2023-03-22 03:26:33] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 2 ms to minimize.
[2023-03-22 03:26:34] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 1 ms to minimize.
[2023-03-22 03:26:34] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2023-03-22 03:26:34] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 1 ms to minimize.
[2023-03-22 03:26:34] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 1 ms to minimize.
[2023-03-22 03:26:34] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 1 ms to minimize.
[2023-03-22 03:26:35] [INFO ] Deduced a trap composed of 18 places in 361 ms of which 1 ms to minimize.
[2023-03-22 03:26:35] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 1 ms to minimize.
[2023-03-22 03:26:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2756 ms
[2023-03-22 03:26:35] [INFO ] After 4101ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:26:35] [INFO ] After 4934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:26:36] [INFO ] [Nat]Absence check using 551 positive place invariants in 307 ms returned sat
[2023-03-22 03:26:38] [INFO ] After 1607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:26:38] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 1 ms to minimize.
[2023-03-22 03:26:38] [INFO ] Deduced a trap composed of 18 places in 405 ms of which 0 ms to minimize.
[2023-03-22 03:26:39] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 0 ms to minimize.
[2023-03-22 03:26:39] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 1 ms to minimize.
[2023-03-22 03:26:39] [INFO ] Deduced a trap composed of 20 places in 314 ms of which 0 ms to minimize.
[2023-03-22 03:26:40] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 0 ms to minimize.
[2023-03-22 03:26:40] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2023-03-22 03:26:40] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 1 ms to minimize.
[2023-03-22 03:26:40] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2023-03-22 03:26:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2636 ms
[2023-03-22 03:26:40] [INFO ] After 4291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-22 03:26:40] [INFO ] After 5230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 447 times.
Drop transitions removed 447 transitions
Iterating global reduction 0 with 447 rules applied. Total rules applied 451 place count 1551 transition count 1301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 452 place count 1550 transition count 1300
Applied a total of 452 rules in 597 ms. Remains 1550 /1553 variables (removed 3) and now considering 1300/1303 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 597 ms. Remains : 1550/1553 places, 1300/1303 transitions.
Finished random walk after 2695 steps, including 0 resets, run visited all 1 properties in 40 ms. (steps per millisecond=67 )
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(X((G(p0)||(p0&&F(((p1 U X(p2))&&X(!p0))))))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 73 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 03:26:42] [INFO ] Invariant cache hit.
[2023-03-22 03:26:43] [INFO ] Implicit Places using invariants in 1492 ms returned []
[2023-03-22 03:26:43] [INFO ] Invariant cache hit.
[2023-03-22 03:26:47] [INFO ] Implicit Places using invariants and state equation in 4033 ms returned []
Implicit Place search using SMT with State Equation took 5573 ms to find 0 implicit places.
[2023-03-22 03:26:47] [INFO ] Invariant cache hit.
[2023-03-22 03:26:48] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6677 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 794 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) p0), (OR (NOT p2) p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0} source=6 dest: 6}, { cond=(OR (AND p0 p1) (AND p1 (NOT p2))), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={} source=9 dest: 1}]], initial=8, aps=[p0:(NEQ s759 1), p1:(OR (EQ s898 0) (EQ s1449 1)), p2:(EQ s587 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-02 finished in 7594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1551 transition count 1301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1550 transition count 1300
Applied a total of 4 rules in 198 ms. Remains 1550 /1553 variables (removed 3) and now considering 1300/1303 (removed 3) transitions.
// Phase 1: matrix 1300 rows 1550 cols
[2023-03-22 03:26:49] [INFO ] Computed 551 place invariants in 44 ms
[2023-03-22 03:26:50] [INFO ] Implicit Places using invariants in 1273 ms returned []
[2023-03-22 03:26:50] [INFO ] Invariant cache hit.
[2023-03-22 03:26:54] [INFO ] Implicit Places using invariants and state equation in 3117 ms returned []
Implicit Place search using SMT with State Equation took 4400 ms to find 0 implicit places.
[2023-03-22 03:26:54] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-22 03:26:54] [INFO ] Invariant cache hit.
[2023-03-22 03:26:56] [INFO ] Dead Transitions using invariants and state equation in 2170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1550/1553 places, 1300/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6879 ms. Remains : 1550/1553 places, 1300/1303 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s698 0) (EQ s736 1)), p1:(OR (EQ s664 0) (EQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 63 reset in 1341 ms.
Product exploration explored 100000 steps with 61 reset in 1379 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 367 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1833 steps, including 0 resets, run visited all 2 properties in 57 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 347 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 117 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2023-03-22 03:27:00] [INFO ] Invariant cache hit.
[2023-03-22 03:27:01] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2023-03-22 03:27:01] [INFO ] Invariant cache hit.
[2023-03-22 03:27:04] [INFO ] Implicit Places using invariants and state equation in 2521 ms returned []
Implicit Place search using SMT with State Equation took 3693 ms to find 0 implicit places.
[2023-03-22 03:27:04] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-22 03:27:04] [INFO ] Invariant cache hit.
[2023-03-22 03:27:05] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5039 ms. Remains : 1550/1550 places, 1300/1300 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1838 steps, including 0 resets, run visited all 2 properties in 43 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 434 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 60 reset in 1103 ms.
Product exploration explored 100000 steps with 62 reset in 1276 ms.
Support contains 4 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 56 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2023-03-22 03:27:09] [INFO ] Invariant cache hit.
[2023-03-22 03:27:10] [INFO ] Implicit Places using invariants in 987 ms returned []
[2023-03-22 03:27:10] [INFO ] Invariant cache hit.
[2023-03-22 03:27:13] [INFO ] Implicit Places using invariants and state equation in 2604 ms returned []
Implicit Place search using SMT with State Equation took 3606 ms to find 0 implicit places.
[2023-03-22 03:27:13] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-22 03:27:13] [INFO ] Invariant cache hit.
[2023-03-22 03:27:16] [INFO ] Dead Transitions using invariants and state equation in 3010 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6707 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-05 finished in 27092 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((X(p1)&&p0))&&F((!p2 U (p3||G(!p2))))))'
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 52 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:27:16] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-22 03:27:25] [INFO ] Implicit Places using invariants in 8837 ms returned []
[2023-03-22 03:27:25] [INFO ] Invariant cache hit.
[2023-03-22 03:27:28] [INFO ] Implicit Places using invariants and state equation in 3124 ms returned []
Implicit Place search using SMT with State Equation took 11992 ms to find 0 implicit places.
[2023-03-22 03:27:28] [INFO ] Invariant cache hit.
[2023-03-22 03:27:29] [INFO ] Dead Transitions using invariants and state equation in 1160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13230 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (OR (NOT p0) (NOT p1)), (AND (NOT p3) p2), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1314 0) (EQ s1007 1)), p3:(AND (NOT (OR (EQ s1007 0) (EQ s1314 1))) (NOT (OR (EQ s568 0) (EQ s1200 1)))), p2:(OR (EQ s568 0) (EQ s1200 1)), p...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3478 steps with 0 reset in 50 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-06 finished in 13505 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 1 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 139 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:27:30] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-22 03:27:31] [INFO ] Implicit Places using invariants in 1071 ms returned []
[2023-03-22 03:27:31] [INFO ] Invariant cache hit.
[2023-03-22 03:27:34] [INFO ] Implicit Places using invariants and state equation in 2892 ms returned []
Implicit Place search using SMT with State Equation took 4003 ms to find 0 implicit places.
[2023-03-22 03:27:34] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-22 03:27:34] [INFO ] Invariant cache hit.
[2023-03-22 03:27:35] [INFO ] Dead Transitions using invariants and state equation in 964 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5161 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s862 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 30 reset in 1015 ms.
Product exploration explored 100000 steps with 29 reset in 1223 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 : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 1 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 51 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:27:38] [INFO ] Invariant cache hit.
[2023-03-22 03:27:39] [INFO ] Implicit Places using invariants in 1514 ms returned []
[2023-03-22 03:27:39] [INFO ] Invariant cache hit.
[2023-03-22 03:27:42] [INFO ] Implicit Places using invariants and state equation in 3143 ms returned []
Implicit Place search using SMT with State Equation took 4686 ms to find 0 implicit places.
[2023-03-22 03:27:42] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-22 03:27:42] [INFO ] Invariant cache hit.
[2023-03-22 03:27:44] [INFO ] Dead Transitions using invariants and state equation in 1102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5908 ms. Remains : 1551/1551 places, 1301/1301 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 : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 30 reset in 1144 ms.
Product exploration explored 100000 steps with 29 reset in 1313 ms.
Support contains 1 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 50 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:27:47] [INFO ] Invariant cache hit.
[2023-03-22 03:27:48] [INFO ] Implicit Places using invariants in 1242 ms returned []
[2023-03-22 03:27:48] [INFO ] Invariant cache hit.
[2023-03-22 03:27:51] [INFO ] Implicit Places using invariants and state equation in 3393 ms returned []
Implicit Place search using SMT with State Equation took 4668 ms to find 0 implicit places.
[2023-03-22 03:27:51] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-22 03:27:51] [INFO ] Invariant cache hit.
[2023-03-22 03:27:53] [INFO ] Dead Transitions using invariants and state equation in 1274 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6053 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-07 finished in 23299 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)&&X(X(G(p1)))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 37 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:27:53] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-22 03:27:54] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2023-03-22 03:27:54] [INFO ] Invariant cache hit.
[2023-03-22 03:27:57] [INFO ] Implicit Places using invariants and state equation in 2803 ms returned []
Implicit Place search using SMT with State Equation took 3870 ms to find 0 implicit places.
[2023-03-22 03:27:57] [INFO ] Invariant cache hit.
[2023-03-22 03:27:58] [INFO ] Dead Transitions using invariants and state equation in 1267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5175 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s781 0) (EQ s1228 1)), p1:(EQ s353 0)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2821 steps with 1 reset in 50 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-08 finished in 5556 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||G(p1))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 134 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:27:59] [INFO ] Computed 551 place invariants in 10 ms
[2023-03-22 03:28:00] [INFO ] Implicit Places using invariants in 1642 ms returned []
[2023-03-22 03:28:00] [INFO ] Invariant cache hit.
[2023-03-22 03:28:03] [INFO ] Implicit Places using invariants and state equation in 2906 ms returned []
Implicit Place search using SMT with State Equation took 4586 ms to find 0 implicit places.
[2023-03-22 03:28:03] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-22 03:28:03] [INFO ] Invariant cache hit.
[2023-03-22 03:28:04] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5725 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s1503 0) (EQ s1504 1)), p0:(AND (EQ s1220 0) (EQ s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 30 reset in 1066 ms.
Product exploration explored 100000 steps with 31 reset in 1347 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 p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 343 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 356 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 43 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:28:08] [INFO ] Invariant cache hit.
[2023-03-22 03:28:09] [INFO ] Implicit Places using invariants in 1612 ms returned []
[2023-03-22 03:28:09] [INFO ] Invariant cache hit.
[2023-03-22 03:28:12] [INFO ] Implicit Places using invariants and state equation in 2840 ms returned []
Implicit Place search using SMT with State Equation took 4468 ms to find 0 implicit places.
[2023-03-22 03:28:12] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 03:28:12] [INFO ] Invariant cache hit.
[2023-03-22 03:28:13] [INFO ] Dead Transitions using invariants and state equation in 1049 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5623 ms. Remains : 1551/1551 places, 1301/1301 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 p0) p1), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 302 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 31 reset in 1127 ms.
Product exploration explored 100000 steps with 31 reset in 1291 ms.
Support contains 4 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 54 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:28:17] [INFO ] Invariant cache hit.
[2023-03-22 03:28:18] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2023-03-22 03:28:18] [INFO ] Invariant cache hit.
[2023-03-22 03:28:21] [INFO ] Implicit Places using invariants and state equation in 2809 ms returned []
Implicit Place search using SMT with State Equation took 3994 ms to find 0 implicit places.
[2023-03-22 03:28:21] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-22 03:28:21] [INFO ] Invariant cache hit.
[2023-03-22 03:28:22] [INFO ] Dead Transitions using invariants and state equation in 1008 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5084 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-10 finished in 23247 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)||G(p1)))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 42 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:28:22] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-22 03:28:23] [INFO ] Implicit Places using invariants in 1066 ms returned []
[2023-03-22 03:28:23] [INFO ] Invariant cache hit.
[2023-03-22 03:28:25] [INFO ] Implicit Places using invariants and state equation in 2490 ms returned []
Implicit Place search using SMT with State Equation took 3566 ms to find 0 implicit places.
[2023-03-22 03:28:25] [INFO ] Invariant cache hit.
[2023-03-22 03:28:26] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4426 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (NEQ s930 0) (NEQ s1243 1)), p0:(OR (EQ s749 0) (EQ s790 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1400 steps with 0 reset in 15 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-12 finished in 4748 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(X(G(p0)))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 35 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 03:28:27] [INFO ] Invariant cache hit.
[2023-03-22 03:28:28] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2023-03-22 03:28:28] [INFO ] Invariant cache hit.
[2023-03-22 03:28:30] [INFO ] Implicit Places using invariants and state equation in 2698 ms returned []
Implicit Place search using SMT with State Equation took 3847 ms to find 0 implicit places.
[2023-03-22 03:28:30] [INFO ] Invariant cache hit.
[2023-03-22 03:28:31] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4993 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-13 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s517 0) (EQ s479 0) (EQ s676 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1746 steps with 0 reset in 20 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-13 finished in 5231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
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)))'
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||G(p1))))'
[2023-03-22 03:28:32] [INFO ] Flatten gal took : 154 ms
[2023-03-22 03:28:32] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 03:28:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1553 places, 1303 transitions and 5006 arcs took 9 ms.
Total runtime 132230 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1224/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1224/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1224/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-050A-LTLCardinality-05
Could not compute solution for formula : ShieldPPPs-PT-050A-LTLCardinality-07
Could not compute solution for formula : ShieldPPPs-PT-050A-LTLCardinality-10

BK_STOP 1679455715389

--------------------
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'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.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 ShieldPPPs-PT-050A-LTLCardinality-05
ltl formula formula --ltl=/tmp/1224/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 1553 places, 1303 transitions and 5006 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.330 real 0.050 user 0.130 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1224/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1224/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1224/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1224/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldPPPs-PT-050A-LTLCardinality-07
ltl formula formula --ltl=/tmp/1224/ltl_1_
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 1553 places, 1303 transitions and 5006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1224/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.120 user 0.130 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1224/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1224/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1224/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 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:
0: pnml2lts-mc(+0xa23f4) [0x564f0cc453f4]
1: pnml2lts-mc(+0xa2496) [0x564f0cc45496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f16086e3140]
3: pnml2lts-mc(+0x405be5) [0x564f0cfa8be5]
4: pnml2lts-mc(+0x16b3f9) [0x564f0cd0e3f9]
5: pnml2lts-mc(+0x164ac4) [0x564f0cd07ac4]
6: pnml2lts-mc(+0x272e0a) [0x564f0ce15e0a]
7: pnml2lts-mc(+0xb61f0) [0x564f0cc591f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f16085364d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f160853667a]
10: pnml2lts-mc(+0xa1581) [0x564f0cc44581]
11: pnml2lts-mc(+0xa1910) [0x564f0cc44910]
12: pnml2lts-mc(+0xa32a2) [0x564f0cc462a2]
13: pnml2lts-mc(+0xa50f4) [0x564f0cc480f4]
14: pnml2lts-mc(+0x3f34b3) [0x564f0cf964b3]
15: pnml2lts-mc(+0x7c63d) [0x564f0cc1f63d]
16: pnml2lts-mc(+0x67d86) [0x564f0cc0ad86]
17: pnml2lts-mc(+0x60a8a) [0x564f0cc03a8a]
18: pnml2lts-mc(+0x5eb15) [0x564f0cc01b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f160851ed0a]
20: pnml2lts-mc(+0x6075e) [0x564f0cc0375e]
ltl formula name ShieldPPPs-PT-050A-LTLCardinality-10
ltl formula formula --ltl=/tmp/1224/ltl_2_
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 1553 places, 1303 transitions and 5006 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.340 real 0.120 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1224/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1224/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1224/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1224/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ShieldPPPs-PT-050A"
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 ShieldPPPs-PT-050A, 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 r393-oct2-167903717100499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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