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-167813695400193.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-V20P10N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695400193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Feb 25 12:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 12:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 347K Feb 25 12:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:12 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 7.6K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 211K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 641K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 728K Feb 25 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Feb 25 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:35 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 1.8M 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-V20P10N50-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678699900589

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N50
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:31:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:31:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:31:45] [INFO ] Load time of PNML (sax parser for PT used): 279 ms
[2023-03-13 09:31:45] [INFO ] Transformed 108 places.
[2023-03-13 09:31:45] [INFO ] Transformed 2228 transitions.
[2023-03-13 09:31:45] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Support contains 56 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 51 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-13 09:31:45] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2023-03-13 09:31:45] [INFO ] Computed 7 place invariants in 12 ms
[2023-03-13 09:31:50] [INFO ] Dead Transitions using invariants and state equation in 5077 ms found 0 transitions.
[2023-03-13 09:31:50] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-13 09:31:50] [INFO ] Invariant cache hit.
[2023-03-13 09:31:50] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-13 09:31:50] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-13 09:31:50] [INFO ] Invariant cache hit.
[2023-03-13 09:31:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 09:31:53] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2596 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 27 ms. Remains 107 /107 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7852 ms. Remains : 107/108 places, 2228/2228 transitions.
Support contains 56 out of 107 places after structural reductions.
[2023-03-13 09:31:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 09:31:53] [INFO ] Flatten gal took : 256 ms
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:31:53] [INFO ] Flatten gal took : 151 ms
[2023-03-13 09:31:54] [INFO ] Input system was already deterministic with 2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 680 ms. (steps per millisecond=14 ) properties (out of 68) seen :19
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Running SMT prover for 48 properties.
[2023-03-13 09:31:55] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2023-03-13 09:31:55] [INFO ] Computed 6 place invariants in 18 ms
[2023-03-13 09:31:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-13 09:31:56] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0 real:39
[2023-03-13 09:31:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-13 09:31:56] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :43 sat :5
[2023-03-13 09:31:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 09:31:56] [INFO ] After 143ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :43 sat :5
[2023-03-13 09:31:57] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :43 sat :5
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-13 09:31:57] [INFO ] After 974ms SMT Verify possible using all constraints in natural domain returned unsat :43 sat :5
Fused 48 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 9 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 2228/2228 transitions.
Graph (complete) has 838 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 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 104 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 104 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 100 transition count 2224
Applied a total of 10 rules in 579 ms. Remains 100 /107 variables (removed 7) and now considering 2224/2228 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 580 ms. Remains : 100/107 places, 2224/2228 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 229063 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229063 steps, saw 65852 distinct states, run finished after 3004 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 09:32:01] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 100 cols
[2023-03-13 09:32:01] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-13 09:32:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 09:32:01] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-13 09:32:01] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 09:32:01] [INFO ] After 48ms SMT Verify possible using 102 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:32:01] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:32:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 09:32:02] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 09:32:02] [INFO ] After 119ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 09:32:02] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-13 09:32:02] [INFO ] After 670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 9 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2224/2224 transitions.
Applied a total of 0 rules in 258 ms. Remains 100 /100 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 100/100 places, 2224/2224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2224/2224 transitions.
Applied a total of 0 rules in 316 ms. Remains 100 /100 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2023-03-13 09:32:03] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-13 09:32:03] [INFO ] Invariant cache hit.
[2023-03-13 09:32:03] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-13 09:32:03] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-13 09:32:03] [INFO ] Invariant cache hit.
[2023-03-13 09:32:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 09:32:04] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1455 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/100 places, 2224/2224 transitions.
Applied a total of 0 rules in 248 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2021 ms. Remains : 99/100 places, 2224/2224 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 225396 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 225396 steps, saw 64890 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 09:32:08] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2023-03-13 09:32:08] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-13 09:32:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 09:32:08] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:32:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 09:32:09] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 09:32:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 09:32:09] [INFO ] After 117ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 09:32:09] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-13 09:32:09] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 35 ms.
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 201 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 99/99 places, 2224/2224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 194 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2023-03-13 09:32:09] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-13 09:32:09] [INFO ] Invariant cache hit.
[2023-03-13 09:32:10] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-13 09:32:10] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-13 09:32:10] [INFO ] Invariant cache hit.
[2023-03-13 09:32:10] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
[2023-03-13 09:32:10] [INFO ] Redundant transitions in 169 ms returned []
[2023-03-13 09:32:10] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-13 09:32:10] [INFO ] Invariant cache hit.
[2023-03-13 09:32:11] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2149 ms. Remains : 99/99 places, 2224/2224 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 99 transition count 286
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 99 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 97 transition count 284
Applied a total of 1942 rules in 13 ms. Remains 97 /99 variables (removed 2) and now considering 284/2224 (removed 1940) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 284 rows 97 cols
[2023-03-13 09:32:11] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-13 09:32:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 09:32:11] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-13 09:32:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 09:32:11] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:32:11] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:32:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 09:32:12] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 09:32:12] [INFO ] After 34ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 09:32:12] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-13 09:32:12] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Successfully simplified 43 atomic propositions for a total of 15 simplifications.
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:32:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 09:32:12] [INFO ] Flatten gal took : 80 ms
[2023-03-13 09:32:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:32:12] [INFO ] Flatten gal took : 76 ms
[2023-03-13 09:32:12] [INFO ] Input system was already deterministic with 2228 transitions.
Support contains 20 out of 107 places (down from 25) after GAL structural reductions.
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 50 stabilizing places and 84 stable transitions
Graph (complete) has 3146 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.27 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 2228/2228 transitions.
Applied a total of 0 rules in 569 ms. Remains 107 /107 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-13 09:32:13] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2023-03-13 09:32:13] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-13 09:32:13] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1302 ms. Remains : 107/107 places, 2228/2228 transitions.
[2023-03-13 09:32:14] [INFO ] Flatten gal took : 58 ms
[2023-03-13 09:32:14] [INFO ] Flatten gal took : 66 ms
[2023-03-13 09:32:14] [INFO ] Input system was already deterministic with 2228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2228
Applied a total of 2 rules in 8 ms. Remains 105 /107 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
[2023-03-13 09:32:14] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-13 09:32:14] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-13 09:32:14] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 628 ms. Remains : 105/107 places, 2228/2228 transitions.
[2023-03-13 09:32:14] [INFO ] Flatten gal took : 55 ms
[2023-03-13 09:32:15] [INFO ] Flatten gal took : 62 ms
[2023-03-13 09:32:15] [INFO ] Input system was already deterministic with 2228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 2228/2228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 2228
Applied a total of 1 rules in 9 ms. Remains 106 /107 variables (removed 1) and now considering 2228/2228 (removed 0) transitions.
[2023-03-13 09:32:15] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-13 09:32:15] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-13 09:32:15] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 699 ms. Remains : 106/107 places, 2228/2228 transitions.
[2023-03-13 09:32:15] [INFO ] Flatten gal took : 56 ms
[2023-03-13 09:32:16] [INFO ] Flatten gal took : 62 ms
[2023-03-13 09:32:16] [INFO ] Input system was already deterministic with 2228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2228
Applied a total of 2 rules in 10 ms. Remains 105 /107 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
[2023-03-13 09:32:16] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-13 09:32:16] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-13 09:32:16] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 746 ms. Remains : 105/107 places, 2228/2228 transitions.
[2023-03-13 09:32:16] [INFO ] Flatten gal took : 44 ms
[2023-03-13 09:32:17] [INFO ] Flatten gal took : 52 ms
[2023-03-13 09:32:17] [INFO ] Input system was already deterministic with 2228 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 2228/2228 transitions.
Graph (complete) has 3146 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 205 ms. Remains 105 /107 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
[2023-03-13 09:32:17] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-13 09:32:17] [INFO ] Invariant cache hit.
[2023-03-13 09:32:18] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 946 ms. Remains : 105/107 places, 2228/2228 transitions.
[2023-03-13 09:32:18] [INFO ] Flatten gal took : 44 ms
[2023-03-13 09:32:18] [INFO ] Flatten gal took : 50 ms
[2023-03-13 09:32:18] [INFO ] Input system was already deterministic with 2228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 104 transition count 2227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 104 transition count 2227
Applied a total of 4 rules in 15 ms. Remains 104 /107 variables (removed 3) and now considering 2227/2228 (removed 1) transitions.
[2023-03-13 09:32:18] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2023-03-13 09:32:18] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-13 09:32:19] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 761 ms. Remains : 104/107 places, 2227/2228 transitions.
[2023-03-13 09:32:19] [INFO ] Flatten gal took : 66 ms
[2023-03-13 09:32:19] [INFO ] Flatten gal took : 63 ms
[2023-03-13 09:32:19] [INFO ] Input system was already deterministic with 2227 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 104 transition count 2227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 104 transition count 2227
Applied a total of 4 rules in 16 ms. Remains 104 /107 variables (removed 3) and now considering 2227/2228 (removed 1) transitions.
[2023-03-13 09:32:19] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-13 09:32:19] [INFO ] Invariant cache hit.
[2023-03-13 09:32:20] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 104/107 places, 2227/2228 transitions.
[2023-03-13 09:32:20] [INFO ] Flatten gal took : 52 ms
[2023-03-13 09:32:20] [INFO ] Flatten gal took : 60 ms
[2023-03-13 09:32:20] [INFO ] Input system was already deterministic with 2227 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 104 transition count 2227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 104 transition count 2227
Applied a total of 4 rules in 15 ms. Remains 104 /107 variables (removed 3) and now considering 2227/2228 (removed 1) transitions.
[2023-03-13 09:32:20] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-13 09:32:20] [INFO ] Invariant cache hit.
[2023-03-13 09:32:21] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 775 ms. Remains : 104/107 places, 2227/2228 transitions.
[2023-03-13 09:32:21] [INFO ] Flatten gal took : 50 ms
[2023-03-13 09:32:21] [INFO ] Flatten gal took : 69 ms
[2023-03-13 09:32:21] [INFO ] Input system was already deterministic with 2227 transitions.
[2023-03-13 09:32:21] [INFO ] Flatten gal took : 54 ms
[2023-03-13 09:32:21] [INFO ] Flatten gal took : 58 ms
[2023-03-13 09:32:21] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 09:32:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 2228 transitions and 17149 arcs took 18 ms.
Total runtime 36995 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 107 NrTr: 2228 NrArc: 17149)

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

