Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 107K Mar 5 18:23 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 Parking-PT-416-CTLFireability-00
FORMULA_NAME Parking-PT-416-CTLFireability-01
FORMULA_NAME Parking-PT-416-CTLFireability-02
FORMULA_NAME Parking-PT-416-CTLFireability-03
FORMULA_NAME Parking-PT-416-CTLFireability-04
FORMULA_NAME Parking-PT-416-CTLFireability-05
FORMULA_NAME Parking-PT-416-CTLFireability-06
FORMULA_NAME Parking-PT-416-CTLFireability-07
FORMULA_NAME Parking-PT-416-CTLFireability-08
FORMULA_NAME Parking-PT-416-CTLFireability-09
FORMULA_NAME Parking-PT-416-CTLFireability-10
FORMULA_NAME Parking-PT-416-CTLFireability-11
FORMULA_NAME Parking-PT-416-CTLFireability-12
FORMULA_NAME Parking-PT-416-CTLFireability-13
FORMULA_NAME Parking-PT-416-CTLFireability-14
FORMULA_NAME Parking-PT-416-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678996780397

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-416
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 19:59:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 19:59:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:59:43] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-16 19:59:43] [INFO ] Transformed 305 places.
[2023-03-16 19:59:43] [INFO ] Transformed 433 transitions.
[2023-03-16 19:59:43] [INFO ] Found NUPN structural information;
[2023-03-16 19:59:43] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
Support contains 109 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 303 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 303 transition count 255
Applied a total of 4 rules in 85 ms. Remains 303 /305 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 303 cols
[2023-03-16 19:59:43] [INFO ] Computed 76 place invariants in 19 ms
[2023-03-16 19:59:44] [INFO ] Implicit Places using invariants in 712 ms returned []
[2023-03-16 19:59:44] [INFO ] Invariant cache hit.
[2023-03-16 19:59:44] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 19:59:44] [INFO ] Implicit Places using invariants and state equation in 630 ms returned [48, 64, 72, 88, 118, 142, 158, 187, 195, 203, 227, 229, 257, 273, 281, 297, 299]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 1389 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 286/305 places, 255/257 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 277 transition count 246
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 277 transition count 246
Applied a total of 18 rules in 15 ms. Remains 277 /286 variables (removed 9) and now considering 246/255 (removed 9) transitions.
// Phase 1: matrix 246 rows 277 cols
[2023-03-16 19:59:44] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-16 19:59:45] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-16 19:59:45] [INFO ] Invariant cache hit.
[2023-03-16 19:59:45] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 19:59:45] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 277/305 places, 246/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2049 ms. Remains : 277/305 places, 246/257 transitions.
Support contains 109 out of 277 places after structural reductions.
[2023-03-16 19:59:45] [INFO ] Flatten gal took : 88 ms
[2023-03-16 19:59:45] [INFO ] Flatten gal took : 46 ms
[2023-03-16 19:59:46] [INFO ] Input system was already deterministic with 246 transitions.
Support contains 105 out of 277 places (down from 109) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 899 ms. (steps per millisecond=11 ) properties (out of 60) seen :48
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-16 19:59:47] [INFO ] Invariant cache hit.
[2023-03-16 19:59:47] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 19:59:48] [INFO ] [Nat]Absence check using 59 positive place invariants in 41 ms returned sat
[2023-03-16 19:59:48] [INFO ] After 374ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-16 19:59:48] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 19:59:48] [INFO ] After 203ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :1 sat :11
[2023-03-16 19:59:49] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 6 ms to minimize.
[2023-03-16 19:59:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-16 19:59:49] [INFO ] After 627ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-03-16 19:59:49] [INFO ] After 1832ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 2 properties in 112 ms.
Support contains 21 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 246/246 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 277 transition count 240
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 271 transition count 240
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 271 transition count 234
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 265 transition count 234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 263 transition count 232
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 263 transition count 232
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 58 place count 248 transition count 217
Free-agglomeration rule applied 49 times.
Iterating global reduction 2 with 49 rules applied. Total rules applied 107 place count 248 transition count 168
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 156 place count 199 transition count 168
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 199 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 160 place count 197 transition count 166
Applied a total of 160 rules in 78 ms. Remains 197 /277 variables (removed 80) and now considering 166/246 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 197/277 places, 166/246 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 166 rows 197 cols
[2023-03-16 19:59:50] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-16 19:59:50] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 19:59:50] [INFO ] [Nat]Absence check using 59 positive place invariants in 18 ms returned sat
[2023-03-16 19:59:50] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 19:59:50] [INFO ] State equation strengthened by 124 read => feed constraints.
[2023-03-16 19:59:50] [INFO ] After 50ms SMT Verify possible using 124 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 19:59:50] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-16 19:59:50] [INFO ] After 390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 3 ms.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 166/166 transitions.
Graph (complete) has 396 edges and 197 vertex of which 149 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 36 output transitions
Drop transitions removed 36 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 149 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 147 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 11 place count 147 transition count 120
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 145 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 144 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 144 transition count 119
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 142 transition count 117
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 142 transition count 111
Reduce places removed 6 places and 0 transitions.
Graph (complete) has 271 edges and 136 vertex of which 88 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 37 output transitions
Drop transitions removed 37 transitions
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 88 transition count 74
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 38 place count 88 transition count 70
Applied a total of 38 rules in 32 ms. Remains 88 /197 variables (removed 109) and now considering 70/166 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 88/197 places, 70/166 transitions.
Finished random walk after 80 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=80 )
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-16 19:59:50] [INFO ] Flatten gal took : 27 ms
[2023-03-16 19:59:50] [INFO ] Flatten gal took : 23 ms
[2023-03-16 19:59:50] [INFO ] Input system was already deterministic with 246 transitions.
Support contains 99 out of 277 places (down from 103) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 13 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-16 19:59:50] [INFO ] Flatten gal took : 19 ms
[2023-03-16 19:59:50] [INFO ] Flatten gal took : 21 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 274 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 274 transition count 243
Applied a total of 6 rules in 14 ms. Remains 274 /277 variables (removed 3) and now considering 243/246 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 274/277 places, 243/246 transitions.
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 18 ms
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 19 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 14 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 16 ms
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 18 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 14 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 15 ms
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 36 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 15 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 15 ms
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 22 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 22 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 14 ms
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 21 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 12 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 12 ms
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 13 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 9 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 11 ms
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 26 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 25 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 11 ms
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 12 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 274 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 274 transition count 243
Applied a total of 6 rules in 11 ms. Remains 274 /277 variables (removed 3) and now considering 243/246 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 274/277 places, 243/246 transitions.
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 13 ms
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 14 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 277 transition count 239
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 270 transition count 239
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 270 transition count 232
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 263 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 259 transition count 228
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 259 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 52 place count 251 transition count 220
Applied a total of 52 rules in 51 ms. Remains 251 /277 variables (removed 26) and now considering 220/246 (removed 26) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 251/277 places, 220/246 transitions.
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 9 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:59:51] [INFO ] Flatten gal took : 11 ms
[2023-03-16 19:59:51] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 274 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 274 transition count 243
Applied a total of 6 rules in 9 ms. Remains 274 /277 variables (removed 3) and now considering 243/246 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 274/277 places, 243/246 transitions.
[2023-03-16 19:59:52] [INFO ] Flatten gal took : 11 ms
[2023-03-16 19:59:52] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:59:52] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 275 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 275 transition count 244
Applied a total of 4 rules in 7 ms. Remains 275 /277 variables (removed 2) and now considering 244/246 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 275/277 places, 244/246 transitions.
[2023-03-16 19:59:52] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:59:52] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:59:52] [INFO ] Input system was already deterministic with 244 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 10 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-16 19:59:52] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:59:52] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:59:52] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 277 transition count 239
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 270 transition count 239
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 270 transition count 232
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 263 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 259 transition count 228
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 259 transition count 228
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 50 place count 252 transition count 221
Applied a total of 50 rules in 48 ms. Remains 252 /277 variables (removed 25) and now considering 221/246 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 252/277 places, 221/246 transitions.
[2023-03-16 19:59:52] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:59:52] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:59:52] [INFO ] Input system was already deterministic with 221 transitions.
[2023-03-16 19:59:52] [INFO ] Flatten gal took : 12 ms
[2023-03-16 19:59:52] [INFO ] Flatten gal took : 12 ms
[2023-03-16 19:59:52] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2023-03-16 19:59:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 246 transitions and 831 arcs took 5 ms.
Total runtime 9183 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/489/ctl_0_ --ctl=/tmp/489/ctl_1_ --ctl=/tmp/489/ctl_2_ --ctl=/tmp/489/ctl_3_ --ctl=/tmp/489/ctl_4_ --ctl=/tmp/489/ctl_5_ --ctl=/tmp/489/ctl_6_ --ctl=/tmp/489/ctl_7_ --ctl=/tmp/489/ctl_8_ --ctl=/tmp/489/ctl_9_ --ctl=/tmp/489/ctl_10_ --ctl=/tmp/489/ctl_11_ --ctl=/tmp/489/ctl_12_ --ctl=/tmp/489/ctl_13_ --ctl=/tmp/489/ctl_14_ --ctl=/tmp/489/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 16030372 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097388 kB
Could not compute solution for formula : Parking-PT-416-CTLFireability-00
Could not compute solution for formula : Parking-PT-416-CTLFireability-01
Could not compute solution for formula : Parking-PT-416-CTLFireability-02
Could not compute solution for formula : Parking-PT-416-CTLFireability-03
Could not compute solution for formula : Parking-PT-416-CTLFireability-04
Could not compute solution for formula : Parking-PT-416-CTLFireability-05
Could not compute solution for formula : Parking-PT-416-CTLFireability-06
Could not compute solution for formula : Parking-PT-416-CTLFireability-07
Could not compute solution for formula : Parking-PT-416-CTLFireability-08
Could not compute solution for formula : Parking-PT-416-CTLFireability-09
Could not compute solution for formula : Parking-PT-416-CTLFireability-10
Could not compute solution for formula : Parking-PT-416-CTLFireability-11
Could not compute solution for formula : Parking-PT-416-CTLFireability-12
Could not compute solution for formula : Parking-PT-416-CTLFireability-13
Could not compute solution for formula : Parking-PT-416-CTLFireability-14
Could not compute solution for formula : Parking-PT-416-CTLFireability-15

