Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987872400801.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 QuasiCertifProtocol-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872400801
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 26K Apr 12 06:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 06:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 07:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 11 07:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 10 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 10 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 9 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 9 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 27K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 686K 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 QuasiCertifProtocol-PT-18-00
FORMULA_NAME QuasiCertifProtocol-PT-18-01
FORMULA_NAME QuasiCertifProtocol-PT-18-02
FORMULA_NAME QuasiCertifProtocol-PT-18-03
FORMULA_NAME QuasiCertifProtocol-PT-18-04
FORMULA_NAME QuasiCertifProtocol-PT-18-05
FORMULA_NAME QuasiCertifProtocol-PT-18-06
FORMULA_NAME QuasiCertifProtocol-PT-18-07
FORMULA_NAME QuasiCertifProtocol-PT-18-08
FORMULA_NAME QuasiCertifProtocol-PT-18-09
FORMULA_NAME QuasiCertifProtocol-PT-18-10
FORMULA_NAME QuasiCertifProtocol-PT-18-11
FORMULA_NAME QuasiCertifProtocol-PT-18-12
FORMULA_NAME QuasiCertifProtocol-PT-18-13
FORMULA_NAME QuasiCertifProtocol-PT-18-14
FORMULA_NAME QuasiCertifProtocol-PT-18-15

=== Now, execution of the tool begins

