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

About the Execution of Marcie+red for BugTracking-PT-q3m064

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6475.779 3600000.00 3678720.00 875.20 ?FF?F?T?TTFFTFFF 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.r042-tajo-167813695700361.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 marciexred
Input is BugTracking-PT-q3m064, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695700361
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 06:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 06:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 06:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 06:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 07:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 07:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 07:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 07:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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 BugTracking-PT-q3m064-CTLCardinality-00
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-01
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-02
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-03
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-04
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-05
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-06
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-07
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-08
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-09
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-10
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-11
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-12
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-13
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-14
FORMULA_NAME BugTracking-PT-q3m064-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678715631513

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m064
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 13:53:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 13:53:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 13:53:56] [INFO ] Load time of PNML (sax parser for PT used): 1462 ms
[2023-03-13 13:53:57] [INFO ] Transformed 754 places.
[2023-03-13 13:53:57] [INFO ] Transformed 27370 transitions.
[2023-03-13 13:53:57] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1876 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Deduced a syphon composed of 514 places in 171 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA BugTracking-PT-q3m064-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 209 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-13 13:53:57] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-13 13:53:57] [INFO ] Computed 8 place invariants in 45 ms
[2023-03-13 13:53:59] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2023-03-13 13:53:59] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 13:53:59] [INFO ] Invariant cache hit.
[2023-03-13 13:54:00] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-13 13:54:02] [INFO ] Implicit Places using invariants and state equation in 2994 ms returned []
Implicit Place search using SMT with State Equation took 4311 ms to find 0 implicit places.
[2023-03-13 13:54:02] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 13:54:02] [INFO ] Invariant cache hit.
[2023-03-13 13:54:03] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5919 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 23 out of 237 places after structural reductions.
[2023-03-13 13:54:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-13 13:54:04] [INFO ] Flatten gal took : 452 ms
FORMULA BugTracking-PT-q3m064-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 13:54:04] [INFO ] Flatten gal took : 242 ms
[2023-03-13 13:54:05] [INFO ] Input system was already deterministic with 2750 transitions.
Support contains 15 out of 237 places (down from 23) after GAL structural reductions.
FORMULA BugTracking-PT-q3m064-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 51964 steps, run timeout after 3004 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51964 steps, saw 26007 distinct states, run finished after 3006 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-13 13:54:09] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 13:54:09] [INFO ] Invariant cache hit.
[2023-03-13 13:54:10] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-13 13:54:10] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-13 13:54:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 13:54:11] [INFO ] After 1196ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :6
[2023-03-13 13:54:11] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-13 13:54:12] [INFO ] After 655ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :7 sat :6
[2023-03-13 13:54:12] [INFO ] Deduced a trap composed of 21 places in 335 ms of which 43 ms to minimize.
[2023-03-13 13:54:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 386 ms
[2023-03-13 13:54:13] [INFO ] Deduced a trap composed of 51 places in 309 ms of which 2 ms to minimize.
[2023-03-13 13:54:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2023-03-13 13:54:14] [INFO ] Deduced a trap composed of 51 places in 697 ms of which 1 ms to minimize.
[2023-03-13 13:54:14] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 2 ms to minimize.
[2023-03-13 13:54:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1195 ms
[2023-03-13 13:54:14] [INFO ] After 3162ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :5
Attempting to minimize the solution found.
Minimization took 502 ms.
[2023-03-13 13:54:15] [INFO ] After 5217ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :5
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 259 ms.
Support contains 5 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 353 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2023-03-13 13:54:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-13 13:54:16] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-13 13:54:16] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 13:54:17] [INFO ] After 637ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-13 13:54:17] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 13:54:17] [INFO ] After 274ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 13:54:17] [INFO ] After 1162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 13:54:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 13:54:18] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 13:54:18] [INFO ] After 523ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 13:54:19] [INFO ] Deduced a trap composed of 50 places in 256 ms of which 0 ms to minimize.
[2023-03-13 13:54:19] [INFO ] Deduced a trap composed of 51 places in 383 ms of which 0 ms to minimize.
[2023-03-13 13:54:19] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 1 ms to minimize.
[2023-03-13 13:54:20] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 1 ms to minimize.
[2023-03-13 13:54:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1497 ms
[2023-03-13 13:54:20] [INFO ] Deduced a trap composed of 19 places in 395 ms of which 0 ms to minimize.
[2023-03-13 13:54:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 495 ms
[2023-03-13 13:54:20] [INFO ] After 2782ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 197 ms.
[2023-03-13 13:54:21] [INFO ] After 3619ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 62 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 229/229 places, 2747/2747 transitions.
Incomplete random walk after 10024 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=182 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 153755 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153755 steps, saw 66580 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 13:54:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 13:54:24] [INFO ] Invariant cache hit.
[2023-03-13 13:54:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 13:54:25] [INFO ] After 521ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-13 13:54:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 13:54:25] [INFO ] After 279ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 13:54:25] [INFO ] After 910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 13:54:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 13:54:26] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 13:54:26] [INFO ] After 328ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 13:54:26] [INFO ] Deduced a trap composed of 14 places in 355 ms of which 1 ms to minimize.
[2023-03-13 13:54:27] [INFO ] Deduced a trap composed of 11 places in 416 ms of which 1 ms to minimize.
[2023-03-13 13:54:27] [INFO ] Deduced a trap composed of 39 places in 400 ms of which 1 ms to minimize.
[2023-03-13 13:54:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1405 ms
[2023-03-13 13:54:28] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 1 ms to minimize.
[2023-03-13 13:54:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2023-03-13 13:54:28] [INFO ] After 2330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-13 13:54:28] [INFO ] After 3210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 51 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 111 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-13 13:54:28] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 13:54:28] [INFO ] Invariant cache hit.
[2023-03-13 13:54:29] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-13 13:54:29] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 13:54:29] [INFO ] Invariant cache hit.
[2023-03-13 13:54:29] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 13:54:31] [INFO ] Implicit Places using invariants and state equation in 2315 ms returned []
Implicit Place search using SMT with State Equation took 2801 ms to find 0 implicit places.
[2023-03-13 13:54:31] [INFO ] Redundant transitions in 214 ms returned []
[2023-03-13 13:54:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 13:54:31] [INFO ] Invariant cache hit.
[2023-03-13 13:54:33] [INFO ] Dead Transitions using invariants and state equation in 1312 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4466 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 626 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-13 13:54:33] [INFO ] Computed 9 place invariants in 49 ms
[2023-03-13 13:54:34] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 13:54:35] [INFO ] After 1039ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-13 13:54:35] [INFO ] After 1251ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-13 13:54:35] [INFO ] After 1579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-13 13:54:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 13:54:36] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 13:54:36] [INFO ] After 819ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-13 13:54:36] [INFO ] After 1070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 9 atomic propositions for a total of 6 simplifications.
FORMULA BugTracking-PT-q3m064-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 13:54:36] [INFO ] Flatten gal took : 230 ms
[2023-03-13 13:54:37] [INFO ] Flatten gal took : 334 ms
[2023-03-13 13:54:37] [INFO ] Input system was already deterministic with 2750 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 13:54:38] [INFO ] Flatten gal took : 200 ms
[2023-03-13 13:54:38] [INFO ] Flatten gal took : 200 ms
[2023-03-13 13:54:38] [INFO ] Input system was already deterministic with 2750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 13:54:38] [INFO ] Flatten gal took : 127 ms
[2023-03-13 13:54:39] [INFO ] Flatten gal took : 122 ms
[2023-03-13 13:54:39] [INFO ] Input system was already deterministic with 2750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 13:54:39] [INFO ] Flatten gal took : 112 ms
[2023-03-13 13:54:39] [INFO ] Flatten gal took : 144 ms
[2023-03-13 13:54:39] [INFO ] Input system was already deterministic with 2750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 13 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 13:54:40] [INFO ] Flatten gal took : 76 ms
[2023-03-13 13:54:40] [INFO ] Flatten gal took : 97 ms
[2023-03-13 13:54:40] [INFO ] Input system was already deterministic with 2750 transitions.
[2023-03-13 13:54:40] [INFO ] Flatten gal took : 99 ms
[2023-03-13 13:54:40] [INFO ] Flatten gal took : 92 ms
[2023-03-13 13:54:40] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 13:54:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 24 ms.
Total runtime 45398 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 237 NrTr: 2750 NrArc: 13477)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.053sec

net check time: 0m 0.014sec

init dd package: 0m 3.025sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9651348 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16082620 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.055sec

7728 16069 23895 29998 39119 46765 51868 61769 69235 73330 84025 91374 94570 109668 113494 115810 131231 135614 137050 154963 157734 158290 177803 179854 179530 200643 201974 200770 223483 224094 222010 246343 246214 243250 269183

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="BugTracking-PT-q3m064"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BugTracking-PT-q3m064, 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 r042-tajo-167813695700361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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