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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 3.1K May 14 03:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 20:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 20:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.7K May 13 14:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:55 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 136K 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-050A-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-050A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591340507924

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 07:01:49] [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 07:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 07:01:49] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2020-06-05 07:01:49] [INFO ] Transformed 403 places.
[2020-06-05 07:01:49] [INFO ] Transformed 403 transitions.
[2020-06-05 07:01:49] [INFO ] Found NUPN structural information;
[2020-06-05 07:01:49] [INFO ] Parsed PT model containing 403 places and 403 transitions in 130 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 447 ms. (steps per millisecond=223 ) properties seen :[0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1]
// Phase 1: matrix 402 rows 403 cols
[2020-06-05 07:01:50] [INFO ] Computed 201 place invariants in 28 ms
[2020-06-05 07:01:50] [INFO ] [Real]Absence check using 201 positive place invariants in 105 ms returned sat
[2020-06-05 07:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:51] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2020-06-05 07:01:51] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 45 ms.
[2020-06-05 07:01:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:01:51] [INFO ] [Nat]Absence check using 201 positive place invariants in 90 ms returned sat
[2020-06-05 07:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:52] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2020-06-05 07:01:52] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 32 ms.
[2020-06-05 07:01:55] [INFO ] Added : 397 causal constraints over 80 iterations in 3933 ms. Result :sat
[2020-06-05 07:01:56] [INFO ] [Real]Absence check using 201 positive place invariants in 86 ms returned sat
[2020-06-05 07:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:56] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2020-06-05 07:01:56] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2020-06-05 07:01:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:01:56] [INFO ] [Nat]Absence check using 201 positive place invariants in 54 ms returned sat
[2020-06-05 07:01:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:57] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2020-06-05 07:01:57] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 43 ms.
[2020-06-05 07:02:00] [INFO ] Added : 396 causal constraints over 80 iterations in 3589 ms. Result :sat
[2020-06-05 07:02:01] [INFO ] [Real]Absence check using 201 positive place invariants in 86 ms returned sat
[2020-06-05 07:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:01] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2020-06-05 07:02:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:01] [INFO ] [Nat]Absence check using 201 positive place invariants in 85 ms returned sat
[2020-06-05 07:02:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:02] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2020-06-05 07:02:02] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 44 ms.
[2020-06-05 07:02:04] [INFO ] Added : 398 causal constraints over 81 iterations in 2703 ms. Result :sat
[2020-06-05 07:02:05] [INFO ] [Real]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-06-05 07:02:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:05] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2020-06-05 07:02:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 76 ms returned sat
[2020-06-05 07:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:06] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2020-06-05 07:02:06] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 35 ms.
[2020-06-05 07:02:08] [INFO ] Added : 394 causal constraints over 79 iterations in 2437 ms. Result :sat
[2020-06-05 07:02:08] [INFO ] [Real]Absence check using 201 positive place invariants in 61 ms returned sat
[2020-06-05 07:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:09] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2020-06-05 07:02:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:09] [INFO ] [Nat]Absence check using 201 positive place invariants in 84 ms returned sat
[2020-06-05 07:02:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:09] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2020-06-05 07:02:09] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 32 ms.
[2020-06-05 07:02:12] [INFO ] Added : 395 causal constraints over 79 iterations in 2335 ms. Result :sat
[2020-06-05 07:02:12] [INFO ] [Real]Absence check using 201 positive place invariants in 80 ms returned sat
[2020-06-05 07:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:12] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2020-06-05 07:02:12] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 31 ms.
[2020-06-05 07:02:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:13] [INFO ] [Nat]Absence check using 201 positive place invariants in 86 ms returned sat
[2020-06-05 07:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:13] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2020-06-05 07:02:13] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 40 ms.
[2020-06-05 07:02:16] [INFO ] Added : 394 causal constraints over 80 iterations in 2631 ms. Result :sat
[2020-06-05 07:02:16] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-05 07:02:16] [INFO ] Flatten gal took : 111 ms
[2020-06-05 07:02:16] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-05 07:02:16] [INFO ] Flatten gal took : 49 ms
FORMULA ShieldRVt-PT-050A-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 07:02:16] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-05 07:02:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ShieldRVt-PT-050A @ 3570 seconds

