fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813597900450
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutoFlight-PT-06a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7585.760 90833.00 344990.00 77.80 TTTTFTTFFFFTTTFT normal

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.r009-oct2-167813597900450.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597900450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 43K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-00
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-01
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-02
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-03
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-04
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-05
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-06
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-07
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-08
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-09
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-10
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-11
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-12
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-13
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-14
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678629364165

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=AutoFlight-PT-06a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:56:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 13:56:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:56:08] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-12 13:56:08] [INFO ] Transformed 157 places.
[2023-03-12 13:56:08] [INFO ] Transformed 155 transitions.
[2023-03-12 13:56:08] [INFO ] Found NUPN structural information;
[2023-03-12 13:56:08] [INFO ] Parsed PT model containing 157 places and 155 transitions and 500 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
Support contains 77 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 125/125 transitions.
Applied a total of 0 rules in 44 ms. Remains 157 /157 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 157 cols
[2023-03-12 13:56:08] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-12 13:56:09] [INFO ] Implicit Places using invariants in 849 ms returned [35, 42, 45, 60, 118, 124, 142, 148, 154]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 937 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/157 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 984 ms. Remains : 148/157 places, 125/125 transitions.
Support contains 77 out of 148 places after structural reductions.
[2023-03-12 13:56:09] [INFO ] Flatten gal took : 61 ms
[2023-03-12 13:56:09] [INFO ] Flatten gal took : 13 ms
[2023-03-12 13:56:09] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 254 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 60) seen :44
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 125 rows 148 cols
[2023-03-12 13:56:10] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-12 13:56:10] [INFO ] [Real]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-12 13:56:11] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 13:56:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 47 ms returned sat
[2023-03-12 13:56:11] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2023-03-12 13:56:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 13:56:12] [INFO ] After 162ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :2 sat :12
[2023-03-12 13:56:12] [INFO ] After 531ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-12 13:56:12] [INFO ] After 1515ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 9 properties in 42 ms.
Support contains 9 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 44 place count 126 transition count 92
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 66 place count 115 transition count 92
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 111 transition count 88
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 111 transition count 88
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 86 place count 105 transition count 82
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 94 place count 105 transition count 74
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 102 place count 97 transition count 74
Applied a total of 102 rules in 42 ms. Remains 97 /148 variables (removed 51) and now considering 74/125 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 97/148 places, 74/125 transitions.
Incomplete random walk after 10000 steps, including 395 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 97 cols
[2023-03-12 13:56:12] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-12 13:56:13] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-12 13:56:13] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:56:13] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-12 13:56:13] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:56:13] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-12 13:56:13] [INFO ] After 34ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:56:13] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 13:56:13] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 14 ms
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 7 ms
[2023-03-12 13:56:13] [INFO ] Input system was already deterministic with 125 transitions.
Computed a total of 9 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 19 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 6 ms
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 18 ms
[2023-03-12 13:56:13] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 4 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 5 ms
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 18 ms
[2023-03-12 13:56:13] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 126 transition count 91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 114 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 110 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 110 transition count 87
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 90 place count 103 transition count 80
Applied a total of 90 rules in 14 ms. Remains 103 /148 variables (removed 45) and now considering 80/125 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 103/148 places, 80/125 transitions.
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 4 ms
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 4 ms
[2023-03-12 13:56:13] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 126 transition count 91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 114 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 110 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 110 transition count 87
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 96 place count 100 transition count 77
Applied a total of 96 rules in 9 ms. Remains 100 /148 variables (removed 48) and now considering 77/125 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 100/148 places, 77/125 transitions.
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 15 ms
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 3 ms
[2023-03-12 13:56:13] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 145 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 145 transition count 122
Applied a total of 6 rules in 27 ms. Remains 145 /148 variables (removed 3) and now considering 122/125 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 145/148 places, 122/125 transitions.
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 9 ms
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 12 ms
[2023-03-12 13:56:13] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 3 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 6 ms
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 6 ms
[2023-03-12 13:56:13] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 4 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 4 ms
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 6 ms
[2023-03-12 13:56:13] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 126 transition count 91
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 114 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 110 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 110 transition count 87
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 96 place count 100 transition count 77
Applied a total of 96 rules in 30 ms. Remains 100 /148 variables (removed 48) and now considering 77/125 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 100/148 places, 77/125 transitions.
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 4 ms
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 4 ms
[2023-03-12 13:56:13] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 44 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 10 ms
[2023-03-12 13:56:13] [INFO ] Flatten gal took : 4 ms
[2023-03-12 13:56:14] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 4 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 4 ms
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 5 ms
[2023-03-12 13:56:14] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 145 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 145 transition count 122
Applied a total of 6 rules in 15 ms. Remains 145 /148 variables (removed 3) and now considering 122/125 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 145/148 places, 122/125 transitions.
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 5 ms
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 5 ms
[2023-03-12 13:56:14] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 126 transition count 91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 114 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 110 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 110 transition count 87
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 98 place count 99 transition count 76
Applied a total of 98 rules in 24 ms. Remains 99 /148 variables (removed 49) and now considering 76/125 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 99/148 places, 76/125 transitions.
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 9 ms
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 4 ms
[2023-03-12 13:56:14] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 148 transition count 104
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 127 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 44 place count 126 transition count 93
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 64 place count 116 transition count 93
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 68 place count 112 transition count 89
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 112 transition count 89
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 100 transition count 77
Applied a total of 96 rules in 26 ms. Remains 100 /148 variables (removed 48) and now considering 77/125 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 100/148 places, 77/125 transitions.
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 3 ms
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 3 ms
[2023-03-12 13:56:14] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 145 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 145 transition count 122
Applied a total of 6 rules in 4 ms. Remains 145 /148 variables (removed 3) and now considering 122/125 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 145/148 places, 122/125 transitions.
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 12 ms
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 5 ms
[2023-03-12 13:56:14] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 144 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 144 transition count 121
Applied a total of 8 rules in 4 ms. Remains 144 /148 variables (removed 4) and now considering 121/125 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 144/148 places, 121/125 transitions.
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 5 ms
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 4 ms
[2023-03-12 13:56:14] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 125/125 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 103
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 126 transition count 103
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 44 place count 126 transition count 92
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 66 place count 115 transition count 92
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 111 transition count 88
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 111 transition count 88
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 94 place count 101 transition count 78
Applied a total of 94 rules in 19 ms. Remains 101 /148 variables (removed 47) and now considering 78/125 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 101/148 places, 78/125 transitions.
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 4 ms
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 5 ms
[2023-03-12 13:56:14] [INFO ] Input system was already deterministic with 78 transitions.
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 5 ms
[2023-03-12 13:56:14] [INFO ] Flatten gal took : 17 ms
[2023-03-12 13:56:14] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 15 ms.
[2023-03-12 13:56:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 148 places, 125 transitions and 401 arcs took 3 ms.
Total runtime 6393 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/490/ctl_0_ --ctl=/tmp/490/ctl_1_ --ctl=/tmp/490/ctl_2_ --ctl=/tmp/490/ctl_3_ --ctl=/tmp/490/ctl_4_ --ctl=/tmp/490/ctl_5_ --ctl=/tmp/490/ctl_6_ --ctl=/tmp/490/ctl_7_ --ctl=/tmp/490/ctl_8_ --ctl=/tmp/490/ctl_9_ --ctl=/tmp/490/ctl_10_ --ctl=/tmp/490/ctl_11_ --ctl=/tmp/490/ctl_12_ --ctl=/tmp/490/ctl_13_ --ctl=/tmp/490/ctl_14_ --ctl=/tmp/490/ctl_15_ --mu-par --mu-opt
FORMULA AutoFlight-PT-06a-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06a-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678629454998

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 AutoFlight-PT-06a-CTLFireability-00
ctl formula formula --ctl=/tmp/490/ctl_0_
ctl formula name AutoFlight-PT-06a-CTLFireability-01
ctl formula formula --ctl=/tmp/490/ctl_1_
ctl formula name AutoFlight-PT-06a-CTLFireability-02
ctl formula formula --ctl=/tmp/490/ctl_2_
ctl formula name AutoFlight-PT-06a-CTLFireability-03
ctl formula formula --ctl=/tmp/490/ctl_3_
ctl formula name AutoFlight-PT-06a-CTLFireability-04
ctl formula formula --ctl=/tmp/490/ctl_4_
ctl formula name AutoFlight-PT-06a-CTLFireability-05
ctl formula formula --ctl=/tmp/490/ctl_5_
ctl formula name AutoFlight-PT-06a-CTLFireability-06
ctl formula formula --ctl=/tmp/490/ctl_6_
ctl formula name AutoFlight-PT-06a-CTLFireability-07
ctl formula formula --ctl=/tmp/490/ctl_7_
ctl formula name AutoFlight-PT-06a-CTLFireability-08
ctl formula formula --ctl=/tmp/490/ctl_8_
ctl formula name AutoFlight-PT-06a-CTLFireability-09
ctl formula formula --ctl=/tmp/490/ctl_9_
ctl formula name AutoFlight-PT-06a-CTLFireability-10
ctl formula formula --ctl=/tmp/490/ctl_10_
ctl formula name AutoFlight-PT-06a-CTLFireability-11
ctl formula formula --ctl=/tmp/490/ctl_11_
ctl formula name AutoFlight-PT-06a-CTLFireability-12
ctl formula formula --ctl=/tmp/490/ctl_12_
ctl formula name AutoFlight-PT-06a-CTLFireability-13
ctl formula formula --ctl=/tmp/490/ctl_13_
ctl formula name AutoFlight-PT-06a-CTLFireability-14
ctl formula formula --ctl=/tmp/490/ctl_14_
ctl formula name AutoFlight-PT-06a-CTLFireability-15
ctl formula formula --ctl=/tmp/490/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 148 places, 125 transitions and 401 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 125->95 groups
pnml2lts-sym: Regrouping took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 148; there are 95 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...
pnml2lts-sym: Exploration took 35735 group checks and 0 next state calls
pnml2lts-sym: reachability took 4.510 real 17.980 user 0.010 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.040 user 0.000 sys
pnml2lts-sym: state space has 1371919681 states, 89487 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/490/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_15_ holds for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_4_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/490/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_12_ holds for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_7_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_13_ holds for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_14_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/490/ctl_10_ does not hold for the initial state
pnml2lts-sym: group_next: 1154 nodes total
pnml2lts-sym: group_explored: 890 nodes, 1311201 short vectors total
pnml2lts-sym: max token count: 1

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="AutoFlight-PT-06a"
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 AutoFlight-PT-06a, 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 r009-oct2-167813597900450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06a.tgz
mv AutoFlight-PT-06a 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 ;