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

About the Execution of Marcie+red for CANConstruction-PT-030

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6672.243 3600000.00 3645368.00 692.80 TF?TT?T?FTTF?TFT 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-167813696000638.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 CANConstruction-PT-030, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Feb 25 21:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 21:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 21:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 21:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 21:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 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 1.4M 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 CANConstruction-PT-030-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678737362924

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=CANConstruction-PT-030
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:56:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 19:56:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:56:04] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2023-03-13 19:56:04] [INFO ] Transformed 2162 places.
[2023-03-13 19:56:04] [INFO ] Transformed 3840 transitions.
[2023-03-13 19:56:04] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 16) seen :6
FORMULA CANConstruction-PT-030-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 3840 rows 2162 cols
[2023-03-13 19:56:06] [INFO ] Computed 61 place invariants in 53 ms
[2023-03-13 19:56:06] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 19:56:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 33 ms returned sat
[2023-03-13 19:56:07] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 15 ms returned sat
[2023-03-13 19:56:09] [INFO ] After 1983ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-13 19:56:09] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-13 19:56:11] [INFO ] After 2025ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-13 19:56:14] [INFO ] After 4707ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 1718 ms.
[2023-03-13 19:56:15] [INFO ] After 9088ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA CANConstruction-PT-030-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-030-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 207 ms.
Support contains 129 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Drop transitions removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 171 place count 2162 transition count 3669
Reduce places removed 171 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 186 rules applied. Total rules applied 357 place count 1991 transition count 3654
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 372 place count 1976 transition count 3654
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 372 place count 1976 transition count 3649
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 382 place count 1971 transition count 3649
Discarding 787 places :
Symmetric choice reduction at 3 with 787 rule applications. Total rules 1169 place count 1184 transition count 2075
Iterating global reduction 3 with 787 rules applied. Total rules applied 1956 place count 1184 transition count 2075
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1996 place count 1164 transition count 2055
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2004 place count 1164 transition count 2047
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 2012 place count 1156 transition count 2047
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 2019 place count 1156 transition count 2040
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2026 place count 1149 transition count 2040
Partial Free-agglomeration rule applied 54 times.
Drop transitions removed 54 transitions
Iterating global reduction 5 with 54 rules applied. Total rules applied 2080 place count 1149 transition count 2040
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 2083 place count 1149 transition count 2040
Applied a total of 2083 rules in 981 ms. Remains 1149 /2162 variables (removed 1013) and now considering 2040/3840 (removed 1800) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 983 ms. Remains : 1149/2162 places, 2040/3840 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 8) seen :4
FORMULA CANConstruction-PT-030-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2040 rows 1149 cols
[2023-03-13 19:56:17] [INFO ] Computed 61 place invariants in 20 ms
[2023-03-13 19:56:17] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:56:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 22 ms returned sat
[2023-03-13 19:56:17] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 10 ms returned sat
[2023-03-13 19:56:18] [INFO ] After 752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:56:18] [INFO ] State equation strengthened by 1807 read => feed constraints.
[2023-03-13 19:56:19] [INFO ] After 809ms SMT Verify possible using 1807 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:56:20] [INFO ] After 1621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 603 ms.
[2023-03-13 19:56:20] [INFO ] After 3288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 43 ms.
Support contains 88 out of 1149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1149/1149 places, 2040/2040 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1149 transition count 2039
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1148 transition count 2039
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 1144 transition count 2031
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 1144 transition count 2031
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 34 place count 1132 transition count 2019
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 42 place count 1128 transition count 2019
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 1128 transition count 2018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 1127 transition count 2018
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 1126 transition count 2016
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 1126 transition count 2016
Applied a total of 46 rules in 556 ms. Remains 1126 /1149 variables (removed 23) and now considering 2016/2040 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 1126/1149 places, 2016/2040 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 174889 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174889 steps, saw 61381 distinct states, run finished after 3004 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2016 rows 1126 cols
[2023-03-13 19:56:24] [INFO ] Computed 61 place invariants in 8 ms
[2023-03-13 19:56:25] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:56:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-13 19:56:25] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 7 ms returned sat
[2023-03-13 19:56:25] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:56:25] [INFO ] State equation strengthened by 1825 read => feed constraints.
[2023-03-13 19:56:26] [INFO ] After 707ms SMT Verify possible using 1825 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:56:27] [INFO ] After 1521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 638 ms.
[2023-03-13 19:56:28] [INFO ] After 3030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 34 ms.
Support contains 88 out of 1126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1126/1126 places, 2016/2016 transitions.
Applied a total of 0 rules in 75 ms. Remains 1126 /1126 variables (removed 0) and now considering 2016/2016 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1126/1126 places, 2016/2016 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1126/1126 places, 2016/2016 transitions.
Applied a total of 0 rules in 102 ms. Remains 1126 /1126 variables (removed 0) and now considering 2016/2016 (removed 0) transitions.
[2023-03-13 19:56:28] [INFO ] Invariant cache hit.
[2023-03-13 19:56:29] [INFO ] Implicit Places using invariants in 820 ms returned [5, 13, 18, 25, 31, 39, 46, 52, 56, 60, 66, 72, 79, 85, 98, 105, 111, 117, 123, 130, 137, 151, 157, 163, 169, 176, 182, 188]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 825 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1098/1126 places, 2016/2016 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1098 transition count 2004
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1086 transition count 2004
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 1085 transition count 2003
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 1085 transition count 2003
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 82 place count 1057 transition count 1975
Applied a total of 82 rules in 211 ms. Remains 1057 /1098 variables (removed 41) and now considering 1975/2016 (removed 41) transitions.
// Phase 1: matrix 1975 rows 1057 cols
[2023-03-13 19:56:29] [INFO ] Computed 33 place invariants in 24 ms
[2023-03-13 19:56:29] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-13 19:56:30] [INFO ] Invariant cache hit.
[2023-03-13 19:56:30] [INFO ] State equation strengthened by 1787 read => feed constraints.
[2023-03-13 19:56:36] [INFO ] Implicit Places using invariants and state equation in 6459 ms returned []
Implicit Place search using SMT with State Equation took 7080 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1057/1126 places, 1975/2016 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8221 ms. Remains : 1057/1126 places, 1975/2016 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 209421 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209421 steps, saw 71499 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 19:56:39] [INFO ] Invariant cache hit.
[2023-03-13 19:56:39] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:56:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-13 19:56:40] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 19:56:40] [INFO ] After 707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:56:40] [INFO ] State equation strengthened by 1787 read => feed constraints.
[2023-03-13 19:56:41] [INFO ] After 686ms SMT Verify possible using 1787 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:56:42] [INFO ] After 1446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 495 ms.
[2023-03-13 19:56:42] [INFO ] After 2930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 38 ms.
Support contains 88 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 1975/1975 transitions.
Applied a total of 0 rules in 114 ms. Remains 1057 /1057 variables (removed 0) and now considering 1975/1975 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 1057/1057 places, 1975/1975 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 1975/1975 transitions.
Applied a total of 0 rules in 82 ms. Remains 1057 /1057 variables (removed 0) and now considering 1975/1975 (removed 0) transitions.
[2023-03-13 19:56:43] [INFO ] Invariant cache hit.
[2023-03-13 19:56:43] [INFO ] Implicit Places using invariants in 591 ms returned []
[2023-03-13 19:56:43] [INFO ] Invariant cache hit.
[2023-03-13 19:56:44] [INFO ] State equation strengthened by 1787 read => feed constraints.
[2023-03-13 19:56:51] [INFO ] Implicit Places using invariants and state equation in 7617 ms returned []
Implicit Place search using SMT with State Equation took 8212 ms to find 0 implicit places.
[2023-03-13 19:56:51] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-13 19:56:51] [INFO ] Invariant cache hit.
[2023-03-13 19:56:52] [INFO ] Dead Transitions using invariants and state equation in 828 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9259 ms. Remains : 1057/1057 places, 1975/1975 transitions.
Graph (trivial) has 1685 edges and 1057 vertex of which 575 / 1057 are part of one of the 20 SCC in 5 ms
Free SCC test removed 555 places
Drop transitions removed 1090 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 1099 transitions.
Graph (complete) has 1015 edges and 502 vertex of which 470 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 323 rules applied. Total rules applied 325 place count 470 transition count 552
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 1 with 518 rules applied. Total rules applied 843 place count 204 transition count 300
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 843 place count 204 transition count 297
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 849 place count 201 transition count 297
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 858 place count 192 transition count 287
Iterating global reduction 2 with 9 rules applied. Total rules applied 867 place count 192 transition count 287
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 872 place count 192 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 874 place count 191 transition count 281
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 880 place count 188 transition count 291
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 889 place count 188 transition count 282
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 913 place count 188 transition count 258
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 937 place count 164 transition count 258
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 939 place count 164 transition count 256
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 953 place count 164 transition count 256
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 962 place count 155 transition count 247
Iterating global reduction 4 with 9 rules applied. Total rules applied 971 place count 155 transition count 247
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 972 place count 155 transition count 246
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 973 place count 154 transition count 245
Iterating global reduction 4 with 1 rules applied. Total rules applied 974 place count 154 transition count 245
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 984 place count 144 transition count 235
Applied a total of 984 rules in 100 ms. Remains 144 /1057 variables (removed 913) and now considering 235/1975 (removed 1740) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 235 rows 144 cols
[2023-03-13 19:56:52] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 19:56:52] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:56:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-13 19:56:52] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 19:56:52] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:56:52] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-13 19:56:52] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:56:52] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-13 19:56:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1057 places, 1975 transitions and 7673 arcs took 16 ms.
[2023-03-13 19:56:52] [INFO ] Flatten gal took : 134 ms
Total runtime 48334 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: gen
(NrP: 1057 NrTr: 1975 NrArc: 7673)

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

net check time: 0m 0.000sec

init dd package: 0m 3.151sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9473428 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097232 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.008sec

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="CANConstruction-PT-030"
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 CANConstruction-PT-030, 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 r042-tajo-167813696000638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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