net check time: 0m 0.002sec

init dd package: 0m 3.074sec


RS generation: 2m 2.130sec


-> reachability set: #nodes 460734 (4.6e+05) #states 9,080,862 (6)



starting MCC model checker
--------------------------

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 9,080,862 (6)
.-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.100sec

checking: EF [~ [A [AX [1<=0] U p51<=p0]]]
normalized: E [true U ~ [[~ [E [~ [p51<=p0] U [EX [~ [1<=0]] & ~ [p51<=p0]]]] & ~ [EG [~ [p51<=p0]]]]]]

abstracting: (p51<=p0)
states: 7,790,210 (6)
................................................................................
EG iterations: 80
abstracting: (p51<=p0)
states: 7,790,210 (6)
abstracting: (1<=0)
states: 0
.abstracting: (p51<=p0)
states: 7,790,210 (6)

before gc: list nodes free: 321046

after gc: idd nodes used:843512, unused:63156488; list nodes free:297638880
MC time: 8m12.000sec

checking: [AX [p29<=p103] | AX [1<=0]]
normalized: [~ [EX [~ [1<=0]]] | ~ [EX [~ [p29<=p103]]]]

abstracting: (p29<=p103)
states: 8,145,831 (6)
.abstracting: (1<=0)
states: 0

before gc: list nodes free: 1233843

