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-167905976700425.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-d1m36, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976700425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 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-d1m36-CTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679247296965

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m36
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:34:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 17:34:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:34:58] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-19 17:34:58] [INFO ] Transformed 1295 places.
[2023-03-19 17:34:58] [INFO ] Transformed 749 transitions.
[2023-03-19 17:34:58] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 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 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 315 place count 184 transition count 236
Iterating global reduction 1 with 58 rules applied. Total rules applied 373 place count 184 transition count 236
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 380 place count 184 transition count 229
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 417 place count 147 transition count 192
Iterating global reduction 2 with 37 rules applied. Total rules applied 454 place count 147 transition count 192
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 463 place count 147 transition count 183
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 488 place count 122 transition count 157
Iterating global reduction 3 with 25 rules applied. Total rules applied 513 place count 122 transition count 157
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 525 place count 122 transition count 145
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 529 place count 118 transition count 139
Iterating global reduction 4 with 4 rules applied. Total rules applied 533 place count 118 transition count 139
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 537 place count 114 transition count 135
Iterating global reduction 4 with 4 rules applied. Total rules applied 541 place count 114 transition count 135
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 543 place count 112 transition count 132
Iterating global reduction 4 with 2 rules applied. Total rules applied 545 place count 112 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 546 place count 112 transition count 131
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 548 place count 110 transition count 129
Iterating global reduction 5 with 2 rules applied. Total rules applied 550 place count 110 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 551 place count 109 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 552 place count 109 transition count 128
Applied a total of 552 rules in 68 ms. Remains 109 /259 variables (removed 150) and now considering 128/749 (removed 621) transitions.
// Phase 1: matrix 128 rows 109 cols
[2023-03-19 17:34:58] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-19 17:34:59] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-19 17:34:59] [INFO ] Invariant cache hit.
[2023-03-19 17:34:59] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-19 17:34:59] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2023-03-19 17:34:59] [INFO ] Invariant cache hit.
[2023-03-19 17:35:01] [INFO ] Dead Transitions using invariants and state equation in 1705 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/259 places, 128/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2443 ms. Remains : 109/259 places, 128/749 transitions.
Support contains 10 out of 109 places after structural reductions.
[2023-03-19 17:35:01] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2023-03-19 17:35:01] [INFO ] Flatten gal took : 65 ms
[2023-03-19 17:35:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 17:35:01] [INFO ] Flatten gal took : 22 ms
[2023-03-19 17:35:01] [INFO ] Input system was already deterministic with 128 transitions.
Support contains 9 out of 109 places (down from 10) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 658 ms. (steps per millisecond=15 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1059 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1017 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1041 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1027 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1055 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 982 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1019 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 298548 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298548 steps, saw 124585 distinct states, run finished after 3005 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-19 17:35:05] [INFO ] Invariant cache hit.
[2023-03-19 17:35:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:35:05] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 9 ms returned sat
[2023-03-19 17:35:05] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:1
[2023-03-19 17:35:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 17:35:06] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:35:06] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :1
[2023-03-19 17:35:06] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-19 17:35:06] [INFO ] After 38ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :7 sat :1
[2023-03-19 17:35:06] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-19 17:35:06] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :1
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 128/128 transitions.
Graph (complete) has 310 edges and 109 vertex of which 108 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 108 transition count 126
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 100 transition count 118
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 100 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 100 transition count 114
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 29 place count 94 transition count 104
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 94 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 94 transition count 101
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 43 place count 89 transition count 95
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 89 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 89 transition count 94
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 53 place count 85 transition count 90
Iterating global reduction 4 with 4 rules applied. Total rules applied 57 place count 85 transition count 90
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 82 transition count 87
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 82 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 82 transition count 86
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 67 place count 79 transition count 83
Iterating global reduction 5 with 3 rules applied. Total rules applied 70 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 71 place count 78 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 78 transition count 81
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 73 place count 77 transition count 80
Iterating global reduction 5 with 1 rules applied. Total rules applied 74 place count 77 transition count 80
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 75 place count 76 transition count 79
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 76 transition count 79
Applied a total of 76 rules in 29 ms. Remains 76 /109 variables (removed 33) and now considering 79/128 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 76/109 places, 79/128 transitions.
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1024 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2936389 steps, run timeout after 3001 ms. (steps per millisecond=978 ) properties seen :{}
Probabilistic random walk after 2936389 steps, saw 1362223 distinct states, run finished after 3001 ms. (steps per millisecond=978 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 76 cols
[2023-03-19 17:35:09] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-19 17:35:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:35:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:35:09] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:35:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:35:09] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:35:09] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:35:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 17:35:09] [INFO ] After 26ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:35:09] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-19 17:35:09] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 79/79 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 76/76 places, 79/79 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 79/79 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2023-03-19 17:35:09] [INFO ] Invariant cache hit.
[2023-03-19 17:35:09] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 17:35:09] [INFO ] Invariant cache hit.
[2023-03-19 17:35:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 17:35:09] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-19 17:35:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:35:09] [INFO ] Invariant cache hit.
[2023-03-19 17:35:09] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 76/76 places, 79/79 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 76 transition count 72
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 71 transition count 72
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 12 place count 71 transition count 58
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 40 place count 57 transition count 58
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 53 transition count 54
Applied a total of 48 rules in 9 ms. Remains 53 /76 variables (removed 23) and now considering 54/79 (removed 25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 54 rows 53 cols
[2023-03-19 17:35:09] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-19 17:35:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:35:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:35:09] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:35:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:35:09] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 17:35:09] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:35:09] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-19 17:35:09] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 7 atomic propositions for a total of 6 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 17:35:09] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-19 17:35:09] [INFO ] Flatten gal took : 8 ms
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 17:35:09] [INFO ] Flatten gal took : 8 ms
[2023-03-19 17:35:09] [INFO ] Input system was already deterministic with 128 transitions.
Computed a total of 24 stabilizing places and 30 stable transitions
Graph (complete) has 349 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 101 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 101 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 101 transition count 116
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 95 transition count 106
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 95 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 35 place count 95 transition count 103
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 90 transition count 97
Iterating global reduction 2 with 5 rules applied. Total rules applied 45 place count 90 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 90 transition count 96
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 86 transition count 92
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 86 transition count 92
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 57 place count 83 transition count 89
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 83 transition count 88
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 64 place count 80 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 67 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 68 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 77 transition count 81
Applied a total of 73 rules in 11 ms. Remains 77 /109 variables (removed 32) and now considering 81/128 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 77/109 places, 81/128 transitions.
[2023-03-19 17:35:09] [INFO ] Flatten gal took : 3 ms
[2023-03-19 17:35:09] [INFO ] Flatten gal took : 3 ms
[2023-03-19 17:35:09] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 101 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 101 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 101 transition count 116
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 95 transition count 106
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 95 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 35 place count 95 transition count 103
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 90 transition count 97
Iterating global reduction 2 with 5 rules applied. Total rules applied 45 place count 90 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 90 transition count 96
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 86 transition count 92
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 86 transition count 92
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 57 place count 83 transition count 89
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 83 transition count 88
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 64 place count 80 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 67 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 68 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 77 transition count 81
Applied a total of 73 rules in 10 ms. Remains 77 /109 variables (removed 32) and now considering 81/128 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 77/109 places, 81/128 transitions.
[2023-03-19 17:35:09] [INFO ] Flatten gal took : 4 ms
[2023-03-19 17:35:10] [INFO ] Flatten gal took : 4 ms
[2023-03-19 17:35:10] [INFO ] Input system was already deterministic with 81 transitions.
[2023-03-19 17:35:10] [INFO ] Flatten gal took : 7 ms
[2023-03-19 17:35:10] [INFO ] Flatten gal took : 7 ms
[2023-03-19 17:35:10] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-19 17:35:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 109 places, 128 transitions and 509 arcs took 2 ms.
Total runtime 11554 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SieveSingleMsgMbox-PT-d1m36
BK_EXAMINATION: CTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375

FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679247310289

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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/CTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:129
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:129
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH INITIAL
lola: LAUNCH task # 4 (type CNST) for 3 SieveSingleMsgMbox-PT-d1m36-CTLCardinality-08
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 4 (type CNST) for SieveSingleMsgMbox-PT-d1m36-CTLCardinality-08
lola: result : true
lola: LAUNCH task # 1 (type EXCL) for 0 SieveSingleMsgMbox-PT-d1m36-CTLCardinality-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for SieveSingleMsgMbox-PT-d1m36-CTLCardinality-04
lola: result : true
lola: markings : 119
lola: fired transitions : 147
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d1m36-CTLCardinality-04: EG true state space / EG
SieveSingleMsgMbox-PT-d1m36-CTLCardinality-08: INITIAL true preprocessing


Time elapsed: 0 secs. Pages in use: 1

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-d1m36"
export BK_EXAMINATION="CTLCardinality"
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-d1m36, examination is CTLCardinality"
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-167905976700425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m36.tgz
mv SieveSingleMsgMbox-PT-d1m36 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;