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-167863540000425.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540000425
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME Parking-PT-416-CTLCardinality-01
FORMULA_NAME Parking-PT-416-CTLCardinality-02
FORMULA_NAME Parking-PT-416-CTLCardinality-03
FORMULA_NAME Parking-PT-416-CTLCardinality-04
FORMULA_NAME Parking-PT-416-CTLCardinality-05
FORMULA_NAME Parking-PT-416-CTLCardinality-06
FORMULA_NAME Parking-PT-416-CTLCardinality-07
FORMULA_NAME Parking-PT-416-CTLCardinality-08
FORMULA_NAME Parking-PT-416-CTLCardinality-09
FORMULA_NAME Parking-PT-416-CTLCardinality-10
FORMULA_NAME Parking-PT-416-CTLCardinality-11
FORMULA_NAME Parking-PT-416-CTLCardinality-12
FORMULA_NAME Parking-PT-416-CTLCardinality-13
FORMULA_NAME Parking-PT-416-CTLCardinality-14
FORMULA_NAME Parking-PT-416-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678996691822

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=Parking-PT-416
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 19:58:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 19:58:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:58:16] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2023-03-16 19:58:16] [INFO ] Transformed 305 places.
[2023-03-16 19:58:16] [INFO ] Transformed 433 transitions.
[2023-03-16 19:58:16] [INFO ] Found NUPN structural information;
[2023-03-16 19:58:16] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
FORMULA Parking-PT-416-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 302 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 302 transition count 254
Applied a total of 6 rules in 135 ms. Remains 302 /305 variables (removed 3) and now considering 254/257 (removed 3) transitions.
// Phase 1: matrix 254 rows 302 cols
[2023-03-16 19:58:16] [INFO ] Computed 76 place invariants in 26 ms
[2023-03-16 19:58:17] [INFO ] Implicit Places using invariants in 918 ms returned [48, 64, 72, 88, 90, 118, 126, 134, 158, 187, 195, 203, 211, 227, 229, 256, 264, 272, 296, 298]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 986 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 282/305 places, 254/257 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 272 transition count 244
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 272 transition count 244
Applied a total of 20 rules in 30 ms. Remains 272 /282 variables (removed 10) and now considering 244/254 (removed 10) transitions.
// Phase 1: matrix 244 rows 272 cols
[2023-03-16 19:58:17] [INFO ] Computed 56 place invariants in 6 ms
[2023-03-16 19:58:18] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-16 19:58:18] [INFO ] Invariant cache hit.
[2023-03-16 19:58:18] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 19:58:18] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 272/305 places, 244/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2426 ms. Remains : 272/305 places, 244/257 transitions.
Support contains 75 out of 272 places after structural reductions.
[2023-03-16 19:58:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-16 19:58:19] [INFO ] Flatten gal took : 127 ms
FORMULA Parking-PT-416-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 19:58:19] [INFO ] Flatten gal took : 48 ms
[2023-03-16 19:58:19] [INFO ] Input system was already deterministic with 244 transitions.
Support contains 59 out of 272 places (down from 75) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 849 ms. (steps per millisecond=11 ) properties (out of 35) seen :26
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
[2023-03-16 19:58:20] [INFO ] Invariant cache hit.
[2023-03-16 19:58:20] [INFO ] [Real]Absence check using 56 positive place invariants in 14 ms returned sat
[2023-03-16 19:58:20] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-16 19:58:21] [INFO ] [Nat]Absence check using 56 positive place invariants in 33 ms returned sat
[2023-03-16 19:58:21] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-16 19:58:21] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 19:58:21] [INFO ] After 183ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-16 19:58:22] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-16 19:58:22] [INFO ] After 1308ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 2 properties in 116 ms.
Support contains 7 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 244/244 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 272 transition count 236
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 264 transition count 236
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 264 transition count 228
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 256 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 253 transition count 225
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 253 transition count 225
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 68 place count 238 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 237 transition count 229
Free-agglomeration rule applied 54 times.
Iterating global reduction 2 with 54 rules applied. Total rules applied 124 place count 237 transition count 175
Reduce places removed 54 places and 0 transitions.
Graph (complete) has 406 edges and 183 vertex of which 137 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.2 ms
Discarding 46 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Iterating post reduction 2 with 55 rules applied. Total rules applied 179 place count 137 transition count 140
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 185 place count 137 transition count 134
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 137 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 189 place count 135 transition count 132
Applied a total of 189 rules in 153 ms. Remains 135 /272 variables (removed 137) and now considering 132/244 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 135/272 places, 132/244 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 132 rows 135 cols
[2023-03-16 19:58:22] [INFO ] Computed 44 place invariants in 4 ms
[2023-03-16 19:58:23] [INFO ] [Real]Absence check using 44 positive place invariants in 19 ms returned sat
[2023-03-16 19:58:23] [INFO ] After 168ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 19:58:23] [INFO ] State equation strengthened by 113 read => feed constraints.
[2023-03-16 19:58:23] [INFO ] After 61ms SMT Verify possible using 113 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:58:23] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:58:23] [INFO ] [Nat]Absence check using 44 positive place invariants in 18 ms returned sat
[2023-03-16 19:58:23] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:58:23] [INFO ] After 130ms SMT Verify possible using 113 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 19:58:23] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-16 19:58:23] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2023-03-16 19:58:23] [INFO ] Flatten gal took : 38 ms
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 59 ms
[2023-03-16 19:58:24] [INFO ] Input system was already deterministic with 244 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 43 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 41 ms
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 28 ms
[2023-03-16 19:58:24] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 16 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 34 ms
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 24 ms
[2023-03-16 19:58:24] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 269 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 269 transition count 241
Applied a total of 6 rules in 28 ms. Remains 269 /272 variables (removed 3) and now considering 241/244 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 269/272 places, 241/244 transitions.
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 22 ms
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 23 ms
[2023-03-16 19:58:24] [INFO ] Input system was already deterministic with 241 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 13 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 22 ms
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 22 ms
[2023-03-16 19:58:24] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 10 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 14 ms
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 14 ms
[2023-03-16 19:58:24] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 9 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 13 ms
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 13 ms
[2023-03-16 19:58:24] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 24 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 25 ms
[2023-03-16 19:58:24] [INFO ] Flatten gal took : 11 ms
[2023-03-16 19:58:24] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 9 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 11 ms
[2023-03-16 19:58:25] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 269 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 269 transition count 241
Applied a total of 6 rules in 12 ms. Remains 269 /272 variables (removed 3) and now considering 241/244 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 269/272 places, 241/244 transitions.
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 11 ms
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 12 ms
[2023-03-16 19:58:25] [INFO ] Input system was already deterministic with 241 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 271 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 263 transition count 235
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 263 transition count 227
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 32 place count 255 transition count 227
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 251 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 251 transition count 223
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 58 place count 242 transition count 214
Applied a total of 58 rules in 45 ms. Remains 242 /272 variables (removed 30) and now considering 214/244 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 242/272 places, 214/244 transitions.
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:58:25] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Reduce places removed 1 places and 1 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 271 transition count 236
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 264 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 263 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 263 transition count 228
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 256 transition count 228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 254 transition count 226
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 254 transition count 226
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 52 place count 245 transition count 217
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 245 transition count 217
Applied a total of 53 rules in 79 ms. Remains 245 /272 variables (removed 27) and now considering 217/244 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 245/272 places, 217/244 transitions.
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 13 ms
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 13 ms
[2023-03-16 19:58:25] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 14 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 13 ms
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 26 ms
[2023-03-16 19:58:25] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 244/244 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 272 transition count 237
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 265 transition count 237
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 265 transition count 230
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 258 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 255 transition count 227
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 255 transition count 227
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 50 place count 247 transition count 219
Applied a total of 50 rules in 66 ms. Remains 247 /272 variables (removed 25) and now considering 219/244 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 247/272 places, 219/244 transitions.
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 12 ms
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 13 ms
[2023-03-16 19:58:25] [INFO ] Input system was already deterministic with 219 transitions.
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 13 ms
[2023-03-16 19:58:25] [INFO ] Flatten gal took : 14 ms
[2023-03-16 19:58:25] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-16 19:58:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 272 places, 244 transitions and 812 arcs took 7 ms.
Total runtime 9827 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/479/ctl_0_ --ctl=/tmp/479/ctl_1_ --ctl=/tmp/479/ctl_2_ --ctl=/tmp/479/ctl_3_ --ctl=/tmp/479/ctl_4_ --ctl=/tmp/479/ctl_5_ --ctl=/tmp/479/ctl_6_ --ctl=/tmp/479/ctl_7_ --ctl=/tmp/479/ctl_8_ --ctl=/tmp/479/ctl_9_ --ctl=/tmp/479/ctl_10_ --ctl=/tmp/479/ctl_11_ --ctl=/tmp/479/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 16030200 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16096684 kB
Could not compute solution for formula : Parking-PT-416-CTLCardinality-00
Could not compute solution for formula : Parking-PT-416-CTLCardinality-01
Could not compute solution for formula : Parking-PT-416-CTLCardinality-02
Could not compute solution for formula : Parking-PT-416-CTLCardinality-04
Could not compute solution for formula : Parking-PT-416-CTLCardinality-05
Could not compute solution for formula : Parking-PT-416-CTLCardinality-06
Could not compute solution for formula : Parking-PT-416-CTLCardinality-08
Could not compute solution for formula : Parking-PT-416-CTLCardinality-09
Could not compute solution for formula : Parking-PT-416-CTLCardinality-10
Could not compute solution for formula : Parking-PT-416-CTLCardinality-11
Could not compute solution for formula : Parking-PT-416-CTLCardinality-12
Could not compute solution for formula : Parking-PT-416-CTLCardinality-13
Could not compute solution for formula : Parking-PT-416-CTLCardinality-15

