About the Execution of ITS-LoLa for RobotManipulation-PT-10000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15744.660 | 3600000.00 | 49899.00 | 20839.10 | ???T?????????T?? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987938700235.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RobotManipulation-PT-10000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938700235
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.8K Apr 12 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 10 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 10 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 23:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 9 23:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 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 RobotManipulation-PT-10000-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-10000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591232217506
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:56:59] [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-04 00:56:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:56:59] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2020-06-04 00:56:59] [INFO ] Transformed 15 places.
[2020-06-04 00:56:59] [INFO ] Transformed 11 transitions.
[2020-06-04 00:56:59] [INFO ] Parsed PT model containing 15 places and 11 transitions in 48 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Incomplete random walk after 100006 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=2500 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 11 rows 15 cols
[2020-06-04 00:56:59] [INFO ] Computed 6 place invariants in 3 ms
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-04 00:56:59] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 2 ms.
[2020-06-04 00:56:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2020-06-04 00:56:59] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 4 ms.
[2020-06-04 00:56:59] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 00:56:59] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:56:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:56:59] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 5 ms.
[2020-06-04 00:56:59] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-04 00:56:59] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:56:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-04 00:56:59] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:56:59] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:56:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:56:59] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 0 ms.
[2020-06-04 00:56:59] [INFO ] Added : 8 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:56:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 00:56:59] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 3 ms.
[2020-06-04 00:56:59] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2020-06-04 00:56:59] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 0 ms.
[2020-06-04 00:56:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2020-06-04 00:56:59] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 0 ms.
[2020-06-04 00:56:59] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:56:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:56:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-04 00:57:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 0 ms.
[2020-06-04 00:57:00] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:57:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:57:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-04 00:57:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:57:00] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 00:57:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:57:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:57:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 3 ms.
[2020-06-04 00:57:00] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 00:57:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:57:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 0 ms.
[2020-06-04 00:57:00] [INFO ] Added : 8 causal constraints over 2 iterations in 4 ms. Result :sat
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned unsat
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:57:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:57:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:57:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 00:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:57:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 00:57:00] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2020-06-04 00:57:00] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-04 00:57:00] [INFO ] Flatten gal took : 18 ms
[2020-06-04 00:57:00] [INFO ] Flatten gal took : 3 ms
[2020-06-04 00:57:00] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-04 00:57:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RobotManipulation-PT-10000 @ 3570 seconds
FORMULA RobotManipulation-PT-10000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-10000-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLCardinality @ RobotManipulation-PT-10000
{
"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": "Thu Jun 4 00:57:00 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX(EF((3 <= p2)))",
"processed_size": 17,
"rewrites": 48
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 5787116,
"markings": 3082751,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 23004,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(**)) : A(F(**)) : E(X(**)) : A(X(E(F(**)))) : E(F(*)) : (E(F(*)) AND E(G(*))) : (A(G(**)) OR (A(F(**)) AND **)) : (A(G(*)) AND A(X(A(G(**))))) : (A(F(*)) AND (E(X(*)) AND **)) : (A(X(*)) AND E(F(*))) : E(F(*)) : (A(G(E(X(**)))) OR (A(G(*)) OR A(X(*)))) : (A(G(**)) AND **) : TRUE : (A(F(**)) OR (E(F(**)) OR (A(G(**)) OR **))) : A(F(E((** U **))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"interim_value": "unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown yes unknown unknown ",
"preliminary_value": "unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown yes unknown unknown "
},
"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: 26/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 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: A (F (((2 <= p4) AND ((3 <= p6) OR ((p14 <= p12) AND (1 <= p7)))))) : A (F ((p8 + 1 <= p7))) : E (X ((p9 <= 2))) : A (X (E (F ((3 <= p2))))) : NOT(A (G (((1 <= p6) OR (3 <= p1) OR (p5 <= p11))))) : (NOT(A (G (((p6 <= p4) OR (p14 <= p1))))) AND NOT(A (F (((p12 <= p0)))))) : (A (G (((3 <= p11) OR (1 <= p4) OR (p14 <= 0)))) OR (A (F ((p4 + 1 <= p8))) AND (1 <= p4))) : (NOT(E (F (((p10 <= p13) AND (p11 <= p7))))) AND A (G (A (X ((2 <= p4)))))) : ((NOT(E (G ((p5 <= p1)))) AND NOT(A (X ((2 <= p13))))) AND ((2 <= p4) OR (p3 + 1 <= p7))) : (NOT(E (X (((1 <= p3) AND (3 <= p7))))) AND NOT(A (G (((p14 <= p8) OR (1 <= p4)))))) : NOT(A (G (A (G ((2 <= p11)))))) : ((A (G (E (X ((p4 <= p0))))) OR NOT(E (F ((p12 <= p6))))) OR NOT(E (X ((3 <= p11))))) : (A (G ((1 <= p4))) AND (2 <= p11)) : A (G ((((p14 <= 2) OR (p2 <= p0)) OR E (G ((0 <= 0)))))) : (((A (F ((1 <= p6))) OR E (F ((p12 <= p10)))) OR A (G (((3 <= p3) OR (3 <= p1))))) OR (1 <= p14)) : A (F (E (((p7 <= p8) U (p4 <= p10)))))
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:398
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:389
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 46 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((3 <= p2)))
lola: processed formula length: 17
lola: 48 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3082751 markings, 5787116 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p13 + 1 <= p10) OR (p7 + 1 <= p11)))) AND A (X (A (G ((2 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown yes unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 23004 KB
lola: time consumption: 261 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: time limit reached - aborting
lola:
preliminary result: unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown yes unknown unknown
lola:
preliminary result: unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown yes unknown unknown
lola: memory consumption: 23004 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16128612 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16128620 kB
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-10000"
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 RobotManipulation-PT-10000, 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 r186-oct2-158987938700235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-10000.tgz
mv RobotManipulation-PT-10000 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 '
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 ;