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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1952.584 245187.00 316776.00 72.40 FFTTFFTFFF?TTFFF 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-167903717100515.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-100A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.6K Feb 26 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 02:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 02:04 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 02:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 02:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 907K 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-100A-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679457566062

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-100A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:59:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 03:59:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:59:28] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-03-22 03:59:29] [INFO ] Transformed 3103 places.
[2023-03-22 03:59:29] [INFO ] Transformed 2603 transitions.
[2023-03-22 03:59:29] [INFO ] Found NUPN structural information;
[2023-03-22 03:59:29] [INFO ] Parsed PT model containing 3103 places and 2603 transitions and 10006 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 469 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 03:59:30] [INFO ] Computed 1101 place invariants in 44 ms
[2023-03-22 03:59:32] [INFO ] Implicit Places using invariants in 2877 ms returned []
[2023-03-22 03:59:32] [INFO ] Invariant cache hit.
[2023-03-22 03:59:35] [INFO ] Implicit Places using invariants and state equation in 2293 ms returned []
Implicit Place search using SMT with State Equation took 5313 ms to find 0 implicit places.
[2023-03-22 03:59:35] [INFO ] Invariant cache hit.
[2023-03-22 03:59:37] [INFO ] Dead Transitions using invariants and state equation in 2004 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7793 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Support contains 27 out of 3103 places after structural reductions.
[2023-03-22 03:59:37] [INFO ] Flatten gal took : 438 ms
[2023-03-22 03:59:38] [INFO ] Flatten gal took : 256 ms
[2023-03-22 03:59:38] [INFO ] Input system was already deterministic with 2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=16 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-22 03:59:41] [INFO ] Invariant cache hit.
[2023-03-22 03:59:42] [INFO ] [Real]Absence check using 1101 positive place invariants in 313 ms returned sat
[2023-03-22 03:59:48] [INFO ] After 4448ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2023-03-22 03:59:48] [INFO ] Deduced a trap composed of 18 places in 389 ms of which 18 ms to minimize.
[2023-03-22 03:59:48] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 1 ms to minimize.
[2023-03-22 03:59:49] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 1 ms to minimize.
[2023-03-22 03:59:49] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 1 ms to minimize.
[2023-03-22 03:59:49] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2023-03-22 03:59:50] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 1 ms to minimize.
[2023-03-22 03:59:50] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 7 ms to minimize.
[2023-03-22 03:59:50] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-03-22 03:59:50] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 1 ms to minimize.
[2023-03-22 03:59:51] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2023-03-22 03:59:51] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 1 ms to minimize.
[2023-03-22 03:59:51] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 16 ms to minimize.
[2023-03-22 03:59:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3765 ms
[2023-03-22 03:59:52] [INFO ] After 8609ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 03:59:52] [INFO ] After 10630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 03:59:53] [INFO ] [Nat]Absence check using 1101 positive place invariants in 564 ms returned sat
[2023-03-22 03:59:57] [INFO ] After 3259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 03:59:58] [INFO ] Deduced a trap composed of 24 places in 394 ms of which 1 ms to minimize.
[2023-03-22 03:59:58] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 0 ms to minimize.
[2023-03-22 03:59:58] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 1 ms to minimize.
[2023-03-22 03:59:59] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2023-03-22 03:59:59] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 1 ms to minimize.
[2023-03-22 03:59:59] [INFO ] Deduced a trap composed of 18 places in 291 ms of which 1 ms to minimize.
[2023-03-22 04:00:00] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2023-03-22 04:00:00] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 0 ms to minimize.
[2023-03-22 04:00:00] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 1 ms to minimize.
[2023-03-22 04:00:01] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 14 ms to minimize.
[2023-03-22 04:00:01] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-03-22 04:00:01] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2023-03-22 04:00:01] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2023-03-22 04:00:01] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2023-03-22 04:00:02] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4445 ms
[2023-03-22 04:00:03] [INFO ] After 9556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1033 ms.
[2023-03-22 04:00:04] [INFO ] After 12735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 597 ms.
Support contains 13 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 47 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 885 times.
Drop transitions removed 885 transitions
Iterating global reduction 0 with 885 rules applied. Total rules applied 889 place count 3101 transition count 2601
Applied a total of 889 rules in 1072 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1073 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 113685 steps, run timeout after 6002 ms. (steps per millisecond=18 ) properties seen :{2=1, 7=1}
Probabilistic random walk after 113685 steps, saw 112574 distinct states, run finished after 6004 ms. (steps per millisecond=18 ) properties seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:00:14] [INFO ] Computed 1101 place invariants in 92 ms
[2023-03-22 04:00:15] [INFO ] [Real]Absence check using 1047 positive place invariants in 276 ms returned sat
[2023-03-22 04:00:15] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 14 ms returned sat
[2023-03-22 04:00:18] [INFO ] After 3889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 04:00:19] [INFO ] [Nat]Absence check using 1047 positive place invariants in 341 ms returned sat
[2023-03-22 04:00:19] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 21 ms returned sat
[2023-03-22 04:00:43] [INFO ] After 23476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 04:00:43] [INFO ] After 23520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 04:00:43] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 241 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 54018 steps, run timeout after 3046 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 54018 steps, saw 53308 distinct states, run finished after 3048 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 04:00:48] [INFO ] Invariant cache hit.
[2023-03-22 04:00:49] [INFO ] [Real]Absence check using 1047 positive place invariants in 448 ms returned sat
[2023-03-22 04:00:49] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 33 ms returned sat
[2023-03-22 04:00:53] [INFO ] After 4614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 04:00:54] [INFO ] [Nat]Absence check using 1047 positive place invariants in 323 ms returned sat
[2023-03-22 04:00:54] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 16 ms returned sat
[2023-03-22 04:01:18] [INFO ] After 23403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:01:18] [INFO ] After 23424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 04:01:18] [INFO ] After 25070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 868 ms.
Support contains 9 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 174 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 164 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:01:19] [INFO ] Invariant cache hit.
[2023-03-22 04:01:22] [INFO ] Implicit Places using invariants in 3203 ms returned []
[2023-03-22 04:01:22] [INFO ] Invariant cache hit.
[2023-03-22 04:01:25] [INFO ] Implicit Places using invariants and state equation in 2685 ms returned []
Implicit Place search using SMT with State Equation took 5906 ms to find 0 implicit places.
[2023-03-22 04:01:25] [INFO ] Redundant transitions in 190 ms returned []
[2023-03-22 04:01:25] [INFO ] Invariant cache hit.
[2023-03-22 04:01:27] [INFO ] Dead Transitions using invariants and state equation in 1638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7928 ms. Remains : 3101/3101 places, 2601/2601 transitions.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-00 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((X((F(!p1)||G(!p2)))&&p0))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 166 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:01:27] [INFO ] Computed 1101 place invariants in 10 ms
[2023-03-22 04:01:29] [INFO ] Implicit Places using invariants in 1868 ms returned []
[2023-03-22 04:01:29] [INFO ] Invariant cache hit.
[2023-03-22 04:01:32] [INFO ] Implicit Places using invariants and state equation in 2892 ms returned []
Implicit Place search using SMT with State Equation took 4764 ms to find 0 implicit places.
[2023-03-22 04:01:32] [INFO ] Invariant cache hit.
[2023-03-22 04:01:34] [INFO ] Dead Transitions using invariants and state equation in 2028 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6974 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, (AND p1 p2), p1]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NEQ s920 0) (NEQ s1311 1)), p1:(OR (EQ s1328 0) (EQ s1420 1)), p2:(OR (EQ s920 0) (EQ s1311 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-01 finished in 7544 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(F(p0))))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 145 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-22 04:01:35] [INFO ] Invariant cache hit.
[2023-03-22 04:01:37] [INFO ] Implicit Places using invariants in 2139 ms returned []
[2023-03-22 04:01:37] [INFO ] Invariant cache hit.
[2023-03-22 04:01:39] [INFO ] Implicit Places using invariants and state equation in 2449 ms returned []
Implicit Place search using SMT with State Equation took 4591 ms to find 0 implicit places.
[2023-03-22 04:01:39] [INFO ] Invariant cache hit.
[2023-03-22 04:01:41] [INFO ] Dead Transitions using invariants and state equation in 1946 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6687 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s2153 0) (EQ s1304 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 33333 reset in 6073 ms.
Product exploration explored 100000 steps with 33333 reset in 5831 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100A-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-02 finished in 18936 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((G((p1 U p2))&&F(G(p3)))))))'
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 409 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:01:54] [INFO ] Computed 1101 place invariants in 7 ms
[2023-03-22 04:01:56] [INFO ] Implicit Places using invariants in 2295 ms returned []
[2023-03-22 04:01:56] [INFO ] Invariant cache hit.
[2023-03-22 04:01:57] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 2848 ms to find 0 implicit places.
[2023-03-22 04:01:57] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-22 04:01:57] [INFO ] Invariant cache hit.
[2023-03-22 04:01:59] [INFO ] Dead Transitions using invariants and state equation in 1821 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5200 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2684 0), p2:(OR (EQ s3 0) (EQ s991 1)), p1:(OR (EQ s907 0) (EQ s341 1)), p3:(EQ s1195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6465 steps with 0 reset in 123 ms.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-07 finished in 5721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 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 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3100 transition count 2600
Applied a total of 4 rules in 554 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-22 04:02:00] [INFO ] Computed 1101 place invariants in 14 ms
[2023-03-22 04:02:02] [INFO ] Implicit Places using invariants in 1718 ms returned []
[2023-03-22 04:02:02] [INFO ] Invariant cache hit.
[2023-03-22 04:02:04] [INFO ] Implicit Places using invariants and state equation in 2459 ms returned []
Implicit Place search using SMT with State Equation took 4178 ms to find 0 implicit places.
[2023-03-22 04:02:04] [INFO ] Redundant transitions in 148 ms returned []
[2023-03-22 04:02:04] [INFO ] Invariant cache hit.
[2023-03-22 04:02:07] [INFO ] Dead Transitions using invariants and state equation in 2282 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3100/3103 places, 2600/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7186 ms. Remains : 3100/3103 places, 2600/2603 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2096 0) (EQ s330 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6516 steps with 0 reset in 168 ms.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-08 finished in 7539 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(F((F(X(p0)) U p1)))))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 155 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:02:07] [INFO ] Computed 1101 place invariants in 13 ms
[2023-03-22 04:02:09] [INFO ] Implicit Places using invariants in 2158 ms returned []
[2023-03-22 04:02:09] [INFO ] Invariant cache hit.
[2023-03-22 04:02:12] [INFO ] Implicit Places using invariants and state equation in 2750 ms returned []
Implicit Place search using SMT with State Equation took 4968 ms to find 0 implicit places.
[2023-03-22 04:02:12] [INFO ] Invariant cache hit.
[2023-03-22 04:02:14] [INFO ] Dead Transitions using invariants and state equation in 1873 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6999 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s529 0) (EQ s379 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 19 reset in 2043 ms.
Product exploration explored 100000 steps with 19 reset in 2503 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 : [p1, (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 306 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), false]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 259 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), false]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), false]
Support contains 2 out of 3103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 400 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:02:20] [INFO ] Computed 1101 place invariants in 15 ms
[2023-03-22 04:02:22] [INFO ] Implicit Places using invariants in 2036 ms returned []
[2023-03-22 04:02:22] [INFO ] Invariant cache hit.
[2023-03-22 04:02:24] [INFO ] Implicit Places using invariants and state equation in 1695 ms returned []
Implicit Place search using SMT with State Equation took 3742 ms to find 0 implicit places.
[2023-03-22 04:02:24] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-22 04:02:24] [INFO ] Invariant cache hit.
[2023-03-22 04:02:25] [INFO ] Dead Transitions using invariants and state equation in 1707 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5931 ms. Remains : 3101/3103 places, 2601/2603 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 : [p1, (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), false]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p1, (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 250 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), false]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), false]
Product exploration explored 100000 steps with 32 reset in 1998 ms.
Product exploration explored 100000 steps with 44 reset in 2425 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 161 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:02:31] [INFO ] Invariant cache hit.
[2023-03-22 04:02:33] [INFO ] Implicit Places using invariants in 2159 ms returned []
[2023-03-22 04:02:33] [INFO ] Invariant cache hit.
[2023-03-22 04:02:35] [INFO ] Implicit Places using invariants and state equation in 2108 ms returned []
Implicit Place search using SMT with State Equation took 4269 ms to find 0 implicit places.
[2023-03-22 04:02:35] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-22 04:02:35] [INFO ] Invariant cache hit.
[2023-03-22 04:02:37] [INFO ] Dead Transitions using invariants and state equation in 1889 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6388 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-10 finished in 30757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&((F(p3)&&p2)||p1)))))'
Support contains 7 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 144 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:02:38] [INFO ] Computed 1101 place invariants in 17 ms
[2023-03-22 04:02:40] [INFO ] Implicit Places using invariants in 2254 ms returned []
[2023-03-22 04:02:40] [INFO ] Invariant cache hit.
[2023-03-22 04:02:42] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 4107 ms to find 0 implicit places.
[2023-03-22 04:02:42] [INFO ] Invariant cache hit.
[2023-03-22 04:02:44] [INFO ] Dead Transitions using invariants and state equation in 1804 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6058 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1407 0) (EQ s942 1)), p1:(OR (EQ s1545 0) (EQ s76 1)), p2:(AND (EQ s1556 1) (OR (EQ s1407 0) (EQ s942 1))), p3:(OR (EQ s2062 0) (EQ s1858 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 50000 reset in 7346 ms.
Product exploration explored 100000 steps with 50000 reset in 7389 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 p0 p1 (NOT p2) p3), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1) p2 (NOT p3))))
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 3 states, 4 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100A-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-11 finished in 21356 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(F((F(X(p0)) U p1)))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100A-LTLCardinality-10
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 3103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 303 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:03:00] [INFO ] Computed 1101 place invariants in 17 ms
[2023-03-22 04:03:02] [INFO ] Implicit Places using invariants in 2354 ms returned []
[2023-03-22 04:03:02] [INFO ] Invariant cache hit.
[2023-03-22 04:03:04] [INFO ] Implicit Places using invariants and state equation in 2016 ms returned []
Implicit Place search using SMT with State Equation took 4386 ms to find 0 implicit places.
[2023-03-22 04:03:04] [INFO ] Invariant cache hit.
[2023-03-22 04:03:06] [INFO ] Dead Transitions using invariants and state equation in 1824 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6514 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s529 0) (EQ s379 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 19 reset in 1828 ms.
Product exploration explored 100000 steps with 19 reset in 2259 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 : [p1, (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), false]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), false]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), false]
Support contains 2 out of 3101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 160 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:03:11] [INFO ] Invariant cache hit.
[2023-03-22 04:03:13] [INFO ] Implicit Places using invariants in 1934 ms returned []
[2023-03-22 04:03:13] [INFO ] Invariant cache hit.
[2023-03-22 04:03:15] [INFO ] Implicit Places using invariants and state equation in 1837 ms returned []
Implicit Place search using SMT with State Equation took 3783 ms to find 0 implicit places.
[2023-03-22 04:03:15] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-22 04:03:15] [INFO ] Invariant cache hit.
[2023-03-22 04:03:17] [INFO ] Dead Transitions using invariants and state equation in 2136 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6170 ms. Remains : 3101/3101 places, 2601/2601 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 : [p1, (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), false]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), false]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), false]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), false]
Product exploration explored 100000 steps with 31 reset in 1720 ms.
Product exploration explored 100000 steps with 33 reset in 2212 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 142 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:03:22] [INFO ] Invariant cache hit.
[2023-03-22 04:03:24] [INFO ] Implicit Places using invariants in 2221 ms returned []
[2023-03-22 04:03:24] [INFO ] Invariant cache hit.
[2023-03-22 04:03:26] [INFO ] Implicit Places using invariants and state equation in 2037 ms returned []
Implicit Place search using SMT with State Equation took 4263 ms to find 0 implicit places.
[2023-03-22 04:03:26] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-22 04:03:26] [INFO ] Invariant cache hit.
[2023-03-22 04:03:29] [INFO ] Dead Transitions using invariants and state equation in 2197 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6691 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-10 finished in 29859 ms.
[2023-03-22 04:03:29] [INFO ] Flatten gal took : 179 ms
[2023-03-22 04:03:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 04:03:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3103 places, 2603 transitions and 10006 arcs took 19 ms.
Total runtime 240845 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1072/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-100A-LTLCardinality-10

BK_STOP 1679457811249

--------------------
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
mcc2023
ltl formula name ShieldPPPs-PT-100A-LTLCardinality-10
ltl formula formula --ltl=/tmp/1072/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 3103 places, 2603 transitions and 10006 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.470 real 0.130 user 0.220 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1072/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1072/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1072/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1072/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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) [0x55d6eb1e43f4]
1: pnml2lts-mc(+0xa2496) [0x55d6eb1e4496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fdf16d03140]
3: pnml2lts-mc(+0x405be5) [0x55d6eb547be5]
4: pnml2lts-mc(+0x16b3f9) [0x55d6eb2ad3f9]
5: pnml2lts-mc(+0x164ac4) [0x55d6eb2a6ac4]
6: pnml2lts-mc(+0x272e0a) [0x55d6eb3b4e0a]
7: pnml2lts-mc(+0xb61f0) [0x55d6eb1f81f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fdf16b564d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fdf16b5667a]
10: pnml2lts-mc(+0xa1581) [0x55d6eb1e3581]
11: pnml2lts-mc(+0xa1910) [0x55d6eb1e3910]
12: pnml2lts-mc(+0xa32a2) [0x55d6eb1e52a2]
13: pnml2lts-mc(+0xa50f4) [0x55d6eb1e70f4]
14: pnml2lts-mc(+0xa516b) [0x55d6eb1e716b]
15: pnml2lts-mc(+0x3f34b3) [0x55d6eb5354b3]
16: pnml2lts-mc(+0x7c63d) [0x55d6eb1be63d]
17: pnml2lts-mc(+0x67d86) [0x55d6eb1a9d86]
18: pnml2lts-mc(+0x60a8a) [0x55d6eb1a2a8a]
19: pnml2lts-mc(+0x5eb15) [0x55d6eb1a0b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fdf16b3ed0a]
21: pnml2lts-mc(+0x6075e) [0x55d6eb1a275e]

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-100A"
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-100A, 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-167903717100515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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