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.r211-tajo-159033478301051.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 ShieldRVt-PT-040A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478301051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 4.0K May 14 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 20:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 20:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 09:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 109K May 12 20:42 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 ShieldRVt-PT-040A-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-040A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591339323929

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:42:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 06:42:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:42:05] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2020-06-05 06:42:05] [INFO ] Transformed 323 places.
[2020-06-05 06:42:05] [INFO ] Transformed 323 transitions.
[2020-06-05 06:42:05] [INFO ] Found NUPN structural information;
[2020-06-05 06:42:05] [INFO ] Parsed PT model containing 323 places and 323 transitions in 140 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 509 ms. (steps per millisecond=196 ) properties seen :[0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 322 rows 323 cols
[2020-06-05 06:42:06] [INFO ] Computed 161 place invariants in 16 ms
[2020-06-05 06:42:06] [INFO ] [Real]Absence check using 161 positive place invariants in 77 ms returned sat
[2020-06-05 06:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:07] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2020-06-05 06:42:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:07] [INFO ] [Nat]Absence check using 161 positive place invariants in 72 ms returned sat
[2020-06-05 06:42:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:07] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2020-06-05 06:42:07] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 54 ms.
[2020-06-05 06:42:09] [INFO ] Added : 318 causal constraints over 65 iterations in 1729 ms. Result :sat
[2020-06-05 06:42:09] [INFO ] [Real]Absence check using 161 positive place invariants in 59 ms returned sat
[2020-06-05 06:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:09] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2020-06-05 06:42:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:09] [INFO ] [Nat]Absence check using 161 positive place invariants in 46 ms returned sat
[2020-06-05 06:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:10] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2020-06-05 06:42:10] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 26 ms.
[2020-06-05 06:42:12] [INFO ] Added : 318 causal constraints over 64 iterations in 1881 ms. Result :sat
[2020-06-05 06:42:12] [INFO ] [Real]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-06-05 06:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:12] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2020-06-05 06:42:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:12] [INFO ] [Nat]Absence check using 161 positive place invariants in 58 ms returned sat
[2020-06-05 06:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:13] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2020-06-05 06:42:13] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 33 ms.
[2020-06-05 06:42:15] [INFO ] Added : 314 causal constraints over 63 iterations in 2294 ms. Result :sat
[2020-06-05 06:42:15] [INFO ] [Real]Absence check using 161 positive place invariants in 66 ms returned sat
[2020-06-05 06:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:15] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2020-06-05 06:42:15] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 24 ms.
[2020-06-05 06:42:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:16] [INFO ] [Nat]Absence check using 161 positive place invariants in 73 ms returned sat
[2020-06-05 06:42:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:16] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2020-06-05 06:42:16] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:42:17] [INFO ] Added : 316 causal constraints over 64 iterations in 1541 ms. Result :sat
[2020-06-05 06:42:18] [INFO ] [Real]Absence check using 161 positive place invariants in 49 ms returned sat
[2020-06-05 06:42:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:18] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2020-06-05 06:42:18] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 37 ms.
[2020-06-05 06:42:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:18] [INFO ] [Nat]Absence check using 161 positive place invariants in 48 ms returned sat
[2020-06-05 06:42:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:18] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2020-06-05 06:42:18] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 25 ms.
[2020-06-05 06:42:20] [INFO ] Added : 316 causal constraints over 64 iterations in 2025 ms. Result :sat
[2020-06-05 06:42:20] [INFO ] [Real]Absence check using 161 positive place invariants in 64 ms returned sat
[2020-06-05 06:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:21] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2020-06-05 06:42:21] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 23 ms.
[2020-06-05 06:42:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:21] [INFO ] [Nat]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-06-05 06:42:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:21] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2020-06-05 06:42:21] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 23 ms.
[2020-06-05 06:42:23] [INFO ] Added : 314 causal constraints over 63 iterations in 1679 ms. Result :sat
[2020-06-05 06:42:23] [INFO ] [Real]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-06-05 06:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:23] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2020-06-05 06:42:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:24] [INFO ] [Nat]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-06-05 06:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:24] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2020-06-05 06:42:24] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:42:26] [INFO ] Added : 319 causal constraints over 64 iterations in 1567 ms. Result :sat
[2020-06-05 06:42:26] [INFO ] [Real]Absence check using 161 positive place invariants in 72 ms returned sat
[2020-06-05 06:42:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:26] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2020-06-05 06:42:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:26] [INFO ] [Nat]Absence check using 161 positive place invariants in 67 ms returned sat
[2020-06-05 06:42:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:27] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2020-06-05 06:42:27] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2020-06-05 06:42:28] [INFO ] Added : 319 causal constraints over 65 iterations in 1924 ms. Result :sat
[2020-06-05 06:42:29] [INFO ] [Real]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-06-05 06:42:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:29] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2020-06-05 06:42:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:29] [INFO ] [Nat]Absence check using 161 positive place invariants in 65 ms returned sat
[2020-06-05 06:42:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:29] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2020-06-05 06:42:29] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 25 ms.
[2020-06-05 06:42:31] [INFO ] Added : 316 causal constraints over 64 iterations in 1923 ms. Result :sat
[2020-06-05 06:42:32] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-05 06:42:32] [INFO ] Flatten gal took : 160 ms
[2020-06-05 06:42:32] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-05 06:42:32] [INFO ] Flatten gal took : 40 ms
FORMULA ShieldRVt-PT-040A-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 06:42:32] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-05 06:42:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ShieldRVt-PT-040A @ 3570 seconds

