About the Execution of ITS-LoLa for BridgeAndVehicles-PT-V20P20N50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.250 | 3600000.00 | 876901.00 | 293.50 | FTTFTFFTFTTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r182-oct2-158987913700347.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-PT-V20P20N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700347
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 8.3K Mar 26 02:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 26 02:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 125K Mar 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 369K Mar 25 21:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 309K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 25 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 25 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 128K Mar 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 374K Mar 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.5M Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591144967589
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:42:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 00:42:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:42:49] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2020-06-03 00:42:49] [INFO ] Transformed 108 places.
[2020-06-03 00:42:49] [INFO ] Transformed 2228 transitions.
[2020-06-03 00:42:49] [INFO ] Parsed PT model containing 108 places and 2228 transitions in 239 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 64 ms.
Incomplete random walk after 100000 steps, including 577 resets, run finished after 825 ms. (steps per millisecond=121 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0]
[2020-06-03 00:42:50] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2020-06-03 00:42:50] [INFO ] Computed 7 place invariants in 10 ms
[2020-06-03 00:42:50] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2020-06-03 00:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:42:51] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2020-06-03 00:42:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:42:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2020-06-03 00:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:42:51] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2020-06-03 00:42:51] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:42:51] [INFO ] [Nat]Added 102 Read/Feed constraints in 47 ms returned sat
[2020-06-03 00:42:52] [INFO ] Deduced a trap composed of 5 places in 475 ms
[2020-06-03 00:42:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 605 ms
[2020-06-03 00:42:52] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 652 ms.
[2020-06-03 00:43:10] [INFO ] Added : 270 causal constraints over 57 iterations in 18101 ms. Result :sat
[2020-06-03 00:43:10] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:43:10] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:43:10] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:43:10] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:43:10] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-06-03 00:43:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:43:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:43:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:43:10] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-06-03 00:43:10] [INFO ] [Nat]Added 102 Read/Feed constraints in 20 ms returned sat
[2020-06-03 00:43:10] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 153 ms.
[2020-06-03 00:43:29] [INFO ] Added : 285 causal constraints over 57 iterations in 18650 ms. Result :sat
[2020-06-03 00:43:29] [INFO ] Deduced a trap composed of 5 places in 417 ms
[2020-06-03 00:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2020-06-03 00:43:30] [INFO ] [Real]Absence check using 7 positive place invariants in 40 ms returned sat
[2020-06-03 00:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:43:30] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-06-03 00:43:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:43:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 24 ms returned sat
[2020-06-03 00:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:43:30] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2020-06-03 00:43:30] [INFO ] [Nat]Added 102 Read/Feed constraints in 45 ms returned sat
[2020-06-03 00:43:30] [INFO ] Deduced a trap composed of 5 places in 270 ms
[2020-06-03 00:43:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2020-06-03 00:43:31] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 162 ms.
[2020-06-03 00:43:44] [INFO ] Added : 281 causal constraints over 57 iterations in 13359 ms. Result :sat
[2020-06-03 00:43:44] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned unsat
[2020-06-03 00:43:44] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:43:44] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:43:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:43:44] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2020-06-03 00:43:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:43:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-03 00:43:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:43:45] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2020-06-03 00:43:45] [INFO ] [Nat]Added 102 Read/Feed constraints in 25 ms returned sat
[2020-06-03 00:43:45] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 212 ms.
[2020-06-03 00:44:04] [INFO ] Added : 280 causal constraints over 56 iterations in 19376 ms. Result :unknown
[2020-06-03 00:44:04] [INFO ] [Real]Absence check using 7 positive place invariants in 19 ms returned sat
[2020-06-03 00:44:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:44:04] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2020-06-03 00:44:04] [INFO ] [Real]Added 102 Read/Feed constraints in 24 ms returned sat
[2020-06-03 00:44:05] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 131 ms.
[2020-06-03 00:44:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:44:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 21 ms returned sat
[2020-06-03 00:44:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:44:05] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-06-03 00:44:05] [INFO ] [Nat]Added 102 Read/Feed constraints in 40 ms returned sat
[2020-06-03 00:44:05] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 308 ms.
[2020-06-03 00:44:16] [INFO ] Added : 235 causal constraints over 47 iterations in 10969 ms. Result :sat
[2020-06-03 00:44:16] [INFO ] Deduced a trap composed of 5 places in 573 ms
[2020-06-03 00:44:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 819 ms
[2020-06-03 00:44:17] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:44:17] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-06-03 00:44:17] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 00:44:17] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-06-03 00:44:17] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 00:44:17] [INFO ] Flatten gal took : 185 ms
[2020-06-03 00:44:17] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 00:44:17] [INFO ] Flatten gal took : 191 ms
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 00:44:17] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 10 ms.
[2020-06-03 00:44:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 33 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BridgeAndVehicles-PT-V20P20N50 @ 3570 seconds
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2829
rslt: Output for CTLCardinality @ BridgeAndVehicles-PT-V20P20N50
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 00:44:18 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "EF(AX(((p55 <= 1) AND (p56 <= p50 + p51))))",
"processed_size": 43,
"rewrites": 11
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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": "AX(((p41 + 1 <= p52) OR (p96 + 1 <= p88)))",
"processed_size": 43,
"rewrites": 10
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AF((AX((p28 <= p85)) AND ((p26 + 1 <= p29) OR ((2 <= p84) AND (p29 <= p46)))))",
"processed_size": 79,
"rewrites": 11
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 2587779,
"markings": 766213,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p26 + p27 <= 0)",
"processed_size": 16,
"rewrites": 12
},
"result":
{
"edges": 164,
"markings": 165,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AF(EG((p52 <= 1)))",
"processed_size": 18,
"rewrites": 11
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 706
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EG(AF((p0 <= 0)))",
"processed_size": 17,
"rewrites": 11
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 30963005,
"markings": 9667073,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 868
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "EG(A((p78 <= p47) U (p99 <= p69)))",
"processed_size": 34,
"rewrites": 11
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 335,
"markings": 168,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1157
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AG(((p25 <= p50 + p51) OR EF((p49 <= p24))))",
"processed_size": 44,
"rewrites": 11
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 47372976,
"markings": 9792342,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1690
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((p0 <= 1) R ((p55 + 1 <= p0) OR (p26 + p27 + 1 <= p22))))",
"processed_size": 62,
"rewrites": 14
},
"result":
{
"edges": 83,
"markings": 84,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_release",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3379
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3379
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(DEADLOCK AND (1 <= p26 + p27))",
"processed_size": 31,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(DEADLOCK AND (1 <= p26 + p27))",
"processed_size": 31,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p22)",
"processed_size": 10,
"rewrites": 13
},
"result":
{
"edges": 16823260,
"markings": 4788904,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 81892,
"runtime": 741.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(E(F(**)))) : (A(G(A(F(**)))) OR (DEADLOCK AND **)) : A(G((** OR E(F(**))))) : A((* R *)) : A(F(E(G(*)))) : E(F(A(X(**)))) : A(X(**)) : E(G(A((** U **)))) : A(F((A(X(**)) AND **))) : E(G(A(F(**))))"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "no yes yes no yes yes no yes yes yes ",
"value": "no yes yes no yes yes no yes 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: 2336/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: A (G (E (F ((p26 + p27 <= 0))))) : (A (G (A (F ((p22 <= 1))))) OR (A (X ((1 <= 0))) AND (1 <= p26 + p27))) : A (G (((p25 <= p50 + p51) OR E (F ((p49 <= p24)))))) : NOT(E (((2 <= p0) U ((p0 <= p55) AND (p22 <= p26 + p27))))) : A (F (NOT(A (F ((2 <= p52)))))) : E (F (A (X (((p55 <= 1) AND (p56 <= p50 + p51)))))) : A (X (((p41 + 1 <= p52) OR (p96 + 1 <= p88)))) : E (G (A (((p78 <= p47) U (p99 <= p69))))) : A (F ((A (X ((p28 <= p85))) AND ((p26 + 1 <= p29) OR ((2 <= p84) AND (p29 <= p46)))))) : E (G (A (F ((p0 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((p55 <= 1) AND (p56 <= p50 + p51))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((p55 <= 1) AND (p56 <= p50 + p51))))
lola: processed formula length: 43
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 1 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p41 + 1 <= p52) OR (p96 + 1 <= p88))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p41 + 1 <= p52) OR (p96 + 1 <= p88)))
lola: processed formula length: 43
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((p28 <= p85))) AND ((p26 + 1 <= p29) OR ((2 <= p84) AND (p29 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AX((p28 <= p85)) AND ((p26 + 1 <= p29) OR ((2 <= p84) AND (p29 <= p46)))))
lola: processed formula length: 79
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 395163 markings, 1323886 edges, 79033 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 766213 markings, 2587779 edges
lola: ========================================
lola: subprocess 3 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p26 + p27 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (p26 + p27 <= 0)
lola: processed formula length: 16
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p26 + p27)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p26 + p27 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 165 markings, 164 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-3-1.sara
sara: try reading problem file CTLCardinality-3-0.sara.
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLCardinality-3-1.sara.
lola: subprocess 4 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p52 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((p52 <= 1)))
lola: processed formula length: 18
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 168 markings, 168 edges
lola: ========================================
lola: subprocess 5 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((p0 <= 0)))
lola: processed formula length: 17
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: 904807 markings, 2707050 edges, 180961 markings/sec, 0 secs
lola: 1761460 markings, 5402282 edges, 171331 markings/sec, 5 secs
lola: 2601968 markings, 8060636 edges, 168102 markings/sec, 10 secs
lola: 3451417 markings, 10748571 edges, 169890 markings/sec, 15 secs
lola: 4294597 markings, 13478769 edges, 168636 markings/sec, 20 secs
lola: 5125335 markings, 16156894 edges, 166148 markings/sec, 25 secs
lola: 5948837 markings, 18836868 edges, 164700 markings/sec, 30 secs
lola: 6757596 markings, 21457250 edges, 161752 markings/sec, 35 secs
lola: 7570469 markings, 24064575 edges, 162575 markings/sec, 40 secs
lola: 8367715 markings, 26719986 edges, 159449 markings/sec, 45 secs
lola: 9149246 markings, 29311140 edges, 156306 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9667073 markings, 30963005 edges
lola: ========================================
lola: subprocess 6 will run for 868 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (((p78 <= p47) U (p99 <= p69)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(A((p78 <= p47) U (p99 <= p69)))
lola: processed formula length: 34
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 168 markings, 335 edges
lola: ========================================
lola: subprocess 7 will run for 1157 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p25 <= p50 + p51) OR E (F ((p49 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((p25 <= p50 + p51) OR EF((p49 <= p24))))
lola: processed formula length: 44
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 604110 markings, 2678883 edges, 120822 markings/sec, 0 secs
lola: 1195292 markings, 5374394 edges, 118236 markings/sec, 5 secs
lola: 1756926 markings, 8031122 edges, 112327 markings/sec, 10 secs
lola: 2314734 markings, 10626216 edges, 111562 markings/sec, 15 secs
lola: 2859683 markings, 13224402 edges, 108990 markings/sec, 20 secs
lola: 3401777 markings, 15816544 edges, 108419 markings/sec, 25 secs
lola: 3922634 markings, 18393442 edges, 104171 markings/sec, 30 secs
lola: 4458510 markings, 20981221 edges, 107175 markings/sec, 35 secs
lola: 4964461 markings, 23436110 edges, 101190 markings/sec, 40 secs
lola: 5480235 markings, 25982587 edges, 103155 markings/sec, 45 secs
lola: 5992379 markings, 28491626 edges, 102429 markings/sec, 50 secs
lola: 6505155 markings, 30967848 edges, 102555 markings/sec, 55 secs
lola: 7022233 markings, 33567409 edges, 103416 markings/sec, 60 secs
lola: 7524308 markings, 36006296 edges, 100415 markings/sec, 65 secs
lola: 8015722 markings, 38511847 edges, 98283 markings/sec, 70 secs
lola: 8508025 markings, 40975967 edges, 98461 markings/sec, 75 secs
lola: 8991334 markings, 43363637 edges, 96662 markings/sec, 80 secs
lola: 9508275 markings, 45952207 edges, 103388 markings/sec, 85 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9792342 markings, 47372976 edges
lola: ========================================
lola: subprocess 8 will run for 1690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p0 <= 1) R ((p55 + 1 <= p0) OR (p26 + p27 + 1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((p0 <= 1) R ((p55 + 1 <= p0) OR (p26 + p27 + 1 <= p22))))
lola: processed formula length: 62
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= p55) AND (p22 <= p26 + p27))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 84 markings, 83 edges
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
lola: ========================================
lola: subprocess 9 will run for 3379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((p22 <= 1))))) OR (DEADLOCK AND (1 <= p26 + p27)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DEADLOCK AND (1 <= p26 + p27))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (DEADLOCK AND (1 <= p26 + p27))
lola: processed formula length: 31
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((p22 <= 1))))) OR (DEADLOCK AND (1 <= p26 + p27)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (DEADLOCK AND (1 <= p26 + p27))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (DEADLOCK AND (1 <= p26 + p27))
lola: processed formula length: 31
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p22 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (2 <= p22)
lola: processed formula length: 10
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= p22)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p22 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
lola: state equation: write sara problem file to CTLCardinality-11-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 43439 markings, 107667 edges, 8688 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 91991 markings, 262971 edges, 9710 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 139436 markings, 423896 edges, 9489 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 186314 markings, 582245 edges, 9376 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 231247 markings, 736836 edges, 8987 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 278597 markings, 897525 edges, 9470 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 323472 markings, 1052726 edges, 8975 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 369568 markings, 1207261 edges, 9219 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 413763 markings, 1363170 edges, 8839 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 459869 markings, 1518569 edges, 9221 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 504416 markings, 1675948 edges, 8909 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 549560 markings, 1830186 edges, 9029 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 593580 markings, 1982677 edges, 8804 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 637920 markings, 2138815 edges, 8868 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 681870 markings, 2289602 edges, 8790 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 725746 markings, 2443386 edges, 8775 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 771291 markings, 2603907 edges, 9109 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 815372 markings, 2755084 edges, 8816 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 859100 markings, 2909411 edges, 8746 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 904989 markings, 3068419 edges, 9178 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 950044 markings, 3225020 edges, 9011 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 992631 markings, 3376176 edges, 8517 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 1035548 markings, 3528764 edges, 8583 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 1080645 markings, 3679942 edges, 9019 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 1126139 markings, 3842457 edges, 9099 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 1169837 markings, 3993360 edges, 8740 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 1213626 markings, 4149402 edges, 8758 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 1257128 markings, 4305578 edges, 8700 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 1299886 markings, 4454850 edges, 8552 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 1344379 markings, 4609406 edges, 8899 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 1387083 markings, 4761029 edges, 8541 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 1430968 markings, 4909871 edges, 8777 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 1472712 markings, 5066392 edges, 8349 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 1519687 markings, 5227047 edges, 9395 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 1562574 markings, 5377334 edges, 8577 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 1607762 markings, 5533070 edges, 9038 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 1650624 markings, 5683584 edges, 8572 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 1692724 markings, 5835273 edges, 8420 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 1731463 markings, 5980061 edges, 7748 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 1779371 markings, 6141005 edges, 9582 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 1821727 markings, 6290743 edges, 8471 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 1865508 markings, 6440675 edges, 8756 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 1904291 markings, 6586506 edges, 7757 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 1950129 markings, 6743121 edges, 9168 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 1992228 markings, 6889576 edges, 8420 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 2036975 markings, 7049469 edges, 8949 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 2081863 markings, 7204515 edges, 8978 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 2125285 markings, 7357105 edges, 8684 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 2166924 markings, 7503900 edges, 8328 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 2210949 markings, 7661606 edges, 8805 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 2248237 markings, 7803192 edges, 7458 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 2291929 markings, 7956302 edges, 8738 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 2342469 markings, 8123096 edges, 10108 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 2386789 markings, 8279999 edges, 8864 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 2429522 markings, 8430804 edges, 8547 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 2469323 markings, 8578073 edges, 7960 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 2513519 markings, 8730243 edges, 8839 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 2556432 markings, 8884294 edges, 8583 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 2598431 markings, 9029600 edges, 8400 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 2645207 markings, 9197232 edges, 9355 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 2690521 markings, 9355120 edges, 9063 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 2734186 markings, 9506772 edges, 8733 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 2774879 markings, 9652804 edges, 8139 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 2818684 markings, 9804386 edges, 8761 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 2861801 markings, 9964300 edges, 8623 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 2903838 markings, 10110790 edges, 8407 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 2945456 markings, 10259407 edges, 8324 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 2991911 markings, 10424054 edges, 9291 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 3038886 markings, 10583445 edges, 9395 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 3083421 markings, 10741025 edges, 8907 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 3124903 markings, 10889987 edges, 8296 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 3169325 markings, 11048034 edges, 8884 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 3210351 markings, 11188211 edges, 8205 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 3247995 markings, 11332824 edges, 7529 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 3289052 markings, 11481312 edges, 8211 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 3333693 markings, 11633583 edges, 8928 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 3384887 markings, 11812852 edges, 10239 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 3431711 markings, 11974257 edges, 9365 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 3475788 markings, 12128528 edges, 8815 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 3519393 markings, 12277032 edges, 8721 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 3560182 markings, 12430350 edges, 8158 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 3602451 markings, 12574316 edges, 8454 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 3643382 markings, 12721948 edges, 8186 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 3684159 markings, 12866997 edges, 8155 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 3724979 markings, 13011803 edges, 8164 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 3764016 markings, 13168094 edges, 7807 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 3819605 markings, 13281581 edges, 11118 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 3872692 markings, 13387157 edges, 10617 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 3915963 markings, 13543983 edges, 8654 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 3962496 markings, 13740209 edges, 9307 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 4010569 markings, 13940652 edges, 9615 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 4057823 markings, 14136634 edges, 9451 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 4104599 markings, 14330655 edges, 9355 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 4143388 markings, 14474912 edges, 7758 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 4174989 markings, 14600319 edges, 6320 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 4203622 markings, 14723308 edges, 5727 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 4233648 markings, 14837534 edges, 6005 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 4276793 markings, 14964027 edges, 8629 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 4333340 markings, 15076928 edges, 11309 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 4384739 markings, 15179036 edges, 10280 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 4427338 markings, 15352660 edges, 8520 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 4475245 markings, 15553763 edges, 9581 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 4523653 markings, 15755740 edges, 9682 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 4572365 markings, 15958860 edges, 9742 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 4620186 markings, 16157595 edges, 9564 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 4657190 markings, 16309146 edges, 7401 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 4693001 markings, 16439054 edges, 7162 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 4720566 markings, 16560714 edges, 5513 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 4752507 markings, 16684508 edges, 6388 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 4780808 markings, 16796469 edges, 5660 markings/sec, 545 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate eventually occurs from all states.
lola: 4788904 markings, 16823260 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes no yes yes yes
lola:
preliminary result: no yes yes no yes yes no yes yes yes
lola: memory consumption: 81892 KB
lola: time consumption: 741 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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-V20P20N50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BridgeAndVehicles-PT-V20P20N50, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913700347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N50.tgz
mv BridgeAndVehicles-PT-V20P20N50 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;