BK_STOP 1679000278481

--------------------
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 Parking-PT-416-CTLCardinality-00
ctl formula formula --ctl=/tmp/479/ctl_0_
ctl formula name Parking-PT-416-CTLCardinality-01
ctl formula formula --ctl=/tmp/479/ctl_1_
ctl formula name Parking-PT-416-CTLCardinality-02
ctl formula formula --ctl=/tmp/479/ctl_2_
ctl formula name Parking-PT-416-CTLCardinality-04
ctl formula formula --ctl=/tmp/479/ctl_3_
ctl formula name Parking-PT-416-CTLCardinality-05
ctl formula formula --ctl=/tmp/479/ctl_4_
ctl formula name Parking-PT-416-CTLCardinality-06
ctl formula formula --ctl=/tmp/479/ctl_5_
ctl formula name Parking-PT-416-CTLCardinality-08
ctl formula formula --ctl=/tmp/479/ctl_6_
ctl formula name Parking-PT-416-CTLCardinality-09
ctl formula formula --ctl=/tmp/479/ctl_7_
ctl formula name Parking-PT-416-CTLCardinality-10
ctl formula formula --ctl=/tmp/479/ctl_8_
ctl formula name Parking-PT-416-CTLCardinality-11
ctl formula formula --ctl=/tmp/479/ctl_9_
ctl formula name Parking-PT-416-CTLCardinality-12
ctl formula formula --ctl=/tmp/479/ctl_10_
ctl formula name Parking-PT-416-CTLCardinality-13
ctl formula formula --ctl=/tmp/479/ctl_11_
ctl formula name Parking-PT-416-CTLCardinality-15
ctl formula formula --ctl=/tmp/479/ctl_12_
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 272 places, 244 transitions and 812 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.010 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: 244->191 groups
pnml2lts-sym: Regrouping took 0.090 real 0.090 user 0.000 sys
pnml2lts-sym: state vector length is 272; there are 191 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...
Killing (15) : 485
Killing (9) : 485

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="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 Parking-PT-416, 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 r265-smll-167863540000425"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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