Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853200473.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 ParamProductionCell-PT-1, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853200473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 3.8K Apr 13 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 13 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 13 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 13 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 13 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 13 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 13 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 13 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 13 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 13 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 13 14:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 13 14:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 174K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-1-00
FORMULA_NAME ParamProductionCell-PT-1-01
FORMULA_NAME ParamProductionCell-PT-1-02
FORMULA_NAME ParamProductionCell-PT-1-03
FORMULA_NAME ParamProductionCell-PT-1-04
FORMULA_NAME ParamProductionCell-PT-1-05
FORMULA_NAME ParamProductionCell-PT-1-06
FORMULA_NAME ParamProductionCell-PT-1-07
FORMULA_NAME ParamProductionCell-PT-1-08
FORMULA_NAME ParamProductionCell-PT-1-09
FORMULA_NAME ParamProductionCell-PT-1-10
FORMULA_NAME ParamProductionCell-PT-1-11
FORMULA_NAME ParamProductionCell-PT-1-12
FORMULA_NAME ParamProductionCell-PT-1-13
FORMULA_NAME ParamProductionCell-PT-1-14
FORMULA_NAME ParamProductionCell-PT-1-15

=== Now, execution of the tool begins

BK_START 1591150853419

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:20:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 02:20:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:20:56] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2020-06-03 02:20:56] [INFO ] Transformed 231 places.
[2020-06-03 02:20:56] [INFO ] Transformed 202 transitions.
[2020-06-03 02:20:56] [INFO ] Found NUPN structural information;
[2020-06-03 02:20:56] [INFO ] Parsed PT model containing 231 places and 202 transitions in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 64 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 312 ms. (steps per millisecond=320 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 202 rows 231 cols
[2020-06-03 02:20:56] [INFO ] Computed 59 place invariants in 20 ms
[2020-06-03 02:20:56] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2020-06-03 02:20:56] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 22 ms returned sat
[2020-06-03 02:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:20:56] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2020-06-03 02:20:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:20:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 27 ms returned sat
[2020-06-03 02:20:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-06-03 02:20:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:20:57] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2020-06-03 02:20:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2020-06-03 02:20:57] [INFO ] [Nat]Added 68 Read/Feed constraints in 25 ms returned sat
[2020-06-03 02:20:57] [INFO ] Deduced a trap composed of 7 places in 157 ms
[2020-06-03 02:20:57] [INFO ] Deduced a trap composed of 5 places in 106 ms
[2020-06-03 02:20:57] [INFO ] Deduced a trap composed of 7 places in 235 ms
[2020-06-03 02:20:58] [INFO ] Deduced a trap composed of 5 places in 104 ms
[2020-06-03 02:20:58] [INFO ] Deduced a trap composed of 9 places in 75 ms
[2020-06-03 02:20:58] [INFO ] Deduced a trap composed of 7 places in 69 ms
[2020-06-03 02:20:58] [INFO ] Deduced a trap composed of 10 places in 68 ms
[2020-06-03 02:20:58] [INFO ] Deduced a trap composed of 69 places in 74 ms
[2020-06-03 02:20:58] [INFO ] Deduced a trap composed of 7 places in 74 ms
[2020-06-03 02:20:58] [INFO ] Deduced a trap composed of 11 places in 108 ms
[2020-06-03 02:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1217 ms
[2020-06-03 02:20:58] [INFO ] [Real]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-06-03 02:20:58] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2020-06-03 02:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:20:59] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2020-06-03 02:20:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:20:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned unsat
[2020-06-03 02:20:59] [INFO ] [Real]Absence check using 35 positive place invariants in 30 ms returned sat
[2020-06-03 02:20:59] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2020-06-03 02:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:20:59] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-06-03 02:20:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:20:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned unsat
[2020-06-03 02:20:59] [INFO ] [Real]Absence check using 35 positive place invariants in 27 ms returned sat
[2020-06-03 02:20:59] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-06-03 02:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:20:59] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-06-03 02:20:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:20:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 58 ms returned unsat
[2020-06-03 02:20:59] [INFO ] [Real]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 02:21:00] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2020-06-03 02:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:00] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2020-06-03 02:21:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 02:21:00] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2020-06-03 02:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:00] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2020-06-03 02:21:00] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2020-06-03 02:21:00] [INFO ] Deduced a trap composed of 14 places in 118 ms
[2020-06-03 02:21:00] [INFO ] Deduced a trap composed of 7 places in 110 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 38 places in 159 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 44 places in 99 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 7 places in 91 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 42 places in 117 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 7 places in 105 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 10 places in 81 ms
[2020-06-03 02:21:01] [INFO ] Deduced a trap composed of 7 places in 150 ms
[2020-06-03 02:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1218 ms
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2020-06-03 02:21:02] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-03 02:21:02] [INFO ] Flatten gal took : 115 ms
FORMULA ParamProductionCell-PT-1-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 02:21:02] [INFO ] Applying decomposition
[2020-06-03 02:21:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 02:21:02] [INFO ] Flatten gal took : 29 ms
[2020-06-03 02:21:02] [INFO ] Decomposing Gal with order
[2020-06-03 02:21:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 02:21:02] [INFO ] Removed a total of 156 redundant transitions.
[2020-06-03 02:21:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 02:21:02] [INFO ] Flatten gal took : 427 ms
[2020-06-03 02:21:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 14 ms.
[2020-06-03 02:21:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ParamProductionCell-PT-1-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 02:21:02] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 16 ms.
[2020-06-03 02:21:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ParamProductionCell-PT-1 @ 3570 seconds

FORMULA ParamProductionCell-PT-1-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ ParamProductionCell-PT-1

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((X (G ((((p18 <= 0)) OR ((1 <= p118))))) OR (((p18 <= 0)) OR ((1 <= p118)))))",
"processed_size": 81,
"rewrites": 20
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((((p210 <= 0)) OR ((1 <= p26)))))",
"processed_size": 40,
"rewrites": 20
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((((1 <= p126)) AND ((p228 <= 0))))))",
"processed_size": 45,
"rewrites": 20
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X ((((1 <= p139)) AND ((p145 <= 0)))) OR (((1 <= p228)) OR ((1 <= p41)))))",
"processed_size": 78,
"rewrites": 20
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "G (F ((((p71 <= 0)) OR ((1 <= p117)))))",
"processed_size": 40,
"rewrites": 20
},
"result":
{
"edges": 164,
"markings": 164,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 23196,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((X(G(**)) OR (** OR **))) : X(F(**)) : G(F(*)) : (* OR X(X(G(*)))) : F((X(*) OR (** OR **)))"
},
"net":
{
"arcs": 846,
"conflict_clusters": 59,
"places": 231,
"places_significant": 172,
"singleton_clusters": 0,
"transitions": 202
},
"result":
{
"preliminary_value": "no yes yes no yes ",
"value": "no yes yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 433/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 231
lola: finding significant places
lola: 231 places, 202 transitions, 172 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: G (((X (G ((((p18 <= 0)) OR ((1 <= p118))))) OR ((p18 <= 0))) OR ((1 <= p118)))) : F (X ((((p210 <= 0)) OR ((1 <= p26))))) : F (NOT(F (G (X ((((1 <= p71)) AND ((p117 <= 0)))))))) : (NOT(((1 <= 0) U (((p200 <= 0)) OR ((1 <= p122))))) OR NOT(X (F (X ((((p126 <= 0)) OR ((1 <= p228)))))))) : F (((NOT(X ((((p139 <= 0)) OR ((1 <= p145))))) OR ((1 <= p228))) OR ((1 <= p41))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((((p18 <= 0)) OR ((1 <= p118))))) OR (((p18 <= 0)) OR ((1 <= p118)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((((p18 <= 0)) OR ((1 <= p118))))) OR (((p18 <= 0)) OR ((1 <= p118)))))
lola: processed formula length: 81
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 260 markings, 260 edges
lola: ========================================
lola: subprocess 1 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p210 <= 0)) OR ((1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p210 <= 0)) OR ((1 <= p26)))))
lola: processed formula length: 40
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p200)) AND ((p122 <= 0))) OR X (X (G ((((1 <= p126)) AND ((p228 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p200)) AND ((p122 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p200)) AND ((p122 <= 0)))
lola: processed formula length: 33
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p126)) AND ((p228 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p126)) AND ((p228 <= 0))))))
lola: processed formula length: 45
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 260 markings, 260 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 3 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((((1 <= p139)) AND ((p145 <= 0)))) OR (((1 <= p228)) OR ((1 <= p41)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((((1 <= p139)) AND ((p145 <= 0)))) OR (((1 <= p228)) OR ((1 <= p41)))))
lola: processed formula length: 78
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 4 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p71 <= 0)) OR ((1 <= p117)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p71 <= 0)) OR ((1 <= p117)))))
lola: processed formula length: 40
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: lola: STORE========================================

lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 164 markings, 164 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no yes
lola:
preliminary result: no yes yes no yes
lola: memory consumption: 23196 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-1"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ParamProductionCell-PT-1, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987853200473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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