FORMULA ShieldRVt-PT-040A-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLCardinality-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2836
rslt: Output for CTLCardinality @ ShieldRVt-PT-040A

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 06:42:32 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 423
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"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": "(((1 <= p215)) AND ((p77 <= 0)))",
"processed_size": 32,
"rewrites": 19
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 549
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((((p260 <= 0)) OR ((1 <= p125)) OR ((1 <= p290))) AND (((p230 <= 0)) OR ((1 <= p75)) OR ((1 <= p33))) AND (((1 <= p305)) OR ((1 <= p53))))))",
"processed_size": 152,
"rewrites": 18
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 54,
"problems": 18
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 797
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AG(E(((1 <= p164)) U (((p60 <= 0)) OR ((1 <= p125)))))",
"processed_size": 55,
"rewrites": 19
},
"net":
{
"conflict_clusters": 83,
"singleton_clusters": 0
},
"result":
{
"edges": 201,
"markings": 76,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1063
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(NOT DEADLOCK AND (((p75 <= 0)) OR ((1 <= p77))))",
"processed_size": 50,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (((((p317 <= 0)) OR ((1 <= p138))) U ((1 <= p259) AND (((p34 <= 0)) OR ((1 <= p69))))))",
"processed_size": 91,
"rewrites": 20
},
"result":
{
"edges": 94,
"markings": 95,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"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": "(((1 <= p249)) AND ((p52 <= 0)))",
"processed_size": 32,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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": "A (G ((((p58 <= 0)) OR ((1 <= p181)))))",
"processed_size": 40,
"rewrites": 19
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"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": "(((1 <= p88)) AND ((p253 <= 0)))",
"processed_size": 32,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"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": "(((1 <= p229)) AND ((p41 <= 0)))",
"processed_size": 32,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"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": "E (F ((((1 <= p111)) AND ((p242 <= 0)))))",
"processed_size": 41,
"rewrites": 18
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((((1 <= p280)) U (((p217 <= 0)) OR ((1 <= p107)))))",
"processed_size": 55,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"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": "(((1 <= p88)) AND ((p253 <= 0)))",
"processed_size": 32,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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": "(((p150 <= 0)) OR ((1 <= p145)))",
"processed_size": 33,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"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": "(((1 <= p229)) AND ((p41 <= 0)))",
"processed_size": 32,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"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": "E (F ((((1 <= p111)) AND ((p242 <= 0)))))",
"processed_size": 41,
"rewrites": 18
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((((1 <= p280)) U (((p217 <= 0)) OR ((1 <= p107)))))",
"processed_size": 55,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3632,
"runtime": 734.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(**)) AND (A(G(**)) OR **)) : E(F(A(X(**)))) : A(G(E((** U **)))) : E(F(A(X(**)))) : (E((** U **)) AND (NODEADLOCK AND **)) : E(X(E(F(**)))) : (A((** U **)) AND (E(F(*)) AND (** AND (A(F(**)) OR **)))) : E(F(A(G(*)))) : A(G(E(X(**)))) : E(F(**))"
},
"net":
{
"arcs": 1364,
"conflict_clusters": 83,
"places": 323,
"places_significant": 162,
"singleton_clusters": 0,
"transitions": 322
},
"result":
{
"preliminary_value": "no unknown no unknown yes yes yes unknown unknown yes ",
"value": "no unknown no unknown yes yes yes unknown unknown yes "
},
"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: 645/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 10336
lola: finding significant places
lola: 323 places, 322 transitions, 162 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p242 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p290 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p305 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: (E (((((p179 <= 0)) OR ((1 <= p9)) OR ((p178 <= 0)) OR ((1 <= p96))) U (1 <= 0))) OR (E (F (((((p216 <= 0)) OR ((1 <= p272))) AND (((p175 <= 0)) OR ((1 <= p212)))))) AND (A (G ((((p58 <= 0)) OR ((1 <= p181))))) OR (((1 <= p249)) AND ((p52 <= 0)))))) : E (F (A (X (((1 <= p205) AND (((p152 <= 0)) OR ((1 <= p260)))))))) : A (G (E ((((1 <= p164)) U (((p60 <= 0)) OR ((1 <= p125))))))) : E (F (A (X (((1 <= p81) AND (((p124 <= 0)) OR ((1 <= p148)))))))) : ((E (((((p317 <= 0)) OR ((1 <= p138))) U ((1 <= p259) AND (((p34 <= 0)) OR ((1 <= p69)))))) AND E (X ((0 <= 0)))) AND (((p75 <= 0)) OR ((1 <= p77)))) : E (F (E (X ((((1 <= p215)) AND ((p77 <= 0))))))) : (((A ((((1 <= p280)) U (((p217 <= 0)) OR ((1 <= p107))))) AND NOT(A (G ((((p111 <= 0)) OR ((1 <= p242))))))) AND (((p150 <= 0)) OR ((1 <= p145)))) AND (A (F ((((p229 <= 0)) OR ((1 <= p41))))) OR (((1 <= p88)) AND ((p253 <= 0))))) : E (F (NOT(E (F (((1 <= p289))))))) : A (G (E (X ((((p240 <= 0)) OR ((1 <= p178))))))) : E (F (((((p260 <= 0)) OR ((1 <= p125)) OR ((1 <= p290))) AND (((p230 <= 0)) OR ((1 <= p75)) OR ((1 <= p33))) AND (((1 <= p305)) OR ((1 <= p53))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p205) AND (((p152 <= 0)) OR ((1 <= p260))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= p205) AND (((p152 <= 0)) OR ((1 <= p260))))))
lola: processed formula length: 59
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 792449 markings, 871115 edges, 158490 markings/sec, 0 secs
lola: 1598825 markings, 1757554 edges, 161275 markings/sec, 5 secs
lola: 2444629 markings, 2687343 edges, 169161 markings/sec, 10 secs
lola: 3279760 markings, 3605391 edges, 167026 markings/sec, 15 secs
lola: 4147587 markings, 4559388 edges, 173565 markings/sec, 20 secs
lola: 5043924 markings, 5544724 edges, 179267 markings/sec, 25 secs
lola: 6475401 markings, 7118333 edges, 286295 markings/sec, 30 secs
lola: 8082127 markings, 8884592 edges, 321345 markings/sec, 35 secs
lola: 9697680 markings, 10660554 edges, 323111 markings/sec, 40 secs
lola: 11296483 markings, 12418103 edges, 319761 markings/sec, 45 secs
lola: 12901594 markings, 14182589 edges, 321022 markings/sec, 50 secs
lola: 14393475 markings, 15822782 edges, 298376 markings/sec, 55 secs
lola: 15087051 markings, 16585221 edges, 138715 markings/sec, 60 secs
lola: 15848493 markings, 17422256 edges, 152288 markings/sec, 65 secs
lola: 16423611 markings, 18054401 edges, 115024 markings/sec, 70 secs
lola: 17206943 markings, 18915419 edges, 156666 markings/sec, 75 secs
lola: 17955469 markings, 19738345 edges, 149705 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p81) AND (((p124 <= 0)) OR ((1 <= p148))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= p81) AND (((p124 <= 0)) OR ((1 <= p148))))))
lola: processed formula length: 58
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1125259 markings, 1236969 edges, 225052 markings/sec, 0 secs
lola: 2385710 markings, 2622573 edges, 252090 markings/sec, 5 secs
lola: 3781766 markings, 4157244 edges, 279211 markings/sec, 10 secs
lola: 5132462 markings, 5642052 edges, 270139 markings/sec, 15 secs
lola: 6390857 markings, 7025397 edges, 251679 markings/sec, 20 secs
lola: 7606618 markings, 8361870 edges, 243152 markings/sec, 25 secs
lola: 8978390 markings, 9869845 edges, 274354 markings/sec, 30 secs
lola: 10335436 markings, 11361635 edges, 271409 markings/sec, 35 secs
lola: 11608456 markings, 12761055 edges, 254604 markings/sec, 40 secs
lola: 12987898 markings, 14277464 edges, 275888 markings/sec, 45 secs
lola: 14302760 markings, 15722886 edges, 262972 markings/sec, 50 secs
lola: 15219123 markings, 16730436 edges, 183273 markings/sec, 55 secs
lola: 15725480 markings, 17286919 edges, 101271 markings/sec, 60 secs
lola: 16288601 markings, 17906183 edges, 112624 markings/sec, 65 secs
lola: 16732925 markings, 18394335 edges, 88865 markings/sec, 70 secs
lola: 17196695 markings, 18904151 edges, 92754 markings/sec, 75 secs
lola: 17883181 markings, 19658797 edges, 137297 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((((1 <= p215)) AND ((p77 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (((1 <= p215)) AND ((p77 <= 0)))
lola: processed formula length: 32
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p215)) AND ((p77 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 15 markings, 14 edges
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
lola: subprocess 3 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((((p240 <= 0)) OR ((1 <= p178)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: ========================================
lola: processed formula: AG(EX((((p240 <= 0)) OR ((1 <= p178)))))
lola: processed formula length: 41
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic
lola: 1260203 markings, 1385311 edges, 252041 markings/sec, 0 secs
lola: 2705986 markings, 2974648 edges, 289157 markings/sec, 5 secs
lola: 4199767 markings, 4616751 edges, 298756 markings/sec, 10 secs
lola: 5612407 markings, 6169650 edges, 282528 markings/sec, 15 secs
lola: 7102052 markings, 7807204 edges, 297929 markings/sec, 20 secs
lola: 8567223 markings, 9417854 edges, 293034 markings/sec, 25 secs
lola: 10055384 markings, 11053779 edges, 297632 markings/sec, 30 secs
lola: 11579356 markings, 12729061 edges, 304794 markings/sec, 35 secs
lola: 13067910 markings, 14365415 edges, 297711 markings/sec, 40 secs
lola: 14391514 markings, 15820446 edges, 264721 markings/sec, 45 secs
lola: 14877304 markings, 16354698 edges, 97158 markings/sec, 50 secs
lola: 15515469 markings, 17056313 edges, 127633 markings/sec, 55 secs
lola: 16023131 markings, 17614066 edges, 101532 markings/sec, 60 secs
lola: 16726401 markings, 18387175 edges, 140654 markings/sec, 65 secs
lola: 17127665 markings, 18828272 edges, 80253 markings/sec, 70 secs
lola: 17583133 markings, 19328960 edges, 91094 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((p260 <= 0)) OR ((1 <= p125)) OR ((1 <= p290))) AND (((p230 <= 0)) OR ((1 <= p75)) OR ((1 <= p33))) AND (((1 <= p305)) OR ((1 <= p53))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((((p260 <= 0)) OR ((1 <= p125)) OR ((1 <= p290))) AND (((p230 <= 0)) OR ((1 <= p75)) OR ((1 <= p33))) AND (((1 <= p305)) OR ((1 <= p53))))))
lola: processed formula length: 152
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((p260 <= 0)) OR ((1 <= p125)) OR ((1 <= p290))) AND (((p230 <= 0)) OR ((1 <= p75)) OR ((1 <= p33))) AND (((1 <= p305)) OR ((1 <= p53))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 54 literals and 18 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p289 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p289))
lola: processed formula length: 13
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p289))
lola: state equation task get result unparse finished id 1
lola: state equation task get result started, id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p289 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: try reading problem file CTLCardinality-5-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1899811 markings, 2088427 edges, 379962 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3781489 markings, 4156940 edges, 376336 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 5636538 markings, 6196177 edges, 371010 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 7529491 markings, 8277084 edges, 378591 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 9452084 markings, 10390576 edges, 384519 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 11532058 markings, 12677067 edges, 415995 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 13614903 markings, 14966718 edges, 416569 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 15679000 markings, 17235763 edges, 412819 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 17677223 markings, 19432392 edges, 399645 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 19722654 markings, 21680918 edges, 409086 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 21781196 markings, 23943852 edges, 411708 markings/sec, 50 secs

lola: sara is running 55 secs || sara is running 55 secs || 23866688 markings, 26236415 edges, 417098 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 25919489 markings, 28493040 edges, 410560 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 27973120 markings, 30750579 edges, 410726 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 29117172 markings, 32008226 edges, 228810 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 30244422 markings, 33247405 edges, 225450 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 31191959 markings, 34289016 edges, 189507 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 32178462 markings, 35373471 edges, 197301 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 33484882 markings, 36809610 edges, 261284 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 34452089 markings, 37872857 edges, 193441 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 797 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E ((((1 <= p164)) U (((p60 <= 0)) OR ((1 <= p125)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E(((1 <= p164)) U (((p60 <= 0)) OR ((1 <= p125)))))
lola: processed formula length: 55
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 76 markings, 201 edges
lola: ========================================
lola: subprocess 7 will run for 1063 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((((p317 <= 0)) OR ((1 <= p138))) U ((1 <= p259) AND (((p34 <= 0)) OR ((1 <= p69)))))) AND (NOT DEADLOCK AND (((p75 <= 0)) OR ((1 <= p77)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1063 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK AND (((p75 <= 0)) OR ((1 <= p77))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (NOT DEADLOCK AND (((p75 <= 0)) OR ((1 <= p77))))
lola: processed formula length: 50
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 8 will run for 1594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p317 <= 0)) OR ((1 <= p138))) U ((1 <= p259) AND (((p34 <= 0)) OR ((1 <= p69))))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((p317 <= 0)) OR ((1 <= p138))) U ((1 <= p259) AND (((p34 <= 0)) OR ((1 <= p69))))))
lola: processed formula length: 91
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p259) AND (((p34 <= 0)) OR ((1 <= p69))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 95 markings, 94 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 1594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((((p216 <= 0)) OR ((1 <= p272))) AND (((p175 <= 0)) OR ((1 <= p212)))))) AND (A (G ((((p58 <= 0)) OR ((1 <= p181))))) OR (((1 <= p249)) AND ((p52 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p249)) AND ((p52 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p249)) AND ((p52 <= 0)))
lola: processed formula length: 32
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 3189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p58 <= 0)) OR ((1 <= p181)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p58 <= 0)) OR ((1 <= p181)))))
lola: processed formula length: 40
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p58)) AND ((p181 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((1 <= p280)) U (((p217 <= 0)) OR ((1 <= p107))))) AND (E (F ((((1 <= p111)) AND ((p242 <= 0))))) AND ((((p150 <= 0)) OR ((1 <= p145))) AND (A (F ((((p229 <= 0)) OR ((1 <= p41))))) OR (((1 <= p88)) AND ((p253 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p88)) AND ((p253 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p88)) AND ((p253 <= 0)))
lola: processed formula length: 32
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p229 <= 0)) OR ((1 <= p41)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p229)) AND ((p41 <= 0)))
lola: processed formula length: 32
lola: 20 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p229 <= 0)) OR ((1 <= p41)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p111)) AND ((p242 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p111)) AND ((p242 <= 0)))))
lola: processed formula length: 41
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p280)) U (((p217 <= 0)) OR ((1 <= p107)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((1 <= p280)) U (((p217 <= 0)) OR ((1 <= p107)))))
lola: processed formula length: 55
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
lola: SUBRESULT
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p280))
lola: state equation task get result unparse finished id 0
lola: result: yes
lola: produced by: state space /ER
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p205) AND (((p152 <= 0)) OR ((1 <= p260))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= p205) AND (((p152 <= 0)) OR ((1 <= p260))))))
lola: processed formula length: 59
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 756668 markings, 831781 edges, 151334 markings/sec, 0 secs
lola: 1531073 markings, 1683076 edges, 154881 markings/sec, 5 secs
lola: 2381781 markings, 2618253 edges, 170142 markings/sec, 10 secs
lola: 3221041 markings, 3540843 edges, 167852 markings/sec, 15 secs
lola: 4089737 markings, 4495794 edges, 173739 markings/sec, 20 secs
lola: 4961266 markings, 5453856 edges, 174306 markings/sec, 25 secs
lola: 6271463 markings, 6894142 edges, 262039 markings/sec, 30 secs
lola: 7719681 markings, 8486160 edges, 289644 markings/sec, 35 secs
lola: 9250012 markings, 10168434 edges, 306066 markings/sec, 40 secs
lola: 10685075 markings, 11745985 edges, 287013 markings/sec, 45 secs
lola: 12243373 markings, 13459012 edges, 311660 markings/sec, 50 secs
lola: 13815179 markings, 15186884 edges, 314361 markings/sec, 55 secs
lola: 14821629 markings, 16294775 edges, 201290 markings/sec, 60 secs
lola: 15392024 markings, 16920453 edges, 114079 markings/sec, 65 secs
lola: 16042313 markings, 17635148 edges, 130058 markings/sec, 70 secs
lola: 16837264 markings, 18509092 edges, 158990 markings/sec, 75 secs
lola: 17842035 markings, 19613994 edges, 200954 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p81) AND (((p124 <= 0)) OR ((1 <= p148))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= p81) AND (((p124 <= 0)) OR ((1 <= p148))))))
lola: processed formula length: 58
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1144314 markings, 1257918 edges, 228863 markings/sec, 0 secs
lola: 2476140 markings, 2721981 edges, 266365 markings/sec, 5 secs
lola: 3804619 markings, 4182366 edges, 265696 markings/sec, 10 secs
lola: 5137864 markings, 5647991 edges, 266649 markings/sec, 15 secs
lola: 6458809 markings, 7100090 edges, 264189 markings/sec, 20 secs
lola: 7828078 markings, 8605319 edges, 273854 markings/sec, 25 secs
lola: 9195650 markings, 10108677 edges, 273514 markings/sec, 30 secs
lola: 10535902 markings, 11582009 edges, 268050 markings/sec, 35 secs
lola: 11878552 markings, 13057969 edges, 268530 markings/sec, 40 secs
lola: 13216784 markings, 14529070 edges, 267646 markings/sec, 45 secs
lola: 14401094 markings, 15831118 edges, 236862 markings/sec, 50 secs
lola: 15319081 markings, 16840275 edges, 183597 markings/sec, 55 secs
lola: 15978498 markings, 17564998 edges, 131883 markings/sec, 60 secs
lola: 16565212 markings, 18209970 edges, 117343 markings/sec, 65 secs
lola: 17129744 markings, 18830724 edges, 112906 markings/sec, 70 secs
lola: 17782707 markings, 19548350 edges, 130593 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((((p240 <= 0)) OR ((1 <= p178)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((((p240 <= 0)) OR ((1 <= p178)))))
lola: processed formula length: 41
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1366724 markings, 1502406 edges, 273345 markings/sec, 0 secs
lola: 2920031 markings, 3209948 edges, 310661 markings/sec, 5 secs
lola: 4504785 markings, 4952052 edges, 316951 markings/sec, 10 secs
lola: 6057164 markings, 6658571 edges, 310476 markings/sec, 15 secs
lola: 7613249 markings, 8369157 edges, 311217 markings/sec, 20 secs
lola: 9230097 markings, 10146546 edges, 323370 markings/sec, 25 secs
lola: 10791702 markings, 11863202 edges, 312321 markings/sec, 30 secs
lola: 12328791 markings, 13552917 edges, 307418 markings/sec, 35 secs
lola: 13861870 markings, 15238209 edges, 306616 markings/sec, 40 secs
lola: 15057368 markings, 16552408 edges, 239100 markings/sec, 45 secs
lola: 15976948 markings, 17565116 edges, 183916 markings/sec, 50 secs
lola: 16700045 markings, 18358267 edges, 144619 markings/sec, 55 secs
lola: 17474075 markings, 19210077 edges, 154806 markings/sec, 60 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p289 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p289))
lola: processed formula length: 13
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p289 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p289))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-13-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-1.sara.sara:
try reading problem file CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1755311 markings, 1929583 edges, 351062 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3893736 markings, 4280329 edges, 427685 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 6009149 markings, 6605787 edges, 423083 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 8120468 markings, 8926739 edges, 422264 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 10234369 markings, 11250529 edges, 422780 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 12369921 markings, 13598126 edges, 427110 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 14390108 markings, 15818897 edges, 404037 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 16387153 markings, 18014230 edges, 399409 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 18450637 markings, 20282601 edges, 412697 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 20494608 markings, 22529520 edges, 408794 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 22514756 markings, 24750244 edges, 404030 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 24557773 markings, 26996118 edges, 408603 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 26596611 markings, 29237395 edges, 407768 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 28399462 markings, 31219252 edges, 360570 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 29941505 markings, 32914408 edges, 308409 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 30770636 markings, 33825863 edges, 165826 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 31818872 markings, 34978177 edges, 209647 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 32560683 markings, 35793644 edges, 148362 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 33655357 markings, 36997010 edges, 218935 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 34616597 markings, 38053691 edges, 192248 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A ((((1 <= p280)) U (((p217 <= 0)) OR ((1 <= p107))))) AND (E (F ((((1 <= p111)) AND ((p242 <= 0))))) AND ((((p150 <= 0)) OR ((1 <= p145))) AND (A (F ((((p229 <= 0)) OR ((1 <= p41))))) OR (((1 <= p88)) AND ((p253 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((1 <= p88)) AND ((p253 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p88)) AND ((p253 <= 0)))
lola: processed formula length: 32
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p150 <= 0)) OR ((1 <= p145)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p150 <= 0)) OR ((1 <= p145)))
lola: processed formula length: 33
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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: ========================================
lola: ...considering subproblem: A (F ((((p229 <= 0)) OR ((1 <= p41)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p229)) AND ((p41 <= 0)))
lola: processed formula length: 32
lola: 20 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p229 <= 0)) OR ((1 <= p41)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p111)) AND ((p242 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p111)) AND ((p242 <= 0)))))
lola: processed formula length: 41
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p111)) AND ((p242 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p280)) U (((p217 <= 0)) OR ((1 <= p107)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((1 <= p280)) U (((p217 <= 0)) OR ((1 <= p107)))))
lola: processed formula length: 55
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p280))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no unknown yes yes yes unknown unknown yes
lola:
preliminary result: no unknown no unknown yes yes yes unknown unknown yes
lola: memory consumption: 3632 KB
lola: time consumption: 734 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="ShieldRVt-PT-040A"
export BK_EXAMINATION="CTLCardinality"
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 ShieldRVt-PT-040A, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033478301051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040A.tgz
mv ShieldRVt-PT-040A execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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