BK_START 1591182209611

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 11:03:31] [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-03 11:03:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 11:03:31] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2020-06-03 11:03:31] [INFO ] Transformed 1398 places.
[2020-06-03 11:03:31] [INFO ] Transformed 296 transitions.
[2020-06-03 11:03:31] [INFO ] Parsed PT model containing 1398 places and 296 transitions in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 105 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 4419 resets, run finished after 1559 ms. (steps per millisecond=64 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
// Phase 1: matrix 296 rows 1398 cols
[2020-06-03 11:03:33] [INFO ] Computed 1103 place invariants in 72 ms
[2020-06-03 11:03:33] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned unsat
[2020-06-03 11:03:34] [INFO ] [Real]Absence check using 3 positive place invariants in 67 ms returned unsat
[2020-06-03 11:03:34] [INFO ] [Real]Absence check using 3 positive place invariants in 45 ms returned sat
[2020-06-03 11:03:35] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 978 ms returned sat
[2020-06-03 11:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:03:38] [INFO ] [Real]Absence check using state equation in 3117 ms returned sat
[2020-06-03 11:03:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:03:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 34 ms returned sat
[2020-06-03 11:03:39] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 992 ms returned sat
[2020-06-03 11:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:03:43] [INFO ] [Nat]Absence check using state equation in 3250 ms returned sat
[2020-06-03 11:03:43] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 23 ms.
[2020-06-03 11:03:43] [INFO ] Added : 48 causal constraints over 10 iterations in 559 ms. Result :sat
[2020-06-03 11:03:43] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2020-06-03 11:03:44] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 1014 ms returned sat
[2020-06-03 11:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:03:49] [INFO ] [Real]Absence check using state equation in 4679 ms returned sat
[2020-06-03 11:03:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:03:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2020-06-03 11:03:50] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 820 ms returned sat
[2020-06-03 11:03:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:03:53] [INFO ] [Nat]Absence check using state equation in 2684 ms returned sat
[2020-06-03 11:03:53] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 24 ms.
[2020-06-03 11:03:54] [INFO ] Added : 120 causal constraints over 24 iterations in 1078 ms. Result :sat
[2020-06-03 11:03:54] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-03 11:03:55] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 914 ms returned sat
[2020-06-03 11:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:03:58] [INFO ] [Real]Absence check using state equation in 3137 ms returned sat
[2020-06-03 11:03:58] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 29 ms.
[2020-06-03 11:03:59] [INFO ] Added : 120 causal constraints over 24 iterations in 1247 ms. Result :sat
[2020-06-03 11:04:00] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned unsat
[2020-06-03 11:04:00] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-03 11:04:01] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 980 ms returned sat
[2020-06-03 11:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:04:04] [INFO ] [Real]Absence check using state equation in 3345 ms returned sat
[2020-06-03 11:04:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:04:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 20 ms returned sat
[2020-06-03 11:04:05] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 1046 ms returned sat
[2020-06-03 11:04:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:04:09] [INFO ] [Nat]Absence check using state equation in 3730 ms returned sat
[2020-06-03 11:04:09] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 31 ms.
[2020-06-03 11:04:10] [INFO ] Added : 60 causal constraints over 12 iterations in 464 ms. Result :sat
[2020-06-03 11:04:10] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-03 11:04:11] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 908 ms returned sat
[2020-06-03 11:04:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:04:14] [INFO ] [Real]Absence check using state equation in 3499 ms returned sat
[2020-06-03 11:04:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:04:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 23 ms returned sat
[2020-06-03 11:04:15] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 791 ms returned sat
[2020-06-03 11:04:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:04:19] [INFO ] [Nat]Absence check using state equation in 3666 ms returned sat
[2020-06-03 11:04:19] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 28 ms.
[2020-06-03 11:04:21] [INFO ] Added : 137 causal constraints over 28 iterations in 1456 ms. Result :sat
[2020-06-03 11:04:21] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-06-03 11:04:22] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 874 ms returned sat
[2020-06-03 11:04:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:04:25] [INFO ] [Real]Absence check using state equation in 3045 ms returned sat
[2020-06-03 11:04:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:04:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2020-06-03 11:04:26] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 994 ms returned sat
[2020-06-03 11:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:04:29] [INFO ] [Nat]Absence check using state equation in 3083 ms returned sat
[2020-06-03 11:04:29] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 30 ms.
[2020-06-03 11:04:30] [INFO ] Added : 130 causal constraints over 26 iterations in 997 ms. Result :sat
[2020-06-03 11:04:30] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned unsat
[2020-06-03 11:04:30] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned unsat
[2020-06-03 11:04:30] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-03 11:04:31] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 893 ms returned sat
[2020-06-03 11:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:04:38] [INFO ] [Real]Absence check using state equation in 6396 ms returned sat
[2020-06-03 11:04:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:04:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:04:39] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 1074 ms returned sat
[2020-06-03 11:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:04:42] [INFO ] [Nat]Absence check using state equation in 3498 ms returned sat
[2020-06-03 11:04:42] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 25 ms.
[2020-06-03 11:04:43] [INFO ] Added : 121 causal constraints over 25 iterations in 971 ms. Result :sat
[2020-06-03 11:04:44] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-06-03 11:04:44] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 783 ms returned sat
[2020-06-03 11:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:04:48] [INFO ] [Real]Absence check using state equation in 3935 ms returned sat
[2020-06-03 11:04:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:04:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:04:49] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 894 ms returned sat
[2020-06-03 11:04:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:04:53] [INFO ] [Nat]Absence check using state equation in 3727 ms returned sat
[2020-06-03 11:04:53] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 37 ms.
[2020-06-03 11:04:53] [INFO ] Added : 40 causal constraints over 8 iterations in 321 ms. Result :sat
[2020-06-03 11:04:54] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 11:04:55] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 889 ms returned sat
[2020-06-03 11:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:04:58] [INFO ] [Real]Absence check using state equation in 3674 ms returned sat
[2020-06-03 11:04:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:04:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:05:00] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 1116 ms returned sat
[2020-06-03 11:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:03] [INFO ] [Nat]Absence check using state equation in 3818 ms returned sat
[2020-06-03 11:05:03] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 35 ms.
[2020-06-03 11:05:04] [INFO ] Added : 118 causal constraints over 24 iterations in 925 ms. Result :sat
[2020-06-03 11:05:05] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 11:05:05] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 814 ms returned sat
[2020-06-03 11:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:10] [INFO ] [Real]Absence check using state equation in 4600 ms returned sat
[2020-06-03 11:05:10] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 25 ms.
[2020-06-03 11:05:11] [INFO ] Added : 129 causal constraints over 26 iterations in 1225 ms. Result :sat
[2020-06-03 11:05:12] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 11:05:13] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 1057 ms returned sat
[2020-06-03 11:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:17] [INFO ] [Real]Absence check using state equation in 4080 ms returned sat
[2020-06-03 11:05:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:05:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:05:18] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 898 ms returned sat
[2020-06-03 11:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:21] [INFO ] [Nat]Absence check using state equation in 3158 ms returned sat
[2020-06-03 11:05:21] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 28 ms.
[2020-06-03 11:05:21] [INFO ] Added : 39 causal constraints over 8 iterations in 249 ms. Result :sat
[2020-06-03 11:05:21] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned unsat
[2020-06-03 11:05:21] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned sat
[2020-06-03 11:05:22] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 723 ms returned sat
[2020-06-03 11:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:25] [INFO ] [Real]Absence check using state equation in 3087 ms returned unsat
[2020-06-03 11:05:25] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2020-06-03 11:05:26] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 832 ms returned sat
[2020-06-03 11:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:28] [INFO ] [Real]Absence check using state equation in 1765 ms returned unsat
[2020-06-03 11:05:28] [INFO ] [Real]Absence check using 3 positive place invariants in 45 ms returned sat
[2020-06-03 11:05:29] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 1097 ms returned sat
[2020-06-03 11:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:30] [INFO ] [Real]Absence check using state equation in 324 ms returned unsat
[2020-06-03 11:05:30] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2020-06-03 11:05:31] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 911 ms returned sat
[2020-06-03 11:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:34] [INFO ] [Real]Absence check using state equation in 3740 ms returned sat
[2020-06-03 11:05:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:05:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:05:36] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 971 ms returned sat
[2020-06-03 11:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:39] [INFO ] [Nat]Absence check using state equation in 3779 ms returned sat
[2020-06-03 11:05:39] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 40 ms.
[2020-06-03 11:05:40] [INFO ] Added : 20 causal constraints over 4 iterations in 238 ms. Result :sat
[2020-06-03 11:05:40] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 11:05:41] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 1039 ms returned sat
[2020-06-03 11:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:44] [INFO ] [Real]Absence check using state equation in 3598 ms returned sat
[2020-06-03 11:05:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:05:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 11:05:46] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 928 ms returned sat
[2020-06-03 11:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:49] [INFO ] [Nat]Absence check using state equation in 3665 ms returned sat
[2020-06-03 11:05:49] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 26 ms.
[2020-06-03 11:05:50] [INFO ] Added : 119 causal constraints over 24 iterations in 964 ms. Result :sat
[2020-06-03 11:05:50] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 11:05:51] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 883 ms returned sat
[2020-06-03 11:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:55] [INFO ] [Real]Absence check using state equation in 3440 ms returned sat
[2020-06-03 11:05:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:05:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-06-03 11:05:56] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 973 ms returned sat
[2020-06-03 11:05:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:05:59] [INFO ] [Nat]Absence check using state equation in 3325 ms returned sat
[2020-06-03 11:05:59] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 25 ms.
[2020-06-03 11:06:00] [INFO ] Added : 119 causal constraints over 24 iterations in 899 ms. Result :sat
[2020-06-03 11:06:00] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 11:06:01] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 914 ms returned sat
[2020-06-03 11:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:04] [INFO ] [Real]Absence check using state equation in 3003 ms returned sat
[2020-06-03 11:06:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:06:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2020-06-03 11:06:06] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 1298 ms returned sat
[2020-06-03 11:06:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:09] [INFO ] [Nat]Absence check using state equation in 3021 ms returned sat
[2020-06-03 11:06:09] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 20 ms.
[2020-06-03 11:06:10] [INFO ] Added : 119 causal constraints over 24 iterations in 964 ms. Result :sat
[2020-06-03 11:06:10] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 11:06:11] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 824 ms returned sat
[2020-06-03 11:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:14] [INFO ] [Real]Absence check using state equation in 3133 ms returned sat
[2020-06-03 11:06:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:06:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:06:15] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 773 ms returned sat
[2020-06-03 11:06:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:18] [INFO ] [Nat]Absence check using state equation in 2976 ms returned sat
[2020-06-03 11:06:18] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 24 ms.
[2020-06-03 11:06:19] [INFO ] Added : 124 causal constraints over 25 iterations in 823 ms. Result :sat
[2020-06-03 11:06:19] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-03 11:06:20] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 837 ms returned sat
[2020-06-03 11:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:20] [INFO ] [Real]Absence check using state equation in 452 ms returned unsat
[2020-06-03 11:06:21] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 11:06:21] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 919 ms returned sat
[2020-06-03 11:06:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:22] [INFO ] [Real]Absence check using state equation in 332 ms returned unsat
[2020-06-03 11:06:22] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2020-06-03 11:06:22] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:06:23] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 1007 ms returned sat
[2020-06-03 11:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:27] [INFO ] [Real]Absence check using state equation in 4194 ms returned sat
[2020-06-03 11:06:28] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 32 ms.
[2020-06-03 11:06:28] [INFO ] Added : 63 causal constraints over 13 iterations in 647 ms. Result :sat
[2020-06-03 11:06:29] [INFO ] [Real]Absence check using 3 positive place invariants in 79 ms returned sat
[2020-06-03 11:06:30] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 1085 ms returned sat
[2020-06-03 11:06:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:33] [INFO ] [Real]Absence check using state equation in 2925 ms returned sat
[2020-06-03 11:06:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:06:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 34 ms returned sat
[2020-06-03 11:06:35] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 1566 ms returned sat
[2020-06-03 11:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:38] [INFO ] [Nat]Absence check using state equation in 3157 ms returned sat
[2020-06-03 11:06:38] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 16 ms.
[2020-06-03 11:06:38] [INFO ] Added : 32 causal constraints over 7 iterations in 374 ms. Result :sat
[2020-06-03 11:06:38] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2020-06-03 11:06:39] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 896 ms returned sat
[2020-06-03 11:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:43] [INFO ] [Real]Absence check using state equation in 3591 ms returned sat
[2020-06-03 11:06:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:06:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 11:06:44] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 891 ms returned sat
[2020-06-03 11:06:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:47] [INFO ] [Nat]Absence check using state equation in 2846 ms returned sat
[2020-06-03 11:06:47] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 38 ms.
[2020-06-03 11:06:48] [INFO ] Added : 32 causal constraints over 7 iterations in 724 ms. Result :sat
[2020-06-03 11:06:48] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-03 11:06:49] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 988 ms returned sat
[2020-06-03 11:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:52] [INFO ] [Real]Absence check using state equation in 2914 ms returned sat
[2020-06-03 11:06:52] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 27 ms.
[2020-06-03 11:06:53] [INFO ] Added : 119 causal constraints over 24 iterations in 1656 ms. Result :sat
[2020-06-03 11:06:54] [INFO ] [Real]Absence check using 3 positive place invariants in 54 ms returned sat
[2020-06-03 11:06:55] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 1491 ms returned sat
[2020-06-03 11:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:06:58] [INFO ] [Real]Absence check using state equation in 3052 ms returned sat
[2020-06-03 11:06:58] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 25 ms.
[2020-06-03 11:06:59] [INFO ] Added : 41 causal constraints over 9 iterations in 370 ms. Result :sat
[2020-06-03 11:06:59] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2020-06-03 11:07:00] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 1015 ms returned sat
[2020-06-03 11:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:07:03] [INFO ] [Real]Absence check using state equation in 3097 ms returned sat
[2020-06-03 11:07:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:07:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 27 ms returned sat
[2020-06-03 11:07:05] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 1848 ms returned sat
[2020-06-03 11:07:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:07:08] [INFO ] [Nat]Absence check using state equation in 2969 ms returned sat
[2020-06-03 11:07:08] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 42 ms.
[2020-06-03 11:07:09] [INFO ] Added : 118 causal constraints over 24 iterations in 1220 ms. Result :sat
[2020-06-03 11:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-03 11:07:11] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 858 ms returned sat
[2020-06-03 11:07:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:07:12] [INFO ] [Real]Absence check using state equation in 1517 ms returned unsat
[2020-06-03 11:07:12] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:07:13] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 829 ms returned sat
[2020-06-03 11:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:07:17] [INFO ] [Real]Absence check using state equation in 3592 ms returned sat
[2020-06-03 11:07:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:07:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-06-03 11:07:18] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 1619 ms returned sat
[2020-06-03 11:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:07:21] [INFO ] [Nat]Absence check using state equation in 2934 ms returned sat
[2020-06-03 11:07:21] [INFO ] Computed and/alt/rep : 276/1435/276 causal constraints in 27 ms.
[2020-06-03 11:07:22] [INFO ] Added : 118 causal constraints over 24 iterations in 798 ms. Result :sat
Successfully simplified 13 atomic propositions for a total of 17 simplifications.
[2020-06-03 11:07:23] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-03 11:07:23] [INFO ] Flatten gal took : 166 ms
FORMULA QuasiCertifProtocol-PT-18-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 11:07:23] [INFO ] Flatten gal took : 58 ms
[2020-06-03 11:07:23] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 11:07:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-PT-18 @ 3570 seconds