BK_STOP 1679000365058

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name Parking-PT-416-CTLFireability-00
ctl formula formula --ctl=/tmp/489/ctl_0_
ctl formula name Parking-PT-416-CTLFireability-01
ctl formula formula --ctl=/tmp/489/ctl_1_
ctl formula name Parking-PT-416-CTLFireability-02
ctl formula formula --ctl=/tmp/489/ctl_2_
ctl formula name Parking-PT-416-CTLFireability-03
ctl formula formula --ctl=/tmp/489/ctl_3_
ctl formula name Parking-PT-416-CTLFireability-04
ctl formula formula --ctl=/tmp/489/ctl_4_
ctl formula name Parking-PT-416-CTLFireability-05
ctl formula formula --ctl=/tmp/489/ctl_5_
ctl formula name Parking-PT-416-CTLFireability-06
ctl formula formula --ctl=/tmp/489/ctl_6_
ctl formula name Parking-PT-416-CTLFireability-07
ctl formula formula --ctl=/tmp/489/ctl_7_
ctl formula name Parking-PT-416-CTLFireability-08
ctl formula formula --ctl=/tmp/489/ctl_8_
ctl formula name Parking-PT-416-CTLFireability-09
ctl formula formula --ctl=/tmp/489/ctl_9_
ctl formula name Parking-PT-416-CTLFireability-10
ctl formula formula --ctl=/tmp/489/ctl_10_
ctl formula name Parking-PT-416-CTLFireability-11
ctl formula formula --ctl=/tmp/489/ctl_11_
ctl formula name Parking-PT-416-CTLFireability-12
ctl formula formula --ctl=/tmp/489/ctl_12_
ctl formula name Parking-PT-416-CTLFireability-13
ctl formula formula --ctl=/tmp/489/ctl_13_
ctl formula name Parking-PT-416-CTLFireability-14
ctl formula formula --ctl=/tmp/489/ctl_14_
ctl formula name Parking-PT-416-CTLFireability-15
ctl formula formula --ctl=/tmp/489/ctl_15_
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 277 places, 246 transitions and 831 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 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: 246->192 groups
pnml2lts-sym: Regrouping took 0.060 real 0.060 user 0.000 sys
pnml2lts-sym: state vector length is 277; there are 192 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: 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: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
Killing (15) : 495
Killing (9) : 495

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="Parking-PT-416"
export BK_EXAMINATION="CTLFireability"
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 Parking-PT-416, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540000426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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