About the Execution of 2020-gold for ShieldIIPt-PT-020A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4288.104 | 3600000.00 | 33893.00 | 350.40 | FFFFFTFFTTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r227-tall-162098231000217.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is ShieldIIPt-PT-020A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231000217
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.9K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 105K May 5 16:52 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 ShieldIIPt-PT-020A-00
FORMULA_NAME ShieldIIPt-PT-020A-01
FORMULA_NAME ShieldIIPt-PT-020A-02
FORMULA_NAME ShieldIIPt-PT-020A-03
FORMULA_NAME ShieldIIPt-PT-020A-04
FORMULA_NAME ShieldIIPt-PT-020A-05
FORMULA_NAME ShieldIIPt-PT-020A-06
FORMULA_NAME ShieldIIPt-PT-020A-07
FORMULA_NAME ShieldIIPt-PT-020A-08
FORMULA_NAME ShieldIIPt-PT-020A-09
FORMULA_NAME ShieldIIPt-PT-020A-10
FORMULA_NAME ShieldIIPt-PT-020A-11
FORMULA_NAME ShieldIIPt-PT-020A-12
FORMULA_NAME ShieldIIPt-PT-020A-13
FORMULA_NAME ShieldIIPt-PT-020A-14
FORMULA_NAME ShieldIIPt-PT-020A-15
=== Now, execution of the tool begins
BK_START 1621145375924
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 06:09:37] [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]
[2021-05-16 06:09:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 06:09:37] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2021-05-16 06:09:37] [INFO ] Transformed 383 places.
[2021-05-16 06:09:37] [INFO ] Transformed 283 transitions.
[2021-05-16 06:09:37] [INFO ] Found NUPN structural information;
[2021-05-16 06:09:37] [INFO ] Parsed PT model containing 383 places and 283 transitions in 136 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 629 ms. (steps per millisecond=158 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 282 rows 383 cols
[2021-05-16 06:09:38] [INFO ] Computed 181 place invariants in 17 ms
[2021-05-16 06:09:38] [INFO ] [Real]Absence check using 181 positive place invariants in 71 ms returned sat
[2021-05-16 06:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:38] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2021-05-16 06:09:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:09:39] [INFO ] [Nat]Absence check using 181 positive place invariants in 73 ms returned sat
[2021-05-16 06:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:39] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2021-05-16 06:09:39] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 28 ms.
[2021-05-16 06:09:40] [INFO ] Added : 280 causal constraints over 58 iterations in 1430 ms. Result :sat
[2021-05-16 06:09:41] [INFO ] [Real]Absence check using 181 positive place invariants in 60 ms returned sat
[2021-05-16 06:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:41] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2021-05-16 06:09:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:09:41] [INFO ] [Nat]Absence check using 181 positive place invariants in 60 ms returned sat
[2021-05-16 06:09:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:41] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2021-05-16 06:09:41] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 19 ms.
[2021-05-16 06:09:43] [INFO ] Added : 270 causal constraints over 58 iterations in 1522 ms. Result :sat
[2021-05-16 06:09:43] [INFO ] [Real]Absence check using 181 positive place invariants in 59 ms returned sat
[2021-05-16 06:09:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:43] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2021-05-16 06:09:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:09:43] [INFO ] [Nat]Absence check using 181 positive place invariants in 10 ms returned unsat
[2021-05-16 06:09:43] [INFO ] [Real]Absence check using 181 positive place invariants in 60 ms returned sat
[2021-05-16 06:09:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:44] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2021-05-16 06:09:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:09:44] [INFO ] [Nat]Absence check using 181 positive place invariants in 11 ms returned unsat
[2021-05-16 06:09:44] [INFO ] [Real]Absence check using 181 positive place invariants in 60 ms returned sat
[2021-05-16 06:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:44] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2021-05-16 06:09:44] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 17 ms.
[2021-05-16 06:09:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:09:44] [INFO ] [Nat]Absence check using 181 positive place invariants in 64 ms returned sat
[2021-05-16 06:09:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:45] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2021-05-16 06:09:45] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 19 ms.
[2021-05-16 06:09:46] [INFO ] Added : 277 causal constraints over 57 iterations in 1415 ms. Result :sat
[2021-05-16 06:09:46] [INFO ] [Real]Absence check using 181 positive place invariants in 60 ms returned sat
[2021-05-16 06:09:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:47] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2021-05-16 06:09:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:09:47] [INFO ] [Nat]Absence check using 181 positive place invariants in 10 ms returned unsat
[2021-05-16 06:09:47] [INFO ] [Real]Absence check using 181 positive place invariants in 63 ms returned sat
[2021-05-16 06:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:47] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2021-05-16 06:09:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:09:47] [INFO ] [Nat]Absence check using 181 positive place invariants in 136 ms returned sat
[2021-05-16 06:09:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:48] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2021-05-16 06:09:48] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 18 ms.
[2021-05-16 06:09:49] [INFO ] Added : 279 causal constraints over 59 iterations in 1529 ms. Result :sat
[2021-05-16 06:09:49] [INFO ] [Real]Absence check using 181 positive place invariants in 60 ms returned sat
[2021-05-16 06:09:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:50] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2021-05-16 06:09:50] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 18 ms.
[2021-05-16 06:09:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:09:50] [INFO ] [Nat]Absence check using 181 positive place invariants in 59 ms returned sat
[2021-05-16 06:09:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:50] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2021-05-16 06:09:50] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 19 ms.
[2021-05-16 06:09:52] [INFO ] Added : 276 causal constraints over 59 iterations in 1469 ms. Result :sat
[2021-05-16 06:09:52] [INFO ] [Real]Absence check using 181 positive place invariants in 60 ms returned sat
[2021-05-16 06:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:52] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2021-05-16 06:09:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:09:52] [INFO ] [Nat]Absence check using 181 positive place invariants in 56 ms returned sat
[2021-05-16 06:09:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:09:52] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2021-05-16 06:09:52] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 16 ms.
[2021-05-16 06:09:54] [INFO ] Added : 280 causal constraints over 57 iterations in 1782 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2021-05-16 06:09:54] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-16 06:09:54] [INFO ] Flatten gal took : 83 ms
FORMULA ShieldIIPt-PT-020A-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 06:09:54] [INFO ] Applying decomposition
[2021-05-16 06:09:55] [INFO ] Flatten gal took : 33 ms
[2021-05-16 06:09:55] [INFO ] Decomposing Gal with order
[2021-05-16 06:09:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 06:09:55] [INFO ] Removed a total of 80 redundant transitions.
[2021-05-16 06:09:55] [INFO ] Flatten gal took : 72 ms
[2021-05-16 06:09:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2021-05-16 06:09:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-16 06:09:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldIIPt-PT-020A @ 3570 seconds
FORMULA ShieldIIPt-PT-020A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-020A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ ShieldIIPt-PT-020A
{
"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": "Sun May 16 06:09:56 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((X ((((1 <= p223)) AND ((p257 <= 0)))) AND (((p223 <= 0)) OR ((1 <= p257))))))",
"processed_size": 85,
"rewrites": 63
},
"result":
{
"edges": 2490,
"markings": 2490,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((X (G ((((1 <= p53)) AND ((p49 <= 0))))) OR (((1 <= p53)) AND ((p49 <= 0))))))",
"processed_size": 84,
"rewrites": 63
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 396
},
"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 ((((p314 <= 0)) OR ((1 <= p158)))))",
"processed_size": 41,
"rewrites": 63
},
"result":
{
"edges": 3405,
"markings": 3405,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((X ((((1 <= p128)) AND ((p184 <= 0)))) OR (((1 <= p128)) AND ((p184 <= 0))))))",
"processed_size": 84,
"rewrites": 63
},
"result":
{
"edges": 2332,
"markings": 2332,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"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": "((((p159 <= 0)) OR ((1 <= p124))))",
"processed_size": 35,
"rewrites": 65
},
"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": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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 <= p372)) AND ((p309 <= 0)))))",
"processed_size": 41,
"rewrites": 63
},
"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": 713
},
"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 <= p82)) AND ((p113 <= 0)))))",
"processed_size": 40,
"rewrites": 63
},
"result":
{
"edges": 8,
"markings": 8,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p279 <= 0)) OR ((1 <= p185))))",
"processed_size": 37,
"rewrites": 63
},
"result":
{
"edges": 330,
"markings": 274,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "F ((((p324 <= 0)) AND G ((((p204 <= 0)) OR ((1 <= p245))))))",
"processed_size": 61,
"rewrites": 63
},
"result":
{
"edges": 28818,
"markings": 28776,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1782
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p154 <= 0)) OR ((1 <= p345)) OR ((p10 <= 0)) OR ((1 <= p1)))",
"processed_size": 66,
"rewrites": 63
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((p10 <= 0)) OR ((1 <= p1))) U G ((((p207 <= 0)) OR ((1 <= p361)))))",
"processed_size": 72,
"rewrites": 63
},
"result":
{
"edges": 59,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"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": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": "F (G ((((1 <= p339)) AND ((p348 <= 0)))))",
"processed_size": 41,
"rewrites": 63
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 35224,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G(*)) AND F((F(*) OR (* OR G(*))))) : G(F((X(**) AND **))) : F((** AND G(**))) : X(F((X(G(*)) OR *))) : X(F(**)) : G(F(*)) : G(F(*)) : G(**) : X(G((X(*) OR *))) : F(**) : ((** U G(**)) AND **)"
},
"net":
{
"arcs": 1204,
"conflict_clusters": 143,
"places": 383,
"places_significant": 202,
"singleton_clusters": 0,
"transitions": 282
},
"result":
{
"preliminary_value": "no no no yes no no no no no no no ",
"value": "no no no yes no no no no no 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: 665/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 383
lola: finding significant places
lola: 383 places, 282 transitions, 202 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p348 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p324 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p324 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p361 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p376 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p361 <= 1)
lola: LP says that atomic proposition is always true: (p345 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: NOT((G ((G ((((p101 <= 0)) OR ((1 <= p55)))) AND (((p101 <= 0)) OR ((1 <= p55))))) U NOT(F (NOT(F ((((p339 <= 0)) OR ((1 <= p348))))))))) : F (G (F ((X ((((1 <= p223)) AND ((p257 <= 0)))) AND ((1 <= 0) U (((p223 <= 0)) OR ((1 <= p257)))))))) : F ((((p324 <= 0)) AND G ((((p204 <= 0)) OR ((1 <= p245)))))) : NOT(G (X ((F (((X (((p324 <= 0))) U (((p53 <= 0)) OR ((1 <= p49)))) U X ((((p53 <= 0)) OR ((1 <= p49)))))) AND (((p53 <= 0)) OR ((1 <= p49))))))) : ((0 <= 0) U F (((((p314 <= 0)) OR ((1 <= p158))) U X ((((p314 <= 0)) OR ((1 <= p158))))))) : NOT(F (X (((((p75 <= 0)) OR ((1 <= p361))) U X (F (G ((((p372 <= 0)) OR ((1 <= p309)))))))))) : F (G (X (F (NOT(G ((((p82 <= 0)) OR ((1 <= p113))))))))) : G ((((p279 <= 0)) OR ((1 <= p185)))) : NOT(X (((1 <= 0) U F ((X ((((p128 <= 0)) OR ((1 <= p184)))) AND (((p128 <= 0)) OR ((1 <= p184)))))))) : ((0 <= 0) U ((((1 <= p159)) AND ((p124 <= 0))))) : (((((p10 <= 0)) OR ((1 <= p1))) U G ((((p207 <= 0)) OR ((1 <= p361))))) AND (((p154 <= 0)) OR ((1 <= p345)) OR ((p10 <= 0)) OR ((1 <= p1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((((1 <= p223)) AND ((p257 <= 0)))) AND (((p223 <= 0)) OR ((1 <= p257))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((((1 <= p223)) AND ((p257 <= 0)))) AND (((p223 <= 0)) OR ((1 <= p257))))))
lola: processed formula length: 85
lola: 63 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: 2490 markings, 2490 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (G ((((1 <= p53)) AND ((p49 <= 0))))) OR (((1 <= p53)) AND ((p49 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (G ((((1 <= p53)) AND ((p49 <= 0))))) OR (((1 <= p53)) AND ((p49 <= 0))))))
lola: processed formula length: 84
lola: 63 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: 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 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p314 <= 0)) OR ((1 <= p158)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p314 <= 0)) OR ((1 <= p158)))))
lola: processed formula length: 41
lola: 63 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3405 markings, 3405 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((((1 <= p128)) AND ((p184 <= 0)))) OR (((1 <= p128)) AND ((p184 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((((1 <= p128)) AND ((p184 <= 0)))) OR (((1 <= p128)) AND ((p184 <= 0))))))
lola: processed formula length: 84
lola: 63 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: 2332 markings, 2332 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((1 <= p159)) AND ((p124 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((((p159 <= 0)) OR ((1 <= p124))))
lola: processed formula length: 35
lola: 65 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 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p372)) AND ((p309 <= 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 <= p372)) AND ((p309 <= 0)))))
lola: processed formula length: 41
lola: 63 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 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p82)) AND ((p113 <= 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 <= p82)) AND ((p113 <= 0)))))
lola: processed formula length: 40
lola: 63 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 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p279 <= 0)) OR ((1 <= p185))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p279 <= 0)) OR ((1 <= p185))))
lola: processed formula length: 37
lola: 63 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: 274 markings, 330 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p324 <= 0)) AND G ((((p204 <= 0)) OR ((1 <= p245))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p324 <= 0)) AND G ((((p204 <= 0)) OR ((1 <= p245))))))
lola: processed formula length: 61
lola: 63 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: 28776 markings, 28818 edges
lola: ========================================
lola: subprocess 9 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p10 <= 0)) OR ((1 <= p1))) U G ((((p207 <= 0)) OR ((1 <= p361))))) AND (((p154 <= 0)) OR ((1 <= p345)) OR ((p10 <= 0)) OR ((1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p154 <= 0)) OR ((1 <= p345)) OR ((p10 <= 0)) OR ((1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p154 <= 0)) OR ((1 <= p345)) OR ((p10 <= 0)) OR ((1 <= p1)))
lola: processed formula length: 66
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 4 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 10 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p10 <= 0)) OR ((1 <= p1))) U G ((((p207 <= 0)) OR ((1 <= p361)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p10 <= 0)) OR ((1 <= p1))) U G ((((p207 <= 0)) OR ((1 <= p361)))))
lola: processed formula length: 72
lola: 63 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: 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: 52 markings, 59 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((1 <= p339)) AND ((p348 <= 0))))) AND F ((F ((((1 <= p101)) AND ((p55 <= 0)))) OR ((((1 <= p101)) AND ((p55 <= 0))) OR G ((((1 <= p339)) AND ((p348 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p339)) AND ((p348 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p339)) AND ((p348 <= 0)))))
lola: processed formula length: 41
lola: 63 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: 9 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no no no no no
lola:
preliminary result: no no no yes no no no no no no no
lola: memory consumption: 35224 KB
lola: time consumption: 5 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="ShieldIIPt-PT-020A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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 gold2020"
echo " Input is ShieldIIPt-PT-020A, 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 r227-tall-162098231000217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020A.tgz
mv ShieldIIPt-PT-020A 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 ;