About the Execution of ITS-LoLa for CloudDeployment-PT-4a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15741.460 | 3600000.00 | 34494.00 | 333.70 | FFFFFFFFFTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806500297.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 CloudDeployment-PT-4a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806500297
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.5K Mar 30 01:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 07:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 156K 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 CloudDeployment-PT-4a-00
FORMULA_NAME CloudDeployment-PT-4a-01
FORMULA_NAME CloudDeployment-PT-4a-02
FORMULA_NAME CloudDeployment-PT-4a-03
FORMULA_NAME CloudDeployment-PT-4a-04
FORMULA_NAME CloudDeployment-PT-4a-05
FORMULA_NAME CloudDeployment-PT-4a-06
FORMULA_NAME CloudDeployment-PT-4a-07
FORMULA_NAME CloudDeployment-PT-4a-08
FORMULA_NAME CloudDeployment-PT-4a-09
FORMULA_NAME CloudDeployment-PT-4a-10
FORMULA_NAME CloudDeployment-PT-4a-11
FORMULA_NAME CloudDeployment-PT-4a-12
FORMULA_NAME CloudDeployment-PT-4a-13
FORMULA_NAME CloudDeployment-PT-4a-14
FORMULA_NAME CloudDeployment-PT-4a-15
=== Now, execution of the tool begins
BK_START 1591277493890
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 13:31:36] [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-04 13:31:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 13:31:37] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2020-06-04 13:31:37] [INFO ] Transformed 141 places.
[2020-06-04 13:31:37] [INFO ] Transformed 475 transitions.
[2020-06-04 13:31:37] [INFO ] Found NUPN structural information;
[2020-06-04 13:31:37] [INFO ] Parsed PT model containing 141 places and 475 transitions in 241 ms.
Ensure Unique test removed 52 transitions
Reduce redundant transitions removed 52 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1631 resets, run finished after 580 ms. (steps per millisecond=172 ) properties seen :[0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0]
[2020-06-04 13:31:37] [INFO ] Flow matrix only has 226 transitions (discarded 197 similar events)
// Phase 1: matrix 226 rows 141 cols
[2020-06-04 13:31:37] [INFO ] Computed 24 place invariants in 15 ms
[2020-06-04 13:31:38] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 30 ms returned sat
[2020-06-04 13:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:38] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2020-06-04 13:31:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 13:31:38] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 21 ms returned unsat
[2020-06-04 13:31:38] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 25 ms returned sat
[2020-06-04 13:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:38] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2020-06-04 13:31:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 13:31:38] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 27 ms returned unsat
[2020-06-04 13:31:39] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 25 ms returned sat
[2020-06-04 13:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:39] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2020-06-04 13:31:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 13:31:39] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 89 ms returned sat
[2020-06-04 13:31:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:39] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2020-06-04 13:31:39] [INFO ] State equation strengthened by 90 read => feed constraints.
[2020-06-04 13:31:39] [INFO ] [Nat]Added 90 Read/Feed constraints in 36 ms returned sat
[2020-06-04 13:31:39] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 73 ms.
[2020-06-04 13:31:40] [INFO ] Added : 158 causal constraints over 32 iterations in 1100 ms. Result :sat
[2020-06-04 13:31:40] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 21 ms returned sat
[2020-06-04 13:31:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:41] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2020-06-04 13:31:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 13:31:41] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned unsat
[2020-06-04 13:31:41] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 23 ms returned sat
[2020-06-04 13:31:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:41] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-04 13:31:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 13:31:41] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 166 ms returned sat
[2020-06-04 13:31:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:41] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2020-06-04 13:31:41] [INFO ] [Nat]Added 90 Read/Feed constraints in 23 ms returned sat
[2020-06-04 13:31:41] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 53 ms.
[2020-06-04 13:31:42] [INFO ] Added : 151 causal constraints over 32 iterations in 966 ms. Result :sat
[2020-06-04 13:31:42] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 15 ms returned sat
[2020-06-04 13:31:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:43] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-04 13:31:43] [INFO ] [Real]Added 90 Read/Feed constraints in 31 ms returned sat
[2020-06-04 13:31:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 13:31:43] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 45 ms returned sat
[2020-06-04 13:31:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:43] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-04 13:31:43] [INFO ] [Nat]Added 90 Read/Feed constraints in 27 ms returned sat
[2020-06-04 13:31:43] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 31 ms.
[2020-06-04 13:31:44] [INFO ] Added : 147 causal constraints over 30 iterations in 828 ms. Result :sat
[2020-06-04 13:31:44] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned sat
[2020-06-04 13:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:44] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2020-06-04 13:31:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 13:31:44] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 21 ms returned unsat
[2020-06-04 13:31:44] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 22 ms returned sat
[2020-06-04 13:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:44] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-06-04 13:31:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 13:31:44] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 89 ms returned sat
[2020-06-04 13:31:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:45] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2020-06-04 13:31:45] [INFO ] [Nat]Added 90 Read/Feed constraints in 38 ms returned sat
[2020-06-04 13:31:45] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 49 ms.
[2020-06-04 13:31:46] [INFO ] Added : 142 causal constraints over 29 iterations in 1220 ms. Result :sat
[2020-06-04 13:31:46] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 22 ms returned sat
[2020-06-04 13:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:46] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2020-06-04 13:31:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 13:31:47] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 275 ms returned sat
[2020-06-04 13:31:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 13:31:47] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2020-06-04 13:31:47] [INFO ] [Nat]Added 90 Read/Feed constraints in 30 ms returned sat
[2020-06-04 13:31:47] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 43 ms.
[2020-06-04 13:31:48] [INFO ] Added : 154 causal constraints over 32 iterations in 1305 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-04 13:31:49] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-04 13:31:49] [INFO ] Flatten gal took : 168 ms
FORMULA CloudDeployment-PT-4a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 13:31:49] [INFO ] Applying decomposition
[2020-06-04 13:31:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 13:31:49] [INFO ] Flatten gal took : 72 ms
[2020-06-04 13:31:49] [INFO ] Decomposing Gal with order
[2020-06-04 13:31:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 13:31:49] [INFO ] Removed a total of 951 redundant transitions.
[2020-06-04 13:31:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 13:31:49] [INFO ] Flatten gal took : 172 ms
[2020-06-04 13:31:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 20 ms.
[2020-06-04 13:31:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CloudDeployment-PT-4a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 13:31:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-04 13:31:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudDeployment-PT-4a @ 3570 seconds
FORMULA CloudDeployment-PT-4a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudDeployment-PT-4a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLCardinality @ CloudDeployment-PT-4a
{
"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": "Thu Jun 4 13:31:50 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F ((((1 <= p17)) AND ((p73 <= 0)))))",
"processed_size": 39,
"rewrites": 33
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p119)) AND ((p85 <= 0)))",
"processed_size": 32,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((((p56 <= 0)) OR ((1 <= p67))))",
"processed_size": 35,
"rewrites": 33
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"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": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 5,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X ((((1 <= p8)) AND ((p9 <= 0)))) U (F ((((p122 <= 0)) OR ((1 <= p14)))) OR X (((1 <= p125))))))",
"processed_size": 101,
"rewrites": 33
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p139))) U X (F ((X (G (((1 <= p139)))) AND F (((1 <= p139))))))))",
"processed_size": 79,
"rewrites": 33
},
"result":
{
"edges": 464,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p31 <= 0)) OR ((1 <= p92)))",
"processed_size": 31,
"rewrites": 35
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F ((((1 <= p29)) AND ((p9 <= 0)))))",
"processed_size": 38,
"rewrites": 33
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "G (((p57 <= 0)))",
"processed_size": 16,
"rewrites": 33
},
"result":
{
"edges": 68109,
"markings": 9228,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((1 <= p63))",
"processed_size": 12,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((G (((p63 <= 0) OR (p94 <= 0))) OR G (((1 <= p63)))))",
"processed_size": 57,
"rewrites": 33
},
"result":
{
"edges": 75778,
"markings": 8493,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 32308,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** OR (G((G(*) OR G(**))) AND F(**))) : G(F(*)) : (F(G(((X(**) OR (** OR **)) AND **))) AND G(F(*))) : (X(**) OR (F((G(**) OR (** OR **))) AND (** AND **))) : G(*) : X((X(*) U (F(**) OR X(**)))) : X((F(**) U X(F((X(G(**)) AND F(**)))))) : F(*)"
},
"net":
{
"arcs": 2481,
"conflict_clusters": 36,
"places": 141,
"places_significant": 117,
"singleton_clusters": 0,
"transitions": 423
},
"result":
{
"preliminary_value": "no no no no no yes no no ",
"value": "no no no no no 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: 564/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 141
lola: finding significant places
lola: 141 places, 423 transitions, 117 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: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: (G ((NOT(F (((1 <= p63) AND (1 <= p94)))) OR G (((1 <= p63))))) U ((1 <= p63))) : F (NOT(F (G (X (F (G ((((p29 <= 0)) OR ((1 <= p9)))))))))) : (F (G ((((X ((((p17 <= 0)) OR ((1 <= p73)))) OR ((p44 <= 0))) OR ((1 <= p28))) AND (((p69 <= 0)) OR ((1 <= p21)))))) AND NOT(F (G (F (G ((((p17 <= 0)) OR ((1 <= p73))))))))) : (X ((((p56 <= 0)) OR ((1 <= p67)))) OR ((F (((G ((((p113 <= 0)) OR ((1 <= p34)))) OR ((p56 <= 0))) OR ((1 <= p67)))) AND ((1 <= p119))) AND ((p85 <= 0)))) : G (NOT((((1 <= 0) U (1 <= 0)) U ((1 <= p57))))) : X ((NOT(X ((((p8 <= 0)) OR ((1 <= p9))))) U (F ((((p122 <= 0)) OR ((1 <= p14)))) OR X (((1 <= p125)))))) : X ((((0 <= 0) U ((1 <= p139))) U F ((G (X (X (((1 <= p139))))) AND X (F (((1 <= p139)))))))) : NOT(G ((((p31 <= 0)) OR ((1 <= p92)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((X ((((p17 <= 0)) OR ((1 <= p73)))) OR (((p44 <= 0)) OR ((1 <= p28)))) AND (((p69 <= 0)) OR ((1 <= p21)))))) AND G (F ((((1 <= p17)) AND ((p73 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p17)) AND ((p73 <= 0)))))
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 ((((1 <= p17)) AND ((p73 <= 0)))))
lola: processed formula length: 39
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p56 <= 0)) OR ((1 <= p67)))) OR (F ((G ((((p113 <= 0)) OR ((1 <= p34)))) OR (((p56 <= 0)) OR ((1 <= p67))))) AND (((1 <= p119)) AND ((p85 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p119)) AND ((p85 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((1 <= p119)) AND ((p85 <= 0)))
lola: processed formula length: 32
lola: 34 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 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p56 <= 0)) OR ((1 <= p67))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p56 <= 0)) OR ((1 <= p67))))
lola: processed formula length: 35
lola: 33 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((((1 <= p8)) AND ((p9 <= 0)))) U (F ((((p122 <= 0)) OR ((1 <= p14)))) OR X (((1 <= p125))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((((1 <= p8)) AND ((p9 <= 0)))) U (F ((((p122 <= 0)) OR ((1 <= p14)))) OR X (((1 <= p125))))))
lola: processed formula length: 101
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p139))) U X (F ((X (G (((1 <= p139)))) AND F (((1 <= p139))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p139))) U X (F ((X (G (((1 <= p139)))) AND F (((1 <= p139))))))))
lola: processed formula length: 79
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 28 markings, 464 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p31)) AND ((p92 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p31 <= 0)) OR ((1 <= p92)))
lola: processed formula length: 31
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p29)) AND ((p9 <= 0)))))
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 ((((1 <= p29)) AND ((p9 <= 0)))))
lola: processed formula length: 38
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p57 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p57 <= 0)))
lola: processed formula length: 16
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9228 markings, 68109 edges
lola: ========================================
lola: subprocess 7 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p63)) OR (G ((G (((p63 <= 0) OR (p94 <= 0))) OR G (((1 <= p63))))) AND F (((1 <= p63)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p63))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p63))
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p63 <= 0) OR (p94 <= 0))) OR G (((1 <= p63)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p63 <= 0) OR (p94 <= 0))) OR G (((1 <= p63)))))
lola: processed formula length: 57
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8493 markings, 75778 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no
lola:
preliminary result: no no no no no yes no no
lola: memory consumption: 32308 KB
lola: time consumption: 4 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="CloudDeployment-PT-4a"
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 CloudDeployment-PT-4a, 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 r168-smll-158987806500297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-4a.tgz
mv CloudDeployment-PT-4a 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 '
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 ;