FORMULA ShieldRVt-PT-050A-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldRVt-PT-050A-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-CTLCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-CTLCardinality-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"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 07:02:16 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "A (G (((p55 <= 0))))",
"processed_size": 20,
"rewrites": 20
},
"result":
{
"edges": 45,
"markings": 46,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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 ((((p217 <= 0)) OR ((1 <= p314)))))",
"processed_size": 41,
"rewrites": 20
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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 <= p90)) AND ((p102 <= 0)))",
"processed_size": 32,
"rewrites": 21
},
"result":
{
"edges": 3862,
"markings": 3862,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1154
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G ((((p362 <= 0)) OR ((1 <= p97)))))",
"processed_size": 40,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3314
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": "((p117 <= 0))",
"processed_size": 13,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 <= p313)) AND ((p333 <= 0)))))",
"processed_size": 41,
"rewrites": 19
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"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": "E (F (((1 <= p310) AND (((p190 <= 0)) OR ((1 <= p217))))))",
"processed_size": 59,
"rewrites": 19
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": "((p117 <= 0))",
"processed_size": 13,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": "((p304 <= 0))",
"processed_size": 13,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 <= p313)) AND ((p333 <= 0)))))",
"processed_size": 41,
"rewrites": 19
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"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": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"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": "E (F (((1 <= p310) AND (((p190 <= 0)) OR ((1 <= p217))))))",
"processed_size": 59,
"rewrites": 19
},
"result":
{
"edges": 25,
"markings": 26,
"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"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4064,
"runtime": 503.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(**)) AND (** AND (** AND E(F(*))))) : E((** U DEADLOCK)) : A(G(**)) : A(G(E(F(**)))) : E(F(E(G(**)))) : A(G(*)) : E(G(**))"
},
"net":
{
"arcs": 1704,
"conflict_clusters": 103,
"places": 403,
"places_significant": 202,
"singleton_clusters": 0,
"transitions": 402
},
"result":
{
"preliminary_value": "yes unknown no unknown yes no no ",
"value": "yes unknown no unknown yes 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: 805/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 12896
lola: finding significant places
lola: 403 places, 402 transitions, 202 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: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p310 <= 1)
lola: LP says that atomic proposition is always true: (p304 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p333 <= 1)
lola: LP says that atomic proposition is always true: (p342 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p314 <= 1)
lola: LP says that atomic proposition is always true: (p352 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: (((E (((0 <= 0) U ((1 <= p310) AND (((p190 <= 0)) OR ((1 <= p217)))))) AND ((p304 <= 0))) AND ((p117 <= 0))) AND NOT(A (G ((((p313 <= 0)) OR ((1 <= p333))))))) : E ((((p342 <= 0) OR (p255 <= 0)) U A (X ((1 <= 0))))) : A ((E (G ((1 <= 0))) U A (G ((((p217 <= 0)) OR ((1 <= p314))))))) : A (G (E (F ((((p105 <= 0)) OR ((1 <= p352))))))) : E (F (E (G ((((1 <= p90)) AND ((p102 <= 0))))))) : E (G (NOT(E (F (((1 <= p55))))))) : E (G ((((p362 <= 0)) OR ((1 <= p97)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:184
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: rewrite Frontend/Parser/formula_rewrite.k:476
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p55 <= 0))))
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:788
lola: processed formula: A (G (((p55 <= 0))))
lola: processed formula length: 20
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)
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p55))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p217 <= 0)) OR ((1 <= p314)))))
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 ((((p217 <= 0)) OR ((1 <= p314)))))
lola: processed formula length: 41
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)
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 <= p217)) AND ((p314 <= 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: 26 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((((1 <= p90)) AND ((p102 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (((1 <= p90)) AND ((p102 <= 0)))
lola: processed formula length: 32
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 (state space /EFEG)
lola: state space: using reachability graph (EFEG 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: 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p90 <= 0)) OR ((1 <= p102)))
lola: state equation task get result unparse finished id 0
lola: state equation task get result unparse finished++ id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: formula 1: (((1 <= p90)) AND ((p102 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: write sara problem file to CTLCardinality-2-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-1.sara.
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 3862 markings, 3862 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((p105 <= 0)) OR ((1 <= p352)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((p105 <= 0)) OR ((1 <= p352)))
lola: processed formula length: 33
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: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 <= p105)) AND ((p352 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p105 <= 0)) OR ((1 <= p352)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.

lola: state equation: write sara problem file to CTLCardinality-3-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1698706 markings, 1867352 edges, 339741 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3443314 markings, 3785187 edges, 348922 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 5184118 markings, 5698837 edges, 348161 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 6952850 markings, 7643189 edges, 353746 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 8707601 markings, 9572170 edges, 350950 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 10456839 markings, 11495091 edges, 349848 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 12197046 markings, 13408090 edges, 348041 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 13855474 markings, 15231191 edges, 331686 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 15549105 markings, 17092982 edges, 338726 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 17291814 markings, 19008729 edges, 348542 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 19023548 markings, 20912411 edges, 346347 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 20751622 markings, 22812070 edges, 345615 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 22072914 markings, 24264553 edges, 264258 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 23000040 markings, 25283736 edges, 185425 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 23842889 markings, 26210270 edges, 168570 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 24530697 markings, 26966372 edges, 137562 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 25337175 markings, 27852930 edges, 161296 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 26152216 markings, 28748897 edges, 163008 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 27078725 markings, 29767402 edges, 185302 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 1154 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p362 <= 0)) OR ((1 <= p97)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p362 <= 0)) OR ((1 <= p97)))))
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 / 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:787
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p362)) AND ((p97 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 1732 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p342 <= 0) OR (p255 <= 0)) U DEADLOCK))
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 ((((p342 <= 0) OR (p255 <= 0)) U DEADLOCK))
lola: processed formula length: 46
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 (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: DEADLOCK
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 937661 markings, 1030739 edges, 187532 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 1867661 markings, 2053080 edges, 186000 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 2828602 markings, 3109433 edges, 192188 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 3786368 markings, 4162299 edges, 191553 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 4741876 markings, 5212680 edges, 191102 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 5707034 markings, 6273669 edges, 193032 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 6677617 markings, 7340624 edges, 194117 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 7652012 markings, 8411765 edges, 194879 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 8639330 markings, 9497116 edges, 197464 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 9636709 markings, 10593523 edges, 199476 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 10644102 markings, 11700935 edges, 201479 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 11708614 markings, 12871150 edges, 212902 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 12689301 markings, 13949209 edges, 196137 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 13697432 markings, 15057436 edges, 201626 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 14722689 markings, 16184496 edges, 205051 markings/sec, 70 secs
lola: sara not yet started (preprocessing) || 15797633 markings, 17366173 edges, 214989 markings/sec, 75 secs
lola: sara not yet started (preprocessing) || 16841388 markings, 18513562 edges, 208751 markings/sec, 80 secs
lola: sara not yet started (preprocessing) || 17789524 markings, 19555843 edges, 189627 markings/sec, 85 secs
lola: sara not yet started (preprocessing) || 18811900 markings, 20679723 edges, 204475 markings/sec, 90 secs
lola: sara not yet started (preprocessing) || 19871973 markings, 21845056 edges, 212015 markings/sec, 95 secs
lola: sara not yet started (preprocessing) || 20981827 markings, 23065109 edges, 221971 markings/sec, 100 secs
lola: sara not yet started (preprocessing) || 22052709 markings, 24242365 edges, 214176 markings/sec, 105 secs
lola: sara not yet started (preprocessing) || 22867172 markings, 25137659 edges, 162893 markings/sec, 110 secs
lola: sara not yet started (preprocessing) || 23549197 markings, 25887403 edges, 136405 markings/sec, 115 secs
lola: sara not yet started (preprocessing) || 24210272 markings, 26614111 edges, 132215 markings/sec, 120 secs
lola: sara not yet started (preprocessing) || 25023280 markings, 27507839 edges, 162602 markings/sec, 125 secs
lola: sara not yet started (preprocessing) || 25878308 markings, 28447764 edges, 171006 markings/sec, 130 secs
lola: sara not yet started (preprocessing) || 26553383 markings, 29189868 edges, 135015 markings/sec, 135 secs
lola: sara not yet started (preprocessing) || 27288831 markings, 29998335 edges, 147090 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 3314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p310) AND (((p190 <= 0)) OR ((1 <= p217)))))) AND (((p304 <= 0)) AND (((p117 <= 0)) AND E (F ((((1 <= p313)) AND ((p333 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p117 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p117 <= 0))
lola: processed formula length: 13
lola: 18 rewrites
lola: closed formula file CTLCardinality.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: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p313)) AND ((p333 <= 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 <= p313)) AND ((p333 <= 0)))))
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: 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 <= p313)) AND ((p333 <= 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: 14 markings, 13 edges
lola: ========================================
lola: subprocess 9 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p310) AND (((p190 <= 0)) OR ((1 <= p217))))))
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 <= p310) AND (((p190 <= 0)) OR ((1 <= p217))))))
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: 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 <= p310) AND (((p190 <= 0)) OR ((1 <= p217))))
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
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((p105 <= 0)) OR ((1 <= p352)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((p105 <= 0)) OR ((1 <= p352)))
lola: processed formula length: 33
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: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 <= p105)) AND ((p352 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p105 <= 0)) OR ((1 <= p352)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-7-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: try reading problem file CTLCardinality-7-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1657593 markings, 1822155 edges, 331519 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3449336 markings, 3791805 edges, 358349 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 5262195 markings, 5784665 edges, 362572 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 7067728 markings, 7769475 edges, 361107 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 8866694 markings, 9747062 edges, 359793 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 10662828 markings, 11721542 edges, 359227 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 12361706 markings, 13589102 edges, 339776 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 14000351 markings, 15390448 edges, 327729 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 15626835 markings, 17178434 edges, 325297 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 17385470 markings, 19111684 edges, 351727 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 19170504 markings, 21073961 edges, 357007 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 20956644 markings, 23037448 edges, 357228 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 22192626 markings, 24396150 edges, 247196 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 23349846 markings, 25668274 edges, 231444 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 24357195 markings, 26775645 edges, 201470 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 25025226 markings, 27510009 edges, 133606 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 25944375 markings, 28520421 edges, 183830 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 26997568 markings, 29678183 edges, 210639 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 27144214 markings, 29839392 edges, 29329 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((((p342 <= 0) OR (p255 <= 0)) U DEADLOCK))
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 ((((p342 <= 0) OR (p255 <= 0)) U DEADLOCK))
lola: processed formula length: 46
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 (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: DEADLOCK
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 992933 markings, 1091493 edges, 198587 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 2055836 markings, 2259940 edges, 212581 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 3049707 markings, 3352492 edges, 198774 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 4124256 markings, 4533733 edges, 214910 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 5204681 markings, 5721439 edges, 216085 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 6295029 markings, 6920045 edges, 218070 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 7382211 markings, 8115174 edges, 217436 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 8471536 markings, 9312663 edges, 217865 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 9561666 markings, 10511029 edges, 218026 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 10646724 markings, 11703822 edges, 217012 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 11756511 markings, 12923803 edges, 221957 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 12839424 markings, 14114238 edges, 216583 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 13930389 markings, 15313525 edges, 218193 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 15026698 markings, 16518688 edges, 219262 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 16095584 markings, 17693704 edges, 213777 markings/sec, 70 secs
lola: sara not yet started (preprocessing) || 17178293 markings, 18883916 edges, 216542 markings/sec, 75 secs
lola: sara not yet started (preprocessing) || 18273823 markings, 20088224 edges, 219106 markings/sec, 80 secs
lola: sara not yet started (preprocessing) || 19371388 markings, 21294767 edges, 219513 markings/sec, 85 secs
lola: sara not yet started (preprocessing) || 20464711 markings, 22496646 edges, 218665 markings/sec, 90 secs
lola: sara not yet started (preprocessing) || 21562533 markings, 23703470 edges, 219564 markings/sec, 95 secs
lola: sara not yet started (preprocessing) || 22515150 markings, 24750703 edges, 190523 markings/sec, 100 secs
lola: sara not yet started (preprocessing) || 23085598 markings, 25377811 edges, 114090 markings/sec, 105 secs
lola: sara not yet started (preprocessing) || 23754044 markings, 26112641 edges, 133689 markings/sec, 110 secs
lola: sara not yet started (preprocessing) || 24229224 markings, 26634942 edges, 95036 markings/sec, 115 secs
lola: sara not yet started (preprocessing) || 24804922 markings, 27267822 edges, 115140 markings/sec, 120 secs
lola: sara not yet started (preprocessing) || 25442835 markings, 27969051 edges, 127583 markings/sec, 125 secs
lola: sara not yet started (preprocessing) || 26175538 markings, 28774506 edges, 146541 markings/sec, 130 secs
lola: sara not yet started (preprocessing) || 26895440 markings, 29565889 edges, 143980 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p310) AND (((p190 <= 0)) OR ((1 <= p217)))))) AND (((p304 <= 0)) AND (((p117 <= 0)) AND E (F ((((1 <= p313)) AND ((p333 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p117 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p117 <= 0))
lola: processed formula length: 13
lola: 18 rewrites
lola: closed formula file CTLCardinality.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: ========================================
lola: ...considering subproblem: ((p304 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p304 <= 0))
lola: processed formula length: 13
lola: 18 rewrites
lola: closed formula file CTLCardinality.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: ========================================
lola: ...considering subproblem: E (F ((((1 <= p313)) AND ((p333 <= 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 <= p313)) AND ((p333 <= 0)))))
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: 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 <= p313)) AND ((p333 <= 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: 14 markings, 13 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p310) AND (((p190 <= 0)) OR ((1 <= p217))))))
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 <= p310) AND (((p190 <= 0)) OR ((1 <= p217))))))
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: 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 <= p310) AND (((p190 <= 0)) OR ((1 <= p217))))
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
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown no unknown yes no no
lola:
preliminary result: yes unknown no unknown yes no no
lola: memory consumption: 4064 KB
lola: time consumption: 503 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-050A"
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-050A, 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-159033478401067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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