FORMULA QuasiCertifProtocol-PT-18-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ QuasiCertifProtocol-PT-18

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 11:07:23 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(p1310 + p1311 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 <= p149)",
"processed_size": 159,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X ((p149 + 1 <= p1310 + p1311 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329))",
"processed_size": 167,
"rewrites": 31
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X (F ((p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1330 + p1331 + p1332 + p1333 <= p129)))",
"processed_size": 167,
"rewrites": 31
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 58,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 39,
"visible_transitions": 0
},
"processed": "((F ((2 <= p40 + p39 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21)) AND (2 <= p40 + p39 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21)) U (p1309 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p96 + p94 + p93))",
"processed_size": 390,
"rewrites": 31
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 38,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 38,
"visible_transitions": 0
},
"processed": "X ((p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1330 + p1331 + p1332 + p1333 + 1 <= p100 + p98 + p97 + p95 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p80 + p79 + p78 + p77 + p99))",
"processed_size": 275,
"rewrites": 31
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p852 <= 0)",
"processed_size": 11,
"rewrites": 33
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p38 + 1 <= p131)))",
"processed_size": 25,
"rewrites": 31
},
"result":
{
"edges": 24,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((((p73 + 1 <= p127) R (p82 + 1 <= p40)) AND F (((p130 + 1 <= p2) R (p82 + 1 <= p40)))))",
"processed_size": 90,
"rewrites": 31
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 28720,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(*) AND **) : X(F(**)) : (((F(**) AND **) U **) OR X(**)) : F(G(*)) : F(((* R *) AND F((* R *)))) : (X(X(G(**))) AND F(**))"
},
"net":
{
"arcs": 3119,
"conflict_clusters": 68,
"places": 1398,
"places_significant": 295,
"singleton_clusters": 0,
"transitions": 296
},
"result":
{
"preliminary_value": "no yes no no no no ",
"value": "no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1694/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 44736
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: (NOT(X ((X (F (((1 <= 0) U ((1 <= 0) U (0 <= 0))))) AND (p1310 + p1311 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 <= p149)))) AND (p1310 + p1311 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 <= p149)) : NOT(X (NOT(((p1381 + p1380 + p1379 + p1378 + p1376 + p1374 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1375 + p1377 + p1385 + p1386 + p1387 + p1388 + p1389 <= p149) U F ((p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1330 + p1331 + p1332 + p1333 <= p129)))))) : (((F ((2 <= p40 + p39 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21)) AND (2 <= p40 + p39 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21)) U (p1309 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p96 + p94 + p93)) OR X ((p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1330 + p1331 + p1332 + p1333 + 1 <= p100 + p98 + p97 + p95 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p80 + p79 + p78 + p77 + p99))) : NOT(G (F ((p131 <= p38)))) : F ((NOT(((p127 <= p73) U (p40 <= p82))) AND F (NOT(((p2 <= p130) U (p40 <= p82)))))) : (X (X (G ((p1309 <= p1312)))) AND ((0 <= 0) U F ((1 <= p852))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p149 + 1 <= p1310 + p1311 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329)) AND (p1310 + p1311 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 <= p149))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1310 + p1311 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 <= p149)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1310 + p1311 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 <= p149)
lola: processed formula length: 159
lola: 31 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p149 + 1 <= p1310 + p1311 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p149 + 1 <= p1310 + p1311 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329))
lola: processed formula length: 167
lola: 31 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1330 + p1331 + p1332 + p1333 <= p129)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1330 + p1331 + p1332 + p1333 <= p129)))
lola: processed formula length: 167
lola: 31 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((F ((2 <= p40 + p39 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21)) AND (2 <= p40 + p39 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21)) U (p1309 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p96 + p94 + p93)) OR X ((p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((2 <= p40 + p39 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21)) AND (2 <= p40 + p39 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21)) U (p1309 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p96 + p94 + p93))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((2 <= p40 + p39 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21)) AND (2 <= p40 + p39 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21)) U (p1309 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p96 + p94 + p93))
lola: processed formula length: 390
lola: 31 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 28 edges
lola: ========================================
lola: subprocess 3 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1330 + p1331 + p1332 + p1333 + 1 <= p100 + p98 + p97 + p95 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p80 + p79 + p78 + p77 + p99))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1330 + p1331 + p1332 + p1333 + 1 <= p100 + p98 + p97 + p95 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p80 + p79 + p78 + p77 + p99))
lola: processed formula length: 275
lola: 31 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((p1309 <= p1312)))) AND F ((1 <= p852)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p852))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p852 <= 0)
lola: processed formula length: 11
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 29 markings, 28 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p38 + 1 <= p131)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p38 + 1 <= p131)))
lola: processed formula length: 25
lola: 31 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 24 edges
lola: ========================================
lola: subprocess 5 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p73 + 1 <= p127) R (p82 + 1 <= p40)) AND F (((p130 + 1 <= p2) R (p82 + 1 <= p40)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p73 + 1 <= p127) R (p82 + 1 <= p40)) AND F (((p130 + 1 <= p2) R (p82 + 1 <= p40)))))
lola: processed formula length: 90
lola: 31 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 28 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no
lola:
preliminary result: no yes no no no no
lola: memory consumption: 28720 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
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="QuasiCertifProtocol-PT-18"
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 QuasiCertifProtocol-PT-18, 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 r176-tajo-158987872400801"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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