About the Execution of LTSMin+red for BridgeAndVehicles-PT-V04P05N02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
229.756 | 5494.00 | 11947.00 | 68.80 | FFFFFTFFTFTTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694300161.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 ltsminxred
Input is BridgeAndVehicles-PT-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694300161
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:03 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 4.3K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 12:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 12:05 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 37K 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-V04P05N02-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678611585931
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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V04P05N02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 08:59:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 08:59:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:59:47] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-12 08:59:47] [INFO ] Transformed 28 places.
[2023-03-12 08:59:47] [INFO ] Transformed 52 transitions.
[2023-03-12 08:59:47] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 90 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Applied a total of 0 rules in 7 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-12 08:59:47] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2023-03-12 08:59:47] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-12 08:59:47] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
[2023-03-12 08:59:47] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-12 08:59:47] [INFO ] Invariant cache hit.
[2023-03-12 08:59:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-12 08:59:47] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-12 08:59:47] [INFO ] Invariant cache hit.
[2023-03-12 08:59:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 08:59:48] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-12 08:59:48] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-12 08:59:48] [INFO ] Invariant cache hit.
[2023-03-12 08:59:48] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 28/28 places, 52/52 transitions.
Support contains 26 out of 28 places after structural reductions.
[2023-03-12 08:59:48] [INFO ] Flatten gal took : 21 ms
[2023-03-12 08:59:48] [INFO ] Flatten gal took : 8 ms
[2023-03-12 08:59:48] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 89) seen :42
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 47) seen :0
Running SMT prover for 47 properties.
[2023-03-12 08:59:49] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-12 08:59:49] [INFO ] Invariant cache hit.
[2023-03-12 08:59:49] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 08:59:49] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :15 sat :0 real:32
[2023-03-12 08:59:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-12 08:59:49] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :44 sat :3
[2023-03-12 08:59:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 08:59:49] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :44 sat :3
[2023-03-12 08:59:49] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :44 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 08:59:49] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :44 sat :3
Fused 47 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 146 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2023-03-12 08:59:49] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2023-03-12 08:59:49] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 08:59:49] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 26/28 places, 52/52 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 63 ms. (steps per millisecond=159 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 42 ms. (steps per millisecond=238 ) properties seen :0
Successfully simplified 47 atomic propositions for a total of 15 simplifications.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 08:59:50] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 6 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 11 ms
[2023-03-12 08:59:50] [INFO ] Input system was already deterministic with 52 transitions.
Support contains 20 out of 28 places (down from 23) after GAL structural reductions.
Computed a total of 19 stabilizing places and 20 stable transitions
Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 52
Applied a total of 1 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2023-03-12 08:59:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2023-03-12 08:59:50] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 08:59:50] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 27/28 places, 52/52 transitions.
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 4 ms
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 3 ms
[2023-03-12 08:59:50] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Applied a total of 2 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2023-03-12 08:59:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2023-03-12 08:59:50] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 08:59:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 26/28 places, 52/52 transitions.
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 4 ms
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 4 ms
[2023-03-12 08:59:50] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 7 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2023-03-12 08:59:50] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-12 08:59:50] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 08:59:50] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 25/28 places, 51/52 transitions.
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 4 ms
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 4 ms
[2023-03-12 08:59:50] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 51
Applied a total of 4 rules in 3 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2023-03-12 08:59:50] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-12 08:59:50] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 08:59:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 25/28 places, 51/52 transitions.
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 3 ms
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 3 ms
[2023-03-12 08:59:50] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Applied a total of 2 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2023-03-12 08:59:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2023-03-12 08:59:50] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 08:59:50] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 26/28 places, 52/52 transitions.
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 4 ms
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 3 ms
[2023-03-12 08:59:50] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 51
Applied a total of 4 rules in 2 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2023-03-12 08:59:50] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-12 08:59:50] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 08:59:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 25/28 places, 51/52 transitions.
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 3 ms
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 3 ms
[2023-03-12 08:59:50] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 52
Applied a total of 1 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2023-03-12 08:59:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2023-03-12 08:59:50] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 08:59:50] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 27/28 places, 52/52 transitions.
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 3 ms
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 3 ms
[2023-03-12 08:59:50] [INFO ] Input system was already deterministic with 52 transitions.
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 3 ms
[2023-03-12 08:59:50] [INFO ] Flatten gal took : 3 ms
[2023-03-12 08:59:50] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-12 08:59:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 28 places, 52 transitions and 326 arcs took 1 ms.
Total runtime 3111 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/509/ctl_0_ --ctl=/tmp/509/ctl_1_ --ctl=/tmp/509/ctl_2_ --ctl=/tmp/509/ctl_3_ --ctl=/tmp/509/ctl_4_ --ctl=/tmp/509/ctl_5_ --ctl=/tmp/509/ctl_6_ --mu-par --mu-opt
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678611591425
--------------------
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
mcc2023
ctl formula name BridgeAndVehicles-PT-V04P05N02-CTLCardinality-00
ctl formula formula --ctl=/tmp/509/ctl_0_
ctl formula name BridgeAndVehicles-PT-V04P05N02-CTLCardinality-02
ctl formula formula --ctl=/tmp/509/ctl_1_
ctl formula name BridgeAndVehicles-PT-V04P05N02-CTLCardinality-08
ctl formula formula --ctl=/tmp/509/ctl_2_
ctl formula name BridgeAndVehicles-PT-V04P05N02-CTLCardinality-09
ctl formula formula --ctl=/tmp/509/ctl_3_
ctl formula name BridgeAndVehicles-PT-V04P05N02-CTLCardinality-10
ctl formula formula --ctl=/tmp/509/ctl_4_
ctl formula name BridgeAndVehicles-PT-V04P05N02-CTLCardinality-14
ctl formula formula --ctl=/tmp/509/ctl_5_
ctl formula name BridgeAndVehicles-PT-V04P05N02-CTLCardinality-15
ctl formula formula --ctl=/tmp/509/ctl_6_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 28 places, 52 transitions and 326 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 52->44 groups
pnml2lts-sym: Regrouping took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 28; there are 44 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 8557 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.100 real 0.340 user 0.050 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 2874 states, 2660 nodes
pnml2lts-sym: Formula /tmp/509/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/509/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/509/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/509/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/509/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/509/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/509/ctl_5_ does not hold for the initial state
pnml2lts-sym: group_next: 560 nodes total
pnml2lts-sym: group_explored: 1075 nodes, 982 short vectors total
pnml2lts-sym: max token count: 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-V04P05N02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-PT-V04P05N02, 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 r041-tajo-167813694300161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 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 '
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 ;