after gc: idd nodes used:622246, unused:63377754; list nodes free:313401972
.-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m52.312sec

checking: EF [[EG [~ [p51<=1]] & ~ [sum(p26, p25)<=p22]]]
normalized: E [true U [EG [~ [p51<=1]] & ~ [sum(p26, p25)<=p22]]]

abstracting: (sum(p26, p25)<=p22)
states: 6,599,061 (6)
abstracting: (p51<=1)
states: 6,029,142 (6)
................................................................................................
EG iterations: 96
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m43.331sec

checking: AG [[AF [EX [EG [1<=sum(p26, p25)]]] & [EG [AF [~ [1<=p54]]] & EF [[AF [p48<=19] | 1<=p54]]]]]
normalized: ~ [E [true U ~ [[[E [true U [1<=p54 | ~ [EG [~ [p48<=19]]]]] & EG [~ [EG [1<=p54]]]] & ~ [EG [~ [EX [EG [1<=sum(p26, p25)]]]]]]]]]

abstracting: (1<=sum(p26, p25))
states: 4,218,921 (6)
..............
before gc: list nodes free: 8657393

after gc: idd nodes used:1452793, unused:62547207; list nodes free:309138472
...........MC time: 8m31.008sec

checking: EG [[[EG [EX [0<=0]] | sum(p53, p52)<=p22] | AX [EF [p24<=p48]]]]
normalized: EG [[~ [EX [~ [E [true U p24<=p48]]]] | [sum(p53, p52)<=p22 | EG [EX [0<=0]]]]]

abstracting: (0<=0)
states: 9,080,862 (6)
...........................................MC time: 6m48.499sec

