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-167813695600295.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 BridgeAndVehicles-PT-V80P20N50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695600295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 25K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Feb 25 12:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.3M Feb 25 12:58 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 9.3K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 743K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Feb 25 14:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 261K Feb 25 14:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3M Feb 25 14:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.5M Feb 25 14:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.1M 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 BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678708289232

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N50
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 11:51:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 11:51:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:51:31] [INFO ] Load time of PNML (sax parser for PT used): 349 ms
[2023-03-13 11:51:31] [INFO ] Transformed 228 places.
[2023-03-13 11:51:31] [INFO ] Transformed 8588 transitions.
[2023-03-13 11:51:31] [INFO ] Parsed PT model containing 228 places and 8588 transitions and 67470 arcs in 474 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 176 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 2104 ms. (steps per millisecond=4 ) properties (out of 14) seen :5
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 3159 ms. (steps per millisecond=3 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 665 ms. (steps per millisecond=15 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-13 11:51:41] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 228 cols
[2023-03-13 11:51:41] [INFO ] Computed 7 place invariants in 31 ms
[2023-03-13 11:51:47] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-13 11:51:47] [INFO ] After 596ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-13 11:51:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 11:51:48] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :4
[2023-03-13 11:51:48] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 11:51:49] [INFO ] After 1190ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :5 sat :4
[2023-03-13 11:51:52] [INFO ] After 3929ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :4
Attempting to minimize the solution found.
Minimization took 1984 ms.
[2023-03-13 11:51:54] [INFO ] After 6964ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :4
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 143 ms.
Support contains 38 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Graph (complete) has 2202 edges and 228 vertex of which 226 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.33 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 225 transition count 8587
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 223 transition count 8586
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 73 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 221 transition count 8584
Applied a total of 10 rules in 3492 ms. Remains 221 /228 variables (removed 7) and now considering 8584/8588 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3496 ms. Remains : 221/228 places, 8584/8588 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :1
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 11:51:59] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 221 cols
[2023-03-13 11:51:59] [INFO ] Computed 4 place invariants in 13 ms
[2023-03-13 11:51:59] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-13 11:51:59] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 11:51:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 11:52:00] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 11:52:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 11:52:01] [INFO ] After 1016ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 11:52:01] [INFO ] After 1585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-13 11:52:02] [INFO ] After 2237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 81 ms.
Support contains 10 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2571 ms. Remains 221 /221 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2572 ms. Remains : 221/221 places, 8584/8584 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 70799 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70799 steps, saw 24786 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 11:52:08] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-13 11:52:08] [INFO ] Invariant cache hit.
[2023-03-13 11:52:08] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-13 11:52:09] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 11:52:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-13 11:52:09] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 11:52:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 11:52:10] [INFO ] After 1267ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 11:52:11] [INFO ] After 1825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 271 ms.
[2023-03-13 11:52:11] [INFO ] After 2652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 76 ms.
Support contains 10 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2788 ms. Remains 221 /221 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2788 ms. Remains : 221/221 places, 8584/8584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2780 ms. Remains 221 /221 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-13 11:52:17] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-13 11:52:17] [INFO ] Invariant cache hit.
[2023-03-13 11:52:18] [INFO ] Implicit Places using invariants in 747 ms returned []
[2023-03-13 11:52:18] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-13 11:52:18] [INFO ] Invariant cache hit.
[2023-03-13 11:52:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 11:52:21] [INFO ] Implicit Places using invariants and state equation in 3606 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4384 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2829 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9995 ms. Remains : 219/221 places, 8584/8584 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 76255 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76255 steps, saw 26632 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 11:52:28] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2023-03-13 11:52:28] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-13 11:52:28] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-13 11:52:28] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 11:52:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 11:52:29] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 11:52:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 11:52:30] [INFO ] After 943ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 11:52:30] [INFO ] After 1686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 488 ms.
[2023-03-13 11:52:31] [INFO ] After 2501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 68 ms.
Support contains 10 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2675 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2675 ms. Remains : 219/219 places, 8584/8584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2702 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-13 11:52:36] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-13 11:52:36] [INFO ] Invariant cache hit.
[2023-03-13 11:52:37] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-13 11:52:37] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-13 11:52:37] [INFO ] Invariant cache hit.
[2023-03-13 11:52:38] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
[2023-03-13 11:52:39] [INFO ] Redundant transitions in 1165 ms returned []
[2023-03-13 11:52:39] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-13 11:52:39] [INFO ] Invariant cache hit.
[2023-03-13 11:52:42] [INFO ] Dead Transitions using invariants and state equation in 2458 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8160 ms. Remains : 219/219 places, 8584/8584 transitions.
Ensure Unique test removed 8058 transitions
Reduce isomorphic transitions removed 8058 transitions.
Iterating post reduction 0 with 8058 rules applied. Total rules applied 8058 place count 219 transition count 526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8060 place count 219 transition count 524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8062 place count 217 transition count 524
Applied a total of 8062 rules in 27 ms. Remains 217 /219 variables (removed 2) and now considering 524/8584 (removed 8060) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 524 rows 217 cols
[2023-03-13 11:52:42] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-13 11:52:42] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-13 11:52:42] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 11:52:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 11:52:42] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 11:52:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 11:52:42] [INFO ] After 53ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 11:52:42] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-13 11:52:42] [INFO ] After 457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 11:52:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-13 11:52:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 8584 transitions and 66814 arcs took 79 ms.
[2023-03-13 11:52:43] [INFO ] Flatten gal took : 570 ms
Total runtime 73141 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BridgeAndVehicles_PT_V80P20N50
(NrP: 219 NrTr: 8584 NrArc: 66814)

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

net check time: 0m 0.013sec

init dd package: 0m 3.344sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10447704 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16058716 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 ReachabilityFireability -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.027sec

11722 14439 17347 19849 21954 23535 27022 25743 24096 26013 26488 476955 1773691

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="BridgeAndVehicles-PT-V80P20N50"
export BK_EXAMINATION="ReachabilityFireability"
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 BridgeAndVehicles-PT-V80P20N50, examination is ReachabilityFireability"
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-167813695600295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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