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

About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d2m36

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
643.491 12069.00 21420.00 74.80 FTFTTFTTFFTTFFFT normal

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.r421-tajo-167905975300475.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 itstools
Input is SieveSingleMsgMbox-PT-d2m36, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975300475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:28 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 1.1M 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-d2m36-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679181903649

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 23:25:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 23:25:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:25:05] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-18 23:25:05] [INFO ] Transformed 2398 places.
[2023-03-18 23:25:05] [INFO ] Transformed 1954 transitions.
[2023-03-18 23:25:05] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 265 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 2 formulas.
Deduced a syphon composed of 1984 places in 21 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 971 place count 271 transition count 380
Iterating global reduction 1 with 118 rules applied. Total rules applied 1089 place count 271 transition count 380
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1099 place count 271 transition count 370
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1191 place count 179 transition count 278
Iterating global reduction 2 with 92 rules applied. Total rules applied 1283 place count 179 transition count 278
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 1323 place count 179 transition count 238
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1361 place count 141 transition count 185
Iterating global reduction 3 with 38 rules applied. Total rules applied 1399 place count 141 transition count 185
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1422 place count 141 transition count 162
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1432 place count 131 transition count 147
Iterating global reduction 4 with 10 rules applied. Total rules applied 1442 place count 131 transition count 147
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1452 place count 121 transition count 137
Iterating global reduction 4 with 10 rules applied. Total rules applied 1462 place count 121 transition count 137
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1468 place count 115 transition count 130
Iterating global reduction 4 with 6 rules applied. Total rules applied 1474 place count 115 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1476 place count 115 transition count 128
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1481 place count 110 transition count 123
Iterating global reduction 5 with 5 rules applied. Total rules applied 1486 place count 110 transition count 123
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1489 place count 107 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 1492 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1493 place count 106 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 1494 place count 106 transition count 119
Applied a total of 1494 rules in 128 ms. Remains 106 /414 variables (removed 308) and now considering 119/1954 (removed 1835) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-18 23:25:06] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-18 23:25:06] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-18 23:25:06] [INFO ] Invariant cache hit.
[2023-03-18 23:25:06] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:25:06] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-18 23:25:06] [INFO ] Invariant cache hit.
[2023-03-18 23:25:06] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/414 places, 119/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 851 ms. Remains : 106/414 places, 119/1954 transitions.
Support contains 1 out of 106 places after structural reductions.
[2023-03-18 23:25:06] [INFO ] Flatten gal took : 27 ms
[2023-03-18 23:25:06] [INFO ] Flatten gal took : 20 ms
[2023-03-18 23:25:06] [INFO ] Input system was already deterministic with 119 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1067 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2307021 steps, run timeout after 3001 ms. (steps per millisecond=768 ) properties seen :{}
Probabilistic random walk after 2307021 steps, saw 1081481 distinct states, run finished after 3002 ms. (steps per millisecond=768 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:25:10] [INFO ] Invariant cache hit.
[2023-03-18 23:25:10] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-18 23:25:10] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:25:10] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 23:25:10] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:25:10] [INFO ] After 39ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:25:10] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:25:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:25:10] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:25:10] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:25:10] [INFO ] After 37ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:25:10] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-18 23:25:10] [INFO ] After 244ms 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 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 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 105 transition count 117
Applied a total of 3 rules in 15 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1071 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2204442 steps, run timeout after 3001 ms. (steps per millisecond=734 ) properties seen :{}
Probabilistic random walk after 2204442 steps, saw 1031122 distinct states, run finished after 3001 ms. (steps per millisecond=734 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-18 23:25:13] [INFO ] Computed 4 place invariants in 11 ms
[2023-03-18 23:25:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:25:13] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:25:13] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 23:25:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:25:13] [INFO ] After 10ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:25:13] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:25:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:25:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:25:13] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:25:13] [INFO ] After 26ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:25:13] [INFO ] After 41ms 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-18 23:25:13] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-18 23:25:14] [INFO ] Invariant cache hit.
[2023-03-18 23:25:14] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-18 23:25:14] [INFO ] Invariant cache hit.
[2023-03-18 23:25:14] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:25:14] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2023-03-18 23:25:14] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 23:25:14] [INFO ] Invariant cache hit.
[2023-03-18 23:25:14] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 672 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
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 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 21 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-18 23:25:14] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-18 23:25:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 23:25:14] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:25:14] [INFO ] After 59ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 23:25:14] [INFO ] After 78ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 23:25:14] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Computed a total of 27 stabilizing places and 33 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-18 23:25:14] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-18 23:25:15] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-18 23:25:15] [INFO ] Invariant cache hit.
[2023-03-18 23:25:15] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:25:15] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-18 23:25:15] [INFO ] Invariant cache hit.
[2023-03-18 23:25:15] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 373 ms. Remains : 106/106 places, 119/119 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s58)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLCardinality-08 finished in 634 ms.
All properties solved by simple procedures.
Total runtime 10183 ms.

BK_STOP 1679181915718

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d2m36"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m36, 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 r421-tajo-167905975300475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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