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

About the Execution of Marcie+red for Dekker-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5628.707 3600000.00 3653636.00 10056.80 FTFF?TTTT?TFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r138-smll-167819419300038.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Dekker-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419300038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 01:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 01:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 01:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.9M 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 Dekker-PT-100-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678543254442

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 14:00:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 14:00:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 14:00:59] [INFO ] Load time of PNML (sax parser for PT used): 939 ms
[2023-03-11 14:00:59] [INFO ] Transformed 500 places.
[2023-03-11 14:00:59] [INFO ] Transformed 10200 transitions.
[2023-03-11 14:00:59] [INFO ] Found NUPN structural information;
[2023-03-11 14:00:59] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 1276 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 49 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-100-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1323 ms. (steps per millisecond=7 ) properties (out of 11) seen :7
FORMULA Dekker-PT-100-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :1
FORMULA Dekker-PT-100-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 14:01:01] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2023-03-11 14:01:01] [INFO ] Computed 300 place invariants in 26 ms
[2023-03-11 14:01:02] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 14:01:02] [INFO ] [Nat]Absence check using 200 positive place invariants in 89 ms returned sat
[2023-03-11 14:01:02] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 34 ms returned sat
[2023-03-11 14:01:03] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 14:01:03] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-11 14:01:03] [INFO ] After 248ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 14:01:04] [INFO ] Deduced a trap composed of 4 places in 822 ms of which 11 ms to minimize.
[2023-03-11 14:01:05] [INFO ] Deduced a trap composed of 6 places in 649 ms of which 2 ms to minimize.
[2023-03-11 14:01:06] [INFO ] Deduced a trap composed of 4 places in 1342 ms of which 3 ms to minimize.
[2023-03-11 14:01:07] [INFO ] Deduced a trap composed of 4 places in 611 ms of which 1 ms to minimize.
[2023-03-11 14:01:08] [INFO ] Deduced a trap composed of 4 places in 611 ms of which 2 ms to minimize.
[2023-03-11 14:01:08] [INFO ] Deduced a trap composed of 4 places in 648 ms of which 1 ms to minimize.
[2023-03-11 14:01:09] [INFO ] Deduced a trap composed of 4 places in 530 ms of which 1 ms to minimize.
[2023-03-11 14:01:10] [INFO ] Deduced a trap composed of 4 places in 671 ms of which 3 ms to minimize.
[2023-03-11 14:01:10] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 1 ms to minimize.
[2023-03-11 14:01:11] [INFO ] Deduced a trap composed of 4 places in 629 ms of which 1 ms to minimize.
[2023-03-11 14:01:12] [INFO ] Deduced a trap composed of 4 places in 592 ms of which 0 ms to minimize.
[2023-03-11 14:01:12] [INFO ] Deduced a trap composed of 4 places in 641 ms of which 1 ms to minimize.
[2023-03-11 14:01:13] [INFO ] Deduced a trap composed of 4 places in 544 ms of which 1 ms to minimize.
[2023-03-11 14:01:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9412 ms
[2023-03-11 14:01:13] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 9412 ms
[2023-03-11 14:01:13] [INFO ] Deduced a trap composed of 4 places in 512 ms of which 1 ms to minimize.
[2023-03-11 14:01:14] [INFO ] Deduced a trap composed of 6 places in 593 ms of which 1 ms to minimize.
[2023-03-11 14:01:15] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 1 ms to minimize.
[2023-03-11 14:01:15] [INFO ] Deduced a trap composed of 4 places in 543 ms of which 0 ms to minimize.
[2023-03-11 14:01:16] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 1 ms to minimize.
[2023-03-11 14:01:16] [INFO ] Deduced a trap composed of 4 places in 489 ms of which 1 ms to minimize.
[2023-03-11 14:01:17] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 1 ms to minimize.
[2023-03-11 14:01:17] [INFO ] Deduced a trap composed of 6 places in 457 ms of which 1 ms to minimize.
[2023-03-11 14:01:18] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 1 ms to minimize.
[2023-03-11 14:01:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 4731 ms
[2023-03-11 14:01:18] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 1 ms to minimize.
[2023-03-11 14:01:19] [INFO ] Deduced a trap composed of 4 places in 547 ms of which 1 ms to minimize.
[2023-03-11 14:01:19] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 0 ms to minimize.
[2023-03-11 14:01:20] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 1 ms to minimize.
[2023-03-11 14:01:20] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 1 ms to minimize.
[2023-03-11 14:01:21] [INFO ] Deduced a trap composed of 4 places in 511 ms of which 1 ms to minimize.
[2023-03-11 14:01:21] [INFO ] Deduced a trap composed of 4 places in 489 ms of which 1 ms to minimize.
[2023-03-11 14:01:22] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 1 ms to minimize.
[2023-03-11 14:01:22] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 1 ms to minimize.
[2023-03-11 14:01:23] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 0 ms to minimize.
[2023-03-11 14:01:23] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 1 ms to minimize.
[2023-03-11 14:01:23] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5471 ms
[2023-03-11 14:01:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5472 ms
[2023-03-11 14:01:23] [INFO ] After 20011ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-11 14:01:23] [INFO ] After 21231ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA Dekker-PT-100-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 7 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 1234 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1238 ms. Remains : 500/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 134330 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134330 steps, saw 124290 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 14:01:28] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-11 14:01:28] [INFO ] Invariant cache hit.
[2023-03-11 14:01:28] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 14:01:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 63 ms returned sat
[2023-03-11 14:01:29] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 37 ms returned sat
[2023-03-11 14:01:29] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 14:01:29] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-11 14:01:29] [INFO ] After 221ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 14:01:30] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
[2023-03-11 14:01:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-11 14:01:30] [INFO ] Deduced a trap composed of 6 places in 615 ms of which 1 ms to minimize.
[2023-03-11 14:01:31] [INFO ] Deduced a trap composed of 4 places in 522 ms of which 0 ms to minimize.
[2023-03-11 14:01:32] [INFO ] Deduced a trap composed of 4 places in 672 ms of which 0 ms to minimize.
[2023-03-11 14:01:32] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 1 ms to minimize.
[2023-03-11 14:01:33] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 2 ms to minimize.
[2023-03-11 14:01:33] [INFO ] Deduced a trap composed of 4 places in 569 ms of which 1 ms to minimize.
[2023-03-11 14:01:34] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 1 ms to minimize.
[2023-03-11 14:01:35] [INFO ] Deduced a trap composed of 4 places in 597 ms of which 1 ms to minimize.
[2023-03-11 14:01:35] [INFO ] Deduced a trap composed of 4 places in 629 ms of which 1 ms to minimize.
[2023-03-11 14:01:36] [INFO ] Deduced a trap composed of 4 places in 661 ms of which 1 ms to minimize.
[2023-03-11 14:01:37] [INFO ] Deduced a trap composed of 4 places in 586 ms of which 1 ms to minimize.
[2023-03-11 14:01:37] [INFO ] Deduced a trap composed of 4 places in 652 ms of which 1 ms to minimize.
[2023-03-11 14:01:37] [INFO ] Trap strengthening procedure interrupted after too many repetitions 7541 ms
[2023-03-11 14:01:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 7541 ms
[2023-03-11 14:01:37] [INFO ] After 7966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-11 14:01:37] [INFO ] After 8892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 708 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 709 ms. Remains : 500/500 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 542 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-11 14:01:39] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-11 14:01:39] [INFO ] Invariant cache hit.
[2023-03-11 14:01:48] [INFO ] Implicit Places using invariants in 9587 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 9620 ms to find 99 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 401/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 737 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10901 ms. Remains : 401/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 175033 steps, run timeout after 3002 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175033 steps, saw 161431 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 14:01:53] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2023-03-11 14:01:53] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-11 14:01:53] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 14:01:53] [INFO ] [Nat]Absence check using 200 positive place invariants in 46 ms returned sat
[2023-03-11 14:01:53] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 14:01:53] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 14:01:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-11 14:01:53] [INFO ] After 129ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 14:01:53] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-11 14:01:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-11 14:01:54] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 14:01:54] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 29 ms.
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 464 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 401/401 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 415 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-11 14:01:54] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-11 14:01:54] [INFO ] Invariant cache hit.
[2023-03-11 14:01:57] [INFO ] Implicit Places using invariants in 2764 ms returned []
Implicit Place search using SMT only with invariants took 2765 ms to find 0 implicit places.
[2023-03-11 14:01:57] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-11 14:01:57] [INFO ] Invariant cache hit.
[2023-03-11 14:02:05] [INFO ] Dead Transitions using invariants and state equation in 8025 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11210 ms. Remains : 401/401 places, 10200/10200 transitions.
Graph (complete) has 605 edges and 401 vertex of which 21 are kept as prefixes of interest. Removing 380 places using SCC suffix rule.3 ms
Discarding 380 places :
Also discarding 9690 output transitions
Drop transitions removed 9690 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 490 transitions
Reduce isomorphic transitions removed 490 transitions.
Iterating post reduction 0 with 491 rules applied. Total rules applied 492 place count 20 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 501 place count 14 transition count 17
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 504 place count 14 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 505 place count 14 transition count 13
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 508 place count 12 transition count 12
Applied a total of 508 rules in 35 ms. Remains 12 /401 variables (removed 389) and now considering 12/10200 (removed 10188) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 12 cols
[2023-03-11 14:02:05] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-11 14:02:05] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 14:02:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 14:02:05] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 14:02:05] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 14:02:05] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-11 14:02:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-11 14:02:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 401 places, 10200 transitions and 70201 arcs took 97 ms.
[2023-03-11 14:02:07] [INFO ] Flatten gal took : 943 ms
Total runtime 68886 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Dekker_PT_100
(NrP: 401 NrTr: 10200 NrArc: 70201)

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

net check time: 0m 0.016sec

init dd package: 0m 3.343sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10505320 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16087504 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 ReachabilityCardinality -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.388sec

1127 4719 7193 9506 306465

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="Dekker-PT-100"
export BK_EXAMINATION="ReachabilityCardinality"
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 Dekker-PT-100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-smll-167819419300038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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