fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r166-smll-158987787700441
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for AutoFlight-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.920 3600000.00 3638513.00 12529.90 TTFF?FFTFFFT??TT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787700441.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is AutoFlight-PT-05b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787700441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 3.3K Mar 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 18:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 10:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 10:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 113K Mar 24 05:37 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-05b-00
FORMULA_NAME AutoFlight-PT-05b-01
FORMULA_NAME AutoFlight-PT-05b-02
FORMULA_NAME AutoFlight-PT-05b-03
FORMULA_NAME AutoFlight-PT-05b-04
FORMULA_NAME AutoFlight-PT-05b-05
FORMULA_NAME AutoFlight-PT-05b-06
FORMULA_NAME AutoFlight-PT-05b-07
FORMULA_NAME AutoFlight-PT-05b-08
FORMULA_NAME AutoFlight-PT-05b-09
FORMULA_NAME AutoFlight-PT-05b-10
FORMULA_NAME AutoFlight-PT-05b-11
FORMULA_NAME AutoFlight-PT-05b-12
FORMULA_NAME AutoFlight-PT-05b-13
FORMULA_NAME AutoFlight-PT-05b-14
FORMULA_NAME AutoFlight-PT-05b-15

=== Now, execution of the tool begins

BK_START 1591473809609

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 20:03:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-06 20:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 20:03:33] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2020-06-06 20:03:33] [INFO ] Transformed 482 places.
[2020-06-06 20:03:33] [INFO ] Transformed 480 transitions.
[2020-06-06 20:03:33] [INFO ] Found NUPN structural information;
[2020-06-06 20:03:33] [INFO ] Parsed PT model containing 482 places and 480 transitions in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 67 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 411 resets, run finished after 531 ms. (steps per millisecond=188 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1]
// Phase 1: matrix 480 rows 482 cols
[2020-06-06 20:03:33] [INFO ] Computed 34 place invariants in 19 ms
[2020-06-06 20:03:34] [INFO ] [Real]Absence check using 33 positive place invariants in 83 ms returned sat
[2020-06-06 20:03:34] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 20:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 20:03:35] [INFO ] [Real]Absence check using state equation in 1170 ms returned sat
[2020-06-06 20:03:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 20:03:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 53 ms returned unsat
[2020-06-06 20:03:36] [INFO ] [Real]Absence check using 33 positive place invariants in 71 ms returned sat
[2020-06-06 20:03:36] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 20:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 20:03:37] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2020-06-06 20:03:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 20:03:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 320 ms returned sat
[2020-06-06 20:03:37] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-06 20:03:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 20:03:38] [INFO ] [Nat]Absence check using state equation in 1054 ms returned sat
[2020-06-06 20:03:39] [INFO ] Deduced a trap composed of 29 places in 431 ms
[2020-06-06 20:03:39] [INFO ] Deduced a trap composed of 48 places in 331 ms
[2020-06-06 20:03:39] [INFO ] Deduced a trap composed of 21 places in 356 ms
[2020-06-06 20:03:40] [INFO ] Deduced a trap composed of 58 places in 339 ms
[2020-06-06 20:03:40] [INFO ] Deduced a trap composed of 47 places in 320 ms
[2020-06-06 20:03:41] [INFO ] Deduced a trap composed of 39 places in 302 ms
[2020-06-06 20:03:41] [INFO ] Deduced a trap composed of 41 places in 295 ms
[2020-06-06 20:03:41] [INFO ] Deduced a trap composed of 64 places in 283 ms
[2020-06-06 20:03:42] [INFO ] Deduced a trap composed of 42 places in 318 ms
[2020-06-06 20:03:42] [INFO ] Deduced a trap composed of 31 places in 314 ms
[2020-06-06 20:03:42] [INFO ] Deduced a trap composed of 52 places in 302 ms
[2020-06-06 20:03:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4082 ms
[2020-06-06 20:03:42] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 78 ms.
[2020-06-06 20:03:48] [INFO ] Added : 469 causal constraints over 94 iterations in 5699 ms. Result :sat
[2020-06-06 20:03:48] [INFO ] [Real]Absence check using 33 positive place invariants in 70 ms returned sat
[2020-06-06 20:03:48] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 20:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 20:03:49] [INFO ] [Real]Absence check using state equation in 1070 ms returned sat
[2020-06-06 20:03:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 20:03:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 312 ms returned sat
[2020-06-06 20:03:50] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 20:03:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 20:03:51] [INFO ] [Nat]Absence check using state equation in 1030 ms returned sat
[2020-06-06 20:03:51] [INFO ] Deduced a trap composed of 17 places in 274 ms
[2020-06-06 20:03:51] [INFO ] Deduced a trap composed of 32 places in 259 ms
[2020-06-06 20:03:52] [INFO ] Deduced a trap composed of 31 places in 254 ms
[2020-06-06 20:03:52] [INFO ] Deduced a trap composed of 59 places in 256 ms
[2020-06-06 20:03:52] [INFO ] Deduced a trap composed of 42 places in 225 ms
[2020-06-06 20:03:53] [INFO ] Deduced a trap composed of 73 places in 204 ms
[2020-06-06 20:03:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1697 ms
[2020-06-06 20:03:53] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 45 ms.
[2020-06-06 20:03:58] [INFO ] Added : 479 causal constraints over 97 iterations in 5589 ms. Result :sat
[2020-06-06 20:03:58] [INFO ] [Real]Absence check using 33 positive place invariants in 59 ms returned sat
[2020-06-06 20:03:58] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 20:03:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 20:04:00] [INFO ] [Real]Absence check using state equation in 1094 ms returned sat
[2020-06-06 20:04:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 20:04:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 307 ms returned sat
[2020-06-06 20:04:00] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-06 20:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 20:04:01] [INFO ] [Nat]Absence check using state equation in 1018 ms returned sat
[2020-06-06 20:04:01] [INFO ] Deduced a trap composed of 54 places in 363 ms
[2020-06-06 20:04:02] [INFO ] Deduced a trap composed of 21 places in 347 ms
[2020-06-06 20:04:02] [INFO ] Deduced a trap composed of 23 places in 346 ms
[2020-06-06 20:04:03] [INFO ] Deduced a trap composed of 29 places in 326 ms
[2020-06-06 20:04:03] [INFO ] Deduced a trap composed of 43 places in 286 ms
[2020-06-06 20:04:03] [INFO ] Deduced a trap composed of 74 places in 326 ms
[2020-06-06 20:04:04] [INFO ] Deduced a trap composed of 24 places in 314 ms
[2020-06-06 20:04:04] [INFO ] Deduced a trap composed of 32 places in 302 ms
[2020-06-06 20:04:04] [INFO ] Deduced a trap composed of 39 places in 316 ms
[2020-06-06 20:04:05] [INFO ] Deduced a trap composed of 77 places in 307 ms
[2020-06-06 20:04:05] [INFO ] Deduced a trap composed of 20 places in 311 ms
[2020-06-06 20:04:05] [INFO ] Deduced a trap composed of 46 places in 302 ms
[2020-06-06 20:04:06] [INFO ] Deduced a trap composed of 33 places in 245 ms
[2020-06-06 20:04:06] [INFO ] Deduced a trap composed of 31 places in 241 ms
[2020-06-06 20:04:06] [INFO ] Deduced a trap composed of 73 places in 229 ms
[2020-06-06 20:04:06] [INFO ] Deduced a trap composed of 26 places in 235 ms
[2020-06-06 20:04:07] [INFO ] Deduced a trap composed of 35 places in 228 ms
[2020-06-06 20:04:07] [INFO ] Deduced a trap composed of 75 places in 231 ms
[2020-06-06 20:04:07] [INFO ] Deduced a trap composed of 71 places in 176 ms
[2020-06-06 20:04:07] [INFO ] Deduced a trap composed of 48 places in 163 ms
[2020-06-06 20:04:07] [INFO ] Deduced a trap composed of 82 places in 155 ms
[2020-06-06 20:04:08] [INFO ] Deduced a trap composed of 45 places in 176 ms
[2020-06-06 20:04:08] [INFO ] Deduced a trap composed of 58 places in 174 ms
[2020-06-06 20:04:08] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6896 ms
[2020-06-06 20:04:08] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 60 ms.
[2020-06-06 20:04:13] [INFO ] Added : 469 causal constraints over 94 iterations in 5557 ms. Result :sat
[2020-06-06 20:04:14] [INFO ] [Real]Absence check using 33 positive place invariants in 58 ms returned sat
[2020-06-06 20:04:14] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-06 20:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 20:04:15] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2020-06-06 20:04:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 20:04:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 294 ms returned sat
[2020-06-06 20:04:15] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 20:04:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 20:04:16] [INFO ] [Nat]Absence check using state equation in 1046 ms returned sat
[2020-06-06 20:04:17] [INFO ] Deduced a trap composed of 29 places in 256 ms
[2020-06-06 20:04:17] [INFO ] Deduced a trap composed of 70 places in 240 ms
[2020-06-06 20:04:17] [INFO ] Deduced a trap composed of 43 places in 225 ms
[2020-06-06 20:04:17] [INFO ] Deduced a trap composed of 55 places in 215 ms
[2020-06-06 20:04:18] [INFO ] Deduced a trap composed of 83 places in 217 ms
[2020-06-06 20:04:18] [INFO ] Deduced a trap composed of 82 places in 210 ms
[2020-06-06 20:04:18] [INFO ] Deduced a trap composed of 86 places in 224 ms
[2020-06-06 20:04:18] [INFO ] Deduced a trap composed of 72 places in 208 ms
[2020-06-06 20:04:19] [INFO ] Deduced a trap composed of 41 places in 358 ms
[2020-06-06 20:04:19] [INFO ] Deduced a trap composed of 66 places in 352 ms
[2020-06-06 20:04:20] [INFO ] Deduced a trap composed of 67 places in 341 ms
[2020-06-06 20:04:20] [INFO ] Deduced a trap composed of 56 places in 329 ms
[2020-06-06 20:04:20] [INFO ] Deduced a trap composed of 58 places in 336 ms
[2020-06-06 20:04:21] [INFO ] Deduced a trap composed of 61 places in 332 ms
[2020-06-06 20:04:21] [INFO ] Deduced a trap composed of 65 places in 325 ms
[2020-06-06 20:04:21] [INFO ] Deduced a trap composed of 68 places in 316 ms
[2020-06-06 20:04:22] [INFO ] Deduced a trap composed of 56 places in 312 ms
[2020-06-06 20:04:22] [INFO ] Deduced a trap composed of 62 places in 319 ms
[2020-06-06 20:04:22] [INFO ] Deduced a trap composed of 48 places in 301 ms
[2020-06-06 20:04:23] [INFO ] Deduced a trap composed of 76 places in 307 ms
[2020-06-06 20:04:23] [INFO ] Deduced a trap composed of 48 places in 318 ms
[2020-06-06 20:04:23] [INFO ] Deduced a trap composed of 48 places in 268 ms
[2020-06-06 20:04:24] [INFO ] Deduced a trap composed of 43 places in 307 ms
[2020-06-06 20:04:24] [INFO ] Deduced a trap composed of 71 places in 273 ms
[2020-06-06 20:04:24] [INFO ] Deduced a trap composed of 46 places in 310 ms
[2020-06-06 20:04:25] [INFO ] Deduced a trap composed of 39 places in 295 ms
[2020-06-06 20:04:25] [INFO ] Deduced a trap composed of 27 places in 318 ms
[2020-06-06 20:04:25] [INFO ] Deduced a trap composed of 70 places in 301 ms
[2020-06-06 20:04:26] [INFO ] Deduced a trap composed of 51 places in 298 ms
[2020-06-06 20:04:26] [INFO ] Deduced a trap composed of 59 places in 292 ms
[2020-06-06 20:04:26] [INFO ] Deduced a trap composed of 79 places in 282 ms
[2020-06-06 20:04:27] [INFO ] Deduced a trap composed of 51 places in 273 ms
[2020-06-06 20:04:27] [INFO ] Deduced a trap composed of 80 places in 242 ms
[2020-06-06 20:04:27] [INFO ] Deduced a trap composed of 75 places in 248 ms
[2020-06-06 20:04:27] [INFO ] Deduced a trap composed of 72 places in 233 ms
[2020-06-06 20:04:28] [INFO ] Deduced a trap composed of 60 places in 225 ms
[2020-06-06 20:04:28] [INFO ] Deduced a trap composed of 64 places in 228 ms
[2020-06-06 20:04:28] [INFO ] Deduced a trap composed of 101 places in 234 ms
[2020-06-06 20:04:28] [INFO ] Deduced a trap composed of 95 places in 220 ms
[2020-06-06 20:04:29] [INFO ] Deduced a trap composed of 75 places in 212 ms
[2020-06-06 20:04:29] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 12467 ms
[2020-06-06 20:04:29] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 53 ms.
[2020-06-06 20:04:34] [INFO ] Added : 478 causal constraints over 96 iterations in 5655 ms. Result :sat
[2020-06-06 20:04:35] [INFO ] [Real]Absence check using 33 positive place invariants in 59 ms returned sat
[2020-06-06 20:04:35] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 20:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 20:04:36] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2020-06-06 20:04:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 20:04:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 288 ms returned sat
[2020-06-06 20:04:36] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 20:04:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 20:04:37] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2020-06-06 20:04:38] [INFO ] Deduced a trap composed of 21 places in 286 ms
[2020-06-06 20:04:38] [INFO ] Deduced a trap composed of 43 places in 260 ms
[2020-06-06 20:04:38] [INFO ] Deduced a trap composed of 46 places in 238 ms
[2020-06-06 20:04:38] [INFO ] Deduced a trap composed of 74 places in 284 ms
[2020-06-06 20:04:39] [INFO ] Deduced a trap composed of 63 places in 254 ms
[2020-06-06 20:04:39] [INFO ] Deduced a trap composed of 41 places in 257 ms
[2020-06-06 20:04:39] [INFO ] Deduced a trap composed of 75 places in 239 ms
[2020-06-06 20:04:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2069 ms
[2020-06-06 20:04:39] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 59 ms.
[2020-06-06 20:04:45] [INFO ] Added : 479 causal constraints over 96 iterations in 5737 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-06 20:04:46] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-06 20:04:46] [INFO ] Flatten gal took : 150 ms
FORMULA AutoFlight-PT-05b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 20:04:46] [INFO ] Applying decomposition
[2020-06-06 20:04:46] [INFO ] Flatten gal took : 63 ms
[2020-06-06 20:04:46] [INFO ] Decomposing Gal with order
[2020-06-06 20:04:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-06 20:04:46] [INFO ] Removed a total of 12 redundant transitions.
[2020-06-06 20:04:46] [INFO ] Flatten gal took : 127 ms
[2020-06-06 20:04:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 52 ms.
[2020-06-06 20:04:46] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2020-06-06 20:04:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ AutoFlight-PT-05b @ 3570 seconds

FORMULA AutoFlight-PT-05b-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05b-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05b-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05b-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05b-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05b-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05b-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05b-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 12913732 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16140616 kB

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

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-05b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is AutoFlight-PT-05b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r166-smll-158987787700441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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