fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r037-tajo-162038176800081
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BridgeAndVehicles-PT-V04P05N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4280.871 3600000.00 14087.00 123.30 FFTFFTFFTFFFFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038176800081.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BridgeAndVehicles-PT-V04P05N02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176800081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 22 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 22 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 57K May 5 16:51 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 BridgeAndVehicles-PT-V04P05N02-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-15

=== Now, execution of the tool begins

BK_START 1620929203358

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:06:45] [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-13 18:06:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:06:46] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-13 18:06:46] [INFO ] Transformed 28 places.
[2021-05-13 18:06:46] [INFO ] Transformed 52 transitions.
[2021-05-13 18:06:46] [INFO ] Parsed PT model containing 28 places and 52 transitions in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2297 resets, run finished after 180 ms. (steps per millisecond=555 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1]
[2021-05-13 18:06:46] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-13 18:06:46] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-13 18:06:46] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned unsat
[2021-05-13 18:06:46] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 18:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:46] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-13 18:06:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:06:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 18:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:46] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-13 18:06:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-13 18:06:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:06:46] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 10 ms.
[2021-05-13 18:06:46] [INFO ] Added : 27 causal constraints over 6 iterations in 116 ms. Result :sat
[2021-05-13 18:06:46] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2021-05-13 18:06:46] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2021-05-13 18:06:46] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 18:06:46] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 18:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:46] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 18:06:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:06:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 18:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:46] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-13 18:06:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-13 18:06:46] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 7 ms.
[2021-05-13 18:06:46] [INFO ] Added : 27 causal constraints over 6 iterations in 36 ms. Result :sat
[2021-05-13 18:06:46] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 18:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:46] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 18:06:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:06:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 18:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:46] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 18:06:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:06:47] [INFO ] Deduced a trap composed of 5 places in 33 ms
[2021-05-13 18:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-13 18:06:47] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 4 ms.
[2021-05-13 18:06:47] [INFO ] Added : 26 causal constraints over 6 iterations in 50 ms. Result :sat
[2021-05-13 18:06:47] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 18:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:47] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 18:06:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:06:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 18:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 18:06:47] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:06:47] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 4 ms.
[2021-05-13 18:06:47] [INFO ] Added : 28 causal constraints over 6 iterations in 32 ms. Result :sat
[2021-05-13 18:06:47] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2021-05-13 18:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:47] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 18:06:47] [INFO ] [Real]Added 6 Read/Feed constraints in 4 ms returned sat
[2021-05-13 18:06:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:06:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 18:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 18:06:47] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2021-05-13 18:06:47] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 3 ms.
[2021-05-13 18:06:47] [INFO ] Added : 29 causal constraints over 6 iterations in 38 ms. Result :sat
[2021-05-13 18:06:47] [INFO ] Deduced a trap composed of 5 places in 18 ms
[2021-05-13 18:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2021-05-13 18:06:47] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2021-05-13 18:06:47] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 18:06:47] [INFO ] Flatten gal took : 50 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:06:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 18:06:47] [INFO ] Flatten gal took : 9 ms
[2021-05-13 18:06:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:06:47] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 12 ms.
[2021-05-13 18:06:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V04P05N02 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V04P05N02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLCardinality @ BridgeAndVehicles-PT-V04P05N02

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 18:06:47 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (X ((X (X ((p9 <= p7))) R (p7 + 1 <= p9)))) AND G ((1 <= p17))))",
"processed_size": 70,
"rewrites": 50
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((X ((p17 + 1 <= p20)) AND (G (F ((p20 + 1 <= p18 + p19))) AND (p17 + 1 <= p20)))))",
"processed_size": 88,
"rewrites": 50
},
"result":
{
"edges": 53,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((X ((p21 + p22 <= p10 + p11)) R (p21 + p22 <= p0))))",
"processed_size": 58,
"rewrites": 50
},
"result":
{
"edges": 51,
"markings": 51,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((((p20 <= p17) U (p27 <= p19)) AND (2 <= p0)))",
"processed_size": 49,
"rewrites": 50
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "F ((X (F ((p0 <= 2))) AND (p9 <= 1)))",
"processed_size": 37,
"rewrites": 50
},
"result":
{
"edges": 1140,
"markings": 730,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((X (G ((p13 + 1 <= p6))) OR (X (F ((p7 <= 1))) AND ((p7 <= 2) AND (p0 <= 0))))))",
"processed_size": 86,
"rewrites": 50
},
"result":
{
"edges": 52,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "X (F ((G ((p6 <= p23)) OR (3 <= p20))))",
"processed_size": 39,
"rewrites": 50
},
"result":
{
"edges": 14584,
"markings": 3993,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((p20 + 1 <= p8) U (p8 <= p20)) OR F (G ((p7 <= p18)))))",
"processed_size": 60,
"rewrites": 50
},
"result":
{
"edges": 21229,
"markings": 6485,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 20120,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(X((X(X(**)) R *))) AND G(**))) : F(G((X(*) AND (G(F(*)) AND *)))) : X(G((X(*) R *))) : X(((** U **) AND **)) : F((X(F(*)) AND *)) : X(G((X(G(*)) OR (X(F(*)) AND (** AND **))))) : G(((** U **) OR F(G(**)))) : X(F((G(**) OR **)))"
},
"net":
{
"arcs": 326,
"conflict_clusters": 5,
"places": 28,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "no no no yes no no yes yes ",
"value": "no no no yes no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 80/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 896
lola: finding significant places
lola: 28 places, 52 transitions, 21 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: X ((X (X (NOT((X (NOT(X (((1 <= 0) U (p9 <= p7))))) U (p9 <= p7))))) AND G ((1 <= p17)))) : G (F (NOT(F (((X ((p20 <= p17)) OR G (F (G ((p18 + p19 <= p20))))) OR (p20 <= p17)))))) : G (X (G (NOT((X ((p10 + p11 + 1 <= p21 + p22)) U (p0 + 1 <= p21 + p22)))))) : X ((((p20 <= p17) U (p27 <= p19)) AND ((1 <= 0) U (2 <= p0)))) : NOT(G ((X (NOT(F (NOT(G ((3 <= p0)))))) OR (2 <= p9)))) : X (G ((NOT(X (F ((p6 <= p13)))) OR ((NOT(X (G ((2 <= p7)))) AND (p7 <= 2)) AND (p0 <= 0))))) : G ((((p20 + 1 <= p8) U (p8 <= p20)) OR F (G ((p7 <= p18))))) : F (X ((X (F (X ((p9 <= p20)))) U (G ((p6 <= p23)) OR (3 <= p20)))))
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X ((X (X ((p9 <= p7))) R (p7 + 1 <= p9)))) AND G ((1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X ((X (X ((p9 <= p7))) R (p7 + 1 <= p9)))) AND G ((1 <= p17))))
lola: processed formula length: 70
lola: 50 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p17 + 1 <= p20)) AND (G (F ((p20 + 1 <= p18 + p19))) AND (p17 + 1 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p17 + 1 <= p20)) AND (G (F ((p20 + 1 <= p18 + p19))) AND (p17 + 1 <= p20)))))
lola: processed formula length: 88
lola: 50 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: 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, 53 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p21 + p22 <= p10 + p11)) R (p21 + p22 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p21 + p22 <= p10 + p11)) R (p21 + p22 <= p0))))
lola: processed formula length: 58
lola: 50 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p20 <= p17) U (p27 <= p19)) AND (2 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p20 <= p17) U (p27 <= p19)) AND (2 <= p0)))
lola: processed formula length: 49
lola: 50 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((p0 <= 2))) AND (p9 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((p0 <= 2))) AND (p9 <= 1)))
lola: processed formula length: 37
lola: 50 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: 730 markings, 1140 edges
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (G ((p13 + 1 <= p6))) OR (X (F ((p7 <= 1))) AND ((p7 <= 2) AND (p0 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G ((p13 + 1 <= p6))) OR (X (F ((p7 <= 1))) AND ((p7 <= 2) AND (p0 <= 0))))))
lola: processed formula length: 86
lola: 50 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 52 markings, 52 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p6 <= p23)) OR (3 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p6 <= p23)) OR (3 <= p20))))
lola: processed formula length: 39
lola: 50 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3993 markings, 14584 edges
lola: ========================================
lola: subprocess 7 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p20 + 1 <= p8) U (p8 <= p20)) OR F (G ((p7 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p20 + 1 <= p8) U (p8 <= p20)) OR F (G ((p7 <= p18)))))
lola: processed formula length: 60
lola: 50 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6485 markings, 21229 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no yes yes
lola:
preliminary result: no no no yes no no yes yes
lola: memory consumption: 20120 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="BridgeAndVehicles-PT-V04P05N02"
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 BridgeAndVehicles-PT-V04P05N02, 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 r037-tajo-162038176800081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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