checking: A [~ [AG [[20<=p54 & p51<=p48]]] U [p23<=1 & EG [~ [[sum(p26, p25)<=48 & 1<=sum(p26, p25)]]]]]
normalized: [~ [EG [~ [[p23<=1 & EG [~ [[sum(p26, p25)<=48 & 1<=sum(p26, p25)]]]]]]] & ~ [E [~ [[p23<=1 & EG [~ [[sum(p26, p25)<=48 & 1<=sum(p26, p25)]]]]] U [~ [E [true U ~ [[20<=p54 & p51<=p48]]]] & ~ [[p23<=1 & EG [~ [[sum(p26, p25)<=48 & 1<=sum(p26, p25)]]]]]]]]]

abstracting: (1<=sum(p26, p25))
states: 4,218,921 (6)
abstracting: (sum(p26, p25)<=48)
states: 9,080,862 (6)
...........
before gc: list nodes free: 2574695

after gc: idd nodes used:1709278, unused:62290722; list nodes free:307169164
.........MC time: 5m27.000sec

checking: E [[~ [EX [p100<=p43]] & AF [EX [0<=0]]] U E [~ [AF [AX [p84<=p83]]] U AX [[AF [p0<=p74] & p35<=p33]]]]
normalized: E [[~ [EG [~ [EX [0<=0]]]] & ~ [EX [p100<=p43]]] U E [EG [EX [~ [p84<=p83]]] U ~ [EX [~ [[p35<=p33 & ~ [EG [~ [p0<=p74]]]]]]]]]

abstracting: (p0<=p74)
states: 1,139,895 (6)
............................MC time: 4m21.372sec

checking: EF [~ [A [AX [1<=0] U p51<=p0]]]
normalized: E [true U ~ [[~ [EG [~ [p51<=p0]]] & ~ [E [~ [p51<=p0] U [EX [~ [1<=0]] & ~ [p51<=p0]]]]]]]

abstracting: (p51<=p0)
states: 7,790,210 (6)
abstracting: (1<=0)
states: 0
.abstracting: (p51<=p0)
states: 7,790,210 (6)
abstracting: (p51<=p0)
states: 7,790,210 (6)
.................................................
before gc: list nodes free: 8348814

after gc: idd nodes used:1527632, unused:62472368; list nodes free:309178494
...............................
EG iterations: 80

before gc: list nodes free: 6220216

after gc: idd nodes used:1417969, unused:62582031; list nodes free:309821911

before gc: list nodes free: 4710799

after gc: idd nodes used:1351578, unused:62648422; list nodes free:310154932
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5717972 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16089472 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

26484 55515 62834 63132 63589 64179 64462 65044 65578 65931 66376 66854 67312 67642 68054 68448 68674 68927 68691 68329 68690 67687 67179 66828 66512 66285 66086 65949 66504 65674 65369 65179 65062 64982 65013 64732 64596 64510 64429 64701 64331 64280 64122 64096 64027 63948 63931 63860 63883 63790 63932 63715 63680 63646 63624 63589 63555 63518 63484 63454 63426 63400
iterations count:6284279 (2820), effective:16863 (7)

initing FirstDep: 0m 0.002sec


iterations count:2228 (1), effective:0 (0)
219667 223171 226416 229114 232074 235203 238302 242495 244050 245485 247015 248544 252571 254161 255549 257074 258634 261588 264219 265682 267162 268746 270529 274361 275885 277295 278882 280653 284471 286040 287533 289095 290800 294335 296353 297858 299358 301049 303035 306648 308143 309745 311429 313363 317021 318700 320210 321925 323823
sat_reach.icc:155: Timeout: after 491 sec


net_ddint.h:600: Timeout: after 510 sec


net_ddint.h:600: Timeout: after 407 sec


net_ddint.h:600: Timeout: after 326 sec


net_ddint.h:600: Timeout: after 260 sec


iterations count:2228 (1), effective:0 (0)
219667 223171 226416 229114 232074 235203 238302 242495 244050 245485 247015 248544 252571 254161 255549 257074 258634 261588 264219 265682 267162 268746 270529 274361 275885 277295 278882 280653 284471 286040 287533 289095 290800 294335 296353 297858 299358 301049 303035 306648 308143 309745 311429 313363 317021 318700 320210 321925 323823 325643 329234 330635 332367 334356 336153 339877 341385 343091 345017 346939 350271 352166 353924 355825 357782 359698 363117 364934 366771 368707 370663 374141 375897 377912 379832 381734 383699 387032 389054 391141 393021 394990 398485 400586 402409 404518 406600 409959 412108 414192 416225 418318 420378 423919 426189 428186 430259 432337 435971 438271 440424 442507 444573 446727 451031 453343 455466 457534 459717
iterations count:10947676 (4913), effective:11635 (5)

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-V20P10N50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is BridgeAndVehicles-PT-V20P10N50, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695400193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N50.tgz
mv BridgeAndVehicles-PT-V20P10N50 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;