Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K 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 SieveSingleMsgMbox-PT-d1m18-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679247164879

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:32:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 17:32:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:32:46] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-19 17:32:46] [INFO ] Transformed 1295 places.
[2023-03-19 17:32:46] [INFO ] Transformed 749 transitions.
[2023-03-19 17:32:46] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 316 place count 183 transition count 236
Iterating global reduction 1 with 59 rules applied. Total rules applied 375 place count 183 transition count 236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 383 place count 183 transition count 228
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 426 place count 140 transition count 185
Iterating global reduction 2 with 43 rules applied. Total rules applied 469 place count 140 transition count 185
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 485 place count 140 transition count 169
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 509 place count 116 transition count 143
Iterating global reduction 3 with 24 rules applied. Total rules applied 533 place count 116 transition count 143
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 548 place count 116 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 554 place count 110 transition count 120
Iterating global reduction 4 with 6 rules applied. Total rules applied 560 place count 110 transition count 120
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 566 place count 104 transition count 114
Iterating global reduction 4 with 6 rules applied. Total rules applied 572 place count 104 transition count 114
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 575 place count 101 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 578 place count 101 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 579 place count 101 transition count 109
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 582 place count 98 transition count 106
Iterating global reduction 5 with 3 rules applied. Total rules applied 585 place count 98 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 587 place count 96 transition count 104
Iterating global reduction 5 with 2 rules applied. Total rules applied 589 place count 96 transition count 104
Applied a total of 589 rules in 60 ms. Remains 96 /259 variables (removed 163) and now considering 104/749 (removed 645) transitions.
// Phase 1: matrix 104 rows 96 cols
[2023-03-19 17:32:47] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-19 17:32:47] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-19 17:32:47] [INFO ] Invariant cache hit.
[2023-03-19 17:32:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-19 17:32:47] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-19 17:32:47] [INFO ] Invariant cache hit.
[2023-03-19 17:32:47] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/259 places, 104/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 96/259 places, 104/749 transitions.
Support contains 5 out of 96 places after structural reductions.
[2023-03-19 17:32:47] [INFO ] Flatten gal took : 26 ms
[2023-03-19 17:32:47] [INFO ] Flatten gal took : 10 ms
[2023-03-19 17:32:47] [INFO ] Input system was already deterministic with 104 transitions.
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 1048 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1024 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 1038 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1066 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:32:48] [INFO ] Invariant cache hit.
[2023-03-19 17:32:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:32:48] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-19 17:32:48] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-19 17:32:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-19 17:32:48] [INFO ] After 23ms SMT Verify possible using 42 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:32:48] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:32:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:32:48] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:32:48] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:32:48] [INFO ] After 18ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:32:48] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-19 17:32:48] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 104/104 transitions.
Graph (complete) has 265 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 95 transition count 102
Applied a total of 3 rules in 9 ms. Remains 95 /96 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 95/96 places, 102/104 transitions.
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1056 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1058 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 988 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 749774 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{2=1}
Probabilistic random walk after 749774 steps, saw 344565 distinct states, run finished after 3002 ms. (steps per millisecond=249 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 102 rows 95 cols
[2023-03-19 17:32:51] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-19 17:32:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:32:51] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:32:51] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-19 17:32:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-19 17:32:51] [INFO ] After 16ms SMT Verify possible using 40 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:32:51] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:32:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:32:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:32:52] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:32:52] [INFO ] After 14ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:32:52] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-19 17:32:52] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 94 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 93 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 93 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 91 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 91 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 90 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 90 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 89 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 89 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 88 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 88 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 87 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 86 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 85 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 85 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 84 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 83 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 83 transition count 88
Applied a total of 24 rules in 29 ms. Remains 83 /95 variables (removed 12) and now considering 88/102 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 83/95 places, 88/102 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1055 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1019 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 895292 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 895292 steps, saw 407513 distinct states, run finished after 3008 ms. (steps per millisecond=297 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 88 rows 83 cols
[2023-03-19 17:32:55] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-19 17:32:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:32:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:32:55] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-19 17:32:55] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-19 17:32:55] [INFO ] After 35ms SMT Verify possible using 35 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:32:55] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:32:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:32:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:32:55] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:32:55] [INFO ] After 13ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:32:55] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-19 17:32:55] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-19 17:32:55] [INFO ] Invariant cache hit.
[2023-03-19 17:32:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-19 17:32:55] [INFO ] Invariant cache hit.
[2023-03-19 17:32:55] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-19 17:32:55] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-19 17:32:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:32:55] [INFO ] Invariant cache hit.
[2023-03-19 17:32:55] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 83/83 places, 88/88 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 83 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 79 transition count 82
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 10 place count 79 transition count 69
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 36 place count 66 transition count 69
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 50 place count 59 transition count 62
Applied a total of 50 rules in 12 ms. Remains 59 /83 variables (removed 24) and now considering 62/88 (removed 26) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 62 rows 59 cols
[2023-03-19 17:32:55] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-19 17:32:55] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-19 17:32:55] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:32:55] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-19 17:32:55] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 2 ms to minimize.
[2023-03-19 17:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-19 17:32:55] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:32:55] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:32:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-19 17:32:55] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:32:55] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:32:55] [INFO ] Deduced a trap composed of 32 places in 22 ms of which 0 ms to minimize.
[2023-03-19 17:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-19 17:32:55] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-19 17:32:55] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 19 stabilizing places and 23 stable transitions
Graph (complete) has 300 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 92 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 89 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 89 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 87 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 86 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 85 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 84 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 83 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 82 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 81 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 80 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 80 transition count 85
Applied a total of 33 rules in 25 ms. Remains 80 /96 variables (removed 16) and now considering 85/104 (removed 19) transitions.
// Phase 1: matrix 85 rows 80 cols
[2023-03-19 17:32:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:32:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 17:32:56] [INFO ] Invariant cache hit.
[2023-03-19 17:32:56] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-19 17:32:56] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-19 17:32:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:32:56] [INFO ] Invariant cache hit.
[2023-03-19 17:32:56] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/96 places, 85/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 80/96 places, 85/104 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s67)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22494 reset in 205 ms.
Product exploration explored 100000 steps with 22529 reset in 133 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 250 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1012 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2817558 steps, run timeout after 3001 ms. (steps per millisecond=938 ) properties seen :{}
Probabilistic random walk after 2817558 steps, saw 1313056 distinct states, run finished after 3001 ms. (steps per millisecond=938 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:32:59] [INFO ] Invariant cache hit.
[2023-03-19 17:32:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:32:59] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:33:00] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 17:33:00] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-19 17:33:00] [INFO ] After 10ms SMT Verify possible using 34 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:33:00] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:33:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 17:33:00] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:33:00] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:33:00] [INFO ] After 8ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:33:00] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-19 17:33:00] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 85/85 transitions.
Graph (complete) has 221 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 79 transition count 83
Applied a total of 3 rules in 6 ms. Remains 79 /80 variables (removed 1) and now considering 83/85 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 79/80 places, 83/85 transitions.
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1069 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2917827 steps, run visited all 1 properties in 2959 ms. (steps per millisecond=986 )
Probabilistic random walk after 2917827 steps, saw 1355381 distinct states, run finished after 2960 ms. (steps per millisecond=985 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 85/85 transitions.
Applied a total of 0 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-19 17:33:03] [INFO ] Invariant cache hit.
[2023-03-19 17:33:03] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-19 17:33:03] [INFO ] Invariant cache hit.
[2023-03-19 17:33:03] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-19 17:33:03] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-19 17:33:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:33:03] [INFO ] Invariant cache hit.
[2023-03-19 17:33:03] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 80/80 places, 85/85 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 250 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1024 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2465730 steps, run timeout after 3001 ms. (steps per millisecond=821 ) properties seen :{}
Probabilistic random walk after 2465730 steps, saw 1148875 distinct states, run finished after 3001 ms. (steps per millisecond=821 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:33:06] [INFO ] Invariant cache hit.
[2023-03-19 17:33:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:33:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 17:33:07] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 17:33:07] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-19 17:33:07] [INFO ] After 11ms SMT Verify possible using 34 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:33:07] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:33:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:33:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:33:07] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:33:07] [INFO ] After 9ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:33:07] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-19 17:33:07] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 85/85 transitions.
Graph (complete) has 221 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 79 transition count 83
Applied a total of 3 rules in 5 ms. Remains 79 /80 variables (removed 1) and now considering 83/85 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 79/80 places, 83/85 transitions.
Incomplete random walk after 10000 steps, including 2239 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1013 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2470224 steps, run timeout after 3001 ms. (steps per millisecond=823 ) properties seen :{}
Probabilistic random walk after 2470224 steps, saw 1148468 distinct states, run finished after 3001 ms. (steps per millisecond=823 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 79 cols
[2023-03-19 17:33:10] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-19 17:33:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 17:33:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 17:33:10] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 17:33:10] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-19 17:33:10] [INFO ] After 15ms SMT Verify possible using 32 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:33:10] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:33:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 17:33:10] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 17:33:10] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:33:10] [INFO ] After 14ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:33:10] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 17:33:10] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-19 17:33:10] [INFO ] Invariant cache hit.
[2023-03-19 17:33:10] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-19 17:33:10] [INFO ] Invariant cache hit.
[2023-03-19 17:33:10] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-19 17:33:10] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-19 17:33:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:33:10] [INFO ] Invariant cache hit.
[2023-03-19 17:33:10] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 79/79 places, 83/83 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 79 transition count 77
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 75 transition count 77
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 10 place count 75 transition count 63
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 38 place count 61 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 56 transition count 58
Applied a total of 48 rules in 10 ms. Remains 56 /79 variables (removed 23) and now considering 58/83 (removed 25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 58 rows 56 cols
[2023-03-19 17:33:10] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-19 17:33:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 17:33:10] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:33:10] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 17:33:10] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2023-03-19 17:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-19 17:33:10] [INFO ] After 78ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:33:10] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:33:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 17:33:10] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-19 17:33:10] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:33:10] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2023-03-19 17:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-19 17:33:10] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 17:33:10] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22377 reset in 97 ms.
Product exploration explored 100000 steps with 22418 reset in 111 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 80 cols
[2023-03-19 17:33:11] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:33:11] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-19 17:33:11] [INFO ] Invariant cache hit.
[2023-03-19 17:33:11] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-19 17:33:11] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-19 17:33:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:33:11] [INFO ] Invariant cache hit.
[2023-03-19 17:33:11] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 80/80 places, 85/85 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02 finished in 15797 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) U p1))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 101
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 90 transition count 98
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 90 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 86 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 86 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 86 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 84 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 83 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 82 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 81 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 81 transition count 86
Applied a total of 32 rules in 17 ms. Remains 81 /96 variables (removed 15) and now considering 86/104 (removed 18) transitions.
// Phase 1: matrix 86 rows 81 cols
[2023-03-19 17:33:11] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:33:11] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-19 17:33:11] [INFO ] Invariant cache hit.
[2023-03-19 17:33:11] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-19 17:33:11] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-19 17:33:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:33:12] [INFO ] Invariant cache hit.
[2023-03-19 17:33:12] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/96 places, 86/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 81/96 places, 86/104 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s42), p0:(LEQ 1 s10)], nbAcceptance=0, 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 11 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 92 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 89 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 88 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 88 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 87 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 86 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 85 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 84 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 83 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 82 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 81 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 81 transition count 86
Applied a total of 31 rules in 21 ms. Remains 81 /96 variables (removed 15) and now considering 86/104 (removed 18) transitions.
// Phase 1: matrix 86 rows 81 cols
[2023-03-19 17:33:12] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:33:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-19 17:33:12] [INFO ] Invariant cache hit.
[2023-03-19 17:33:12] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-19 17:33:12] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-19 17:33:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:33:12] [INFO ] Invariant cache hit.
[2023-03-19 17:33:12] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/96 places, 86/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 81/96 places, 86/104 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s72)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09 finished in 380 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 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 92 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 92 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 90 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 90 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 90 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 89 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 89 transition count 95
Applied a total of 16 rules in 12 ms. Remains 89 /96 variables (removed 7) and now considering 95/104 (removed 9) transitions.
// Phase 1: matrix 95 rows 89 cols
[2023-03-19 17:33:12] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 17:33:12] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-19 17:33:12] [INFO ] Invariant cache hit.
[2023-03-19 17:33:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 17:33:12] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-19 17:33:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:33:12] [INFO ] Invariant cache hit.
[2023-03-19 17:33:12] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/96 places, 95/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 359 ms. Remains : 89/96 places, 95/104 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14 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:(GT 1 s57)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22543 reset in 121 ms.
Product exploration explored 100000 steps with 22430 reset in 129 ms.
Computed a total of 19 stabilizing places and 23 stable transitions
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 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 93 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2204 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 998 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4140 steps, run visited all 1 properties in 9 ms. (steps per millisecond=460 )
Probabilistic random walk after 4140 steps, saw 1903 distinct states, run finished after 9 ms. (steps per millisecond=460 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 163 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-19 17:33:13] [INFO ] Invariant cache hit.
[2023-03-19 17:33:13] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-19 17:33:14] [INFO ] Invariant cache hit.
[2023-03-19 17:33:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 17:33:14] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-19 17:33:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:33:14] [INFO ] Invariant cache hit.
[2023-03-19 17:33:14] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 429 ms. Remains : 89/89 places, 95/95 transitions.
Computed a total of 19 stabilizing places and 23 stable transitions
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 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 110 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1041 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4140 steps, run visited all 1 properties in 10 ms. (steps per millisecond=414 )
Probabilistic random walk after 4140 steps, saw 1903 distinct states, run finished after 10 ms. (steps per millisecond=414 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 195 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22495 reset in 113 ms.
Product exploration explored 100000 steps with 22413 reset in 111 ms.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-19 17:33:15] [INFO ] Invariant cache hit.
[2023-03-19 17:33:15] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-19 17:33:15] [INFO ] Invariant cache hit.
[2023-03-19 17:33:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 17:33:15] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-19 17:33:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:33:15] [INFO ] Invariant cache hit.
[2023-03-19 17:33:15] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 89/89 places, 95/95 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14 finished in 3116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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)))'
[2023-03-19 17:33:15] [INFO ] Flatten gal took : 13 ms
[2023-03-19 17:33:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 17:33:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 96 places, 104 transitions and 413 arcs took 2 ms.
Total runtime 29230 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SieveSingleMsgMbox-PT-d1m18
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679247199332

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02
lola: result : false
lola: markings : 449181
lola: fired transitions : 949320
lola: time used : 1.000000
lola: memory pages used : 3
lola: LAUNCH task # 4 (type EXCL) for 3 SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14
lola: result : false
lola: markings : 402668
lola: fired transitions : 850146
lola: time used : 2.000000
lola: memory pages used : 3
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02: LTL false LTL model checker
SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14: LTL false LTL model checker


Time elapsed: 3 secs. Pages in use: 3

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="SieveSingleMsgMbox-PT-d1m18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is SieveSingleMsgMbox-PT-d1m18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r423-tajo-167905976700419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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