Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900200436.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DLCflexbar-PT-8a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900200436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.9M
-rw-r--r-- 1 mcc users 3.0K Mar 30 18:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 18:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 29 08:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 29 08:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 8.7M 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 DLCflexbar-PT-8a-CTLFireability-00
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-01
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-02
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-03
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-04
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-05
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-06
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-07
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-08
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-09
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-10
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-11
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-12
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-13
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-14
FORMULA_NAME DLCflexbar-PT-8a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591226055613

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:14:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 23:14:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:14:20] [INFO ] Load time of PNML (sax parser for PT used): 1442 ms
[2020-06-03 23:14:20] [INFO ] Transformed 3971 places.
[2020-06-03 23:14:20] [INFO ] Transformed 32571 transitions.
[2020-06-03 23:14:20] [INFO ] Found NUPN structural information;
[2020-06-03 23:14:20] [INFO ] Parsed PT model containing 3971 places and 32571 transitions in 2036 ms.
Ensure Unique test removed 3480 transitions
Reduce redundant transitions removed 3480 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 480 ms.
Finished random walk after 26010 steps, including 0 resets, run visited all 51 properties in 3299 ms. (steps per millisecond=7 )
[2020-06-03 23:14:29] [INFO ] Flatten gal took : 3956 ms
[2020-06-03 23:14:32] [INFO ] Flatten gal took : 3222 ms
[2020-06-03 23:14:32] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 36 ms.
[2020-06-03 23:14:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 373 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DLCflexbar-PT-8a @ 3570 seconds

FORMULA DLCflexbar-PT-8a-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-8a-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: -1
rslt: Output for CTLFireability @ DLCflexbar-PT-8a

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 23:14:33 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 103
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G ((((2 <= p1061) OR (p1061 <= 0) OR (2 <= p3554) OR (p3554 <= 0)) AND ((2 <= p1051) OR (p1051 <= 0) OR (2 <= p3118) OR (p3118 <= 0)))))",
"processed_size": 145,
"rewrites": 38
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 327
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 110
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((2 <= p95) OR (p95 <= 0) OR (2 <= p1387) OR (p1387 <= 0)) AND ((2 <= p990) OR (p990 <= 0) OR (2 <= p1308) OR (p1308 <= 0)))))",
"processed_size": 139,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 32,
"problems": 16
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 110
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 4,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "AF((AX(((p434 <= 1) AND (1 <= p434) AND (p2043 <= 1) AND (1 <= p2043))) AND (AX(((p1065 <= 1) AND (1 <= p1065) AND (p3334 <= 1) AND (1 <= p3334))) AND AF((((p224 <= 1) AND (1 <= p224) AND (p3103 <= 1) AND (1 <= p3103)) OR ((p1009 <= 1) AND (1 <= p1009) AND (p1673 <= 1) AND (1 <= p1673)))))))",
"processed_size": 293,
"rewrites": 41
},
"net":
{
"conflict_clusters": 432,
"singleton_clusters": 0
},
"result":
{
"edges": 7,
"markings": 7,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 3944028,
"runtime": 3571.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F((A(G(**)) AND **))) OR (** AND (E(F(*)) AND **))) : (E(G((A(X(**)) OR (** OR (** OR **))))) OR (E(F(*)) AND E(G(**)))) : A(F(E(G(**)))) : A(G(A(F(*)))) : A(G(E(F(**)))) : (A((** U **)) OR **) : A(F((A(X(**)) AND (A(X(**)) AND A(F(**)))))) : (E(G(E(F(**)))) OR E(X(**))) : (((A(F(**)) AND E(X(**))) OR (A(F(**)) AND A(G(**)))) AND ((E((** U **)) OR A(X(**))) AND (E((** U **)) OR E(F(**))))) : (A(G((E(F(**)) OR **))) AND A(G(**))) : A((* R E(F(*)))) : E(G((E(X(**)) OR (A(F(**)) AND **)))) : A(G(*)) : A(((A(F(**)) OR **) U **)) : E(G((E(F(*)) OR (* OR *)))) : E((E(X(**)) U **))"
},
"net":
{
"arcs": 116581,
"conflict_clusters": 432,
"places": 3971,
"places_significant": 931,
"singleton_clusters": 0,
"transitions": 29091
},
"result":
{
"interim_value": "unknown yes unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "unknown yes unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"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: 33062/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3971
lola: finding significant places
lola: 3971 places, 29091 transitions, 931 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 CTLFireability.xml
lola: (E (F ((A (G (((p359 <= 1) AND (1 <= p359) AND (p2863 <= 1) AND (1 <= p2863)))) AND ((p727 <= 1) AND (1 <= p727))))) OR ((((p875 <= 1) AND (1 <= p875) AND (p2170 <= 1) AND (1 <= p2170)) AND NOT(A (G (((p1069 <= 1) AND (1 <= p1069) AND (p3419 <= 1) AND (1 <= p3419)))))) AND (((p672 <= 1) AND (1 <= p672) AND (p3792 <= 1) AND (1 <= p3792)) OR (((2 <= p1064) OR (p1064 <= 0) OR (2 <= p3558) OR (p3558 <= 0)) AND ((2 <= p357) OR (p357 <= 0) OR (2 <= p2022) OR (p2022 <= 0)))))) : (E (G ((((A (X (((p1000 <= 1) AND (1 <= p1000) AND (p1562 <= 1) AND (1 <= p1562)))) OR ((p999 <= 1) AND (1 <= p999) AND (p1555 <= 1) AND (1 <= p1555))) OR ((p511 <= 1) AND (1 <= p511) AND (p2066 <= 1) AND (1 <= p2066))) OR ((p378 <= 1) AND (1 <= p378) AND (p1188 <= 1) AND (1 <= p1188))))) OR (NOT(A (G ((((p95 <= 1) AND (1 <= p95) AND (p1387 <= 1) AND (1 <= p1387)) OR ((p990 <= 1) AND (1 <= p990) AND (p1308 <= 1) AND (1 <= p1308)))))) AND E (G ((((2 <= p1061) OR (p1061 <= 0) OR (2 <= p3554) OR (p3554 <= 0)) AND ((2 <= p1051) OR (p1051 <= 0) OR (2 <= p3118) OR (p3118 <= 0))))))) : A (F (E (G (((p1019 <= 1) AND (1 <= p1019) AND (p1925 <= 1) AND (1 <= p1925) AND (p231 <= 1) AND (1 <= p231) AND (p2546 <= 1) AND (1 <= p2546) AND (((p100 <= 1) AND (1 <= p100) AND (p1669 <= 1) AND (1 <= p1669)) OR ((p989 <= 1) AND (1 <= p989) AND (p1329 <= 1) AND (1 <= p1329)))))))) : A (G (NOT(E (G (((p1034 <= 1) AND (1 <= p1034) AND (p2590 <= 1) AND (1 <= p2590))))))) : A (G (A (F (E (F (((p231 <= 1) AND (1 <= p231) AND (p1146 <= 1) AND (1 <= p1146)))))))) : (A (((((2 <= p1057) OR (p1057 <= 0) OR (2 <= p3110) OR (p3110 <= 0)) AND ((2 <= p1018) OR (p1018 <= 0) OR (2 <= p2132) OR (p2132 <= 0))) U (((p1079 <= 1) AND (1 <= p1079) AND (p3658 <= 1) AND (1 <= p3658)) OR ((p1069 <= 1) AND (1 <= p1069) AND (p3349 <= 1) AND (1 <= p3349)) OR ((p1078 <= 1) AND (1 <= p1078) AND (p3880 <= 1) AND (1 <= p3880))))) OR ((p997 <= 1) AND (1 <= p997) AND (p1450 <= 1) AND (1 <= p1450))) : A (F (((A (X (((p434 <= 1) AND (1 <= p434) AND (p2043 <= 1) AND (1 <= p2043)))) AND A (X (((p1065 <= 1) AND (1 <= p1065) AND (p3334 <= 1) AND (1 <= p3334))))) AND A (F ((((p224 <= 1) AND (1 <= p224) AND (p3103 <= 1) AND (1 <= p3103)) OR ((p1009 <= 1) AND (1 <= p1009) AND (p1673 <= 1) AND (1 <= p1673)))))))) : (E (G (E (F (((p1058 <= 1) AND (1 <= p1058) AND (p3310 <= 1) AND (1 <= p3310)))))) OR E (X ((((p344 <= 1) AND (1 <= p344) AND (p3419 <= 1) AND (1 <= p3419)) OR ((p1049 <= 1) AND (1 <= p1049) AND (p2991 <= 1) AND (1 <= p2991)))))) : ((((A (F ((((p981 <= 1) AND (1 <= p981) AND (p1202 <= 1) AND (1 <= p1202)) OR ((p221 <= 1) AND (1 <= p221) AND (p2263 <= 1) AND (1 <= p2263))))) AND E (X (((p483 <= 1) AND (1 <= p483) AND (p2337 <= 1) AND (1 <= p2337) AND (p280 <= 1) AND (1 <= p280) AND (p2839 <= 1) AND (1 <= p2839))))) OR (A (F (((p1010 <= 1) AND (1 <= p1010) AND (p1880 <= 1) AND (1 <= p1880) AND (p1059 <= 1) AND (1 <= p1059) AND (p3209 <= 1) AND (1 <= p3209)))) AND A (G ((((p1030 <= 1) AND (1 <= p1030) AND (p2320 <= 1) AND (1 <= p2320)) OR ((p113 <= 1) AND (1 <= p113) AND (p2233 <= 1) AND (1 <= p2233))))))) AND (E ((((p1011 <= 1) AND (1 <= p1011) AND (p2084 <= 1) AND (1 <= p2084)) U ((p406 <= 1) AND (1 <= p406) AND (p3716 <= 1) AND (1 <= p3716)))) OR A (X (((2 <= p999) OR (p999 <= 0) OR (2 <= p1509) OR (p1509 <= 0)))))) AND (E ((((p1039 <= 1) AND (1 <= p1039) AND (p2495 <= 1) AND (1 <= p2495)) U ((p53 <= 1) AND (1 <= p53) AND (p2495 <= 1) AND (1 <= p2495)))) OR E (F ((((p1060 <= 1) AND (1 <= p1060) AND (p3052 <= 1) AND (1 <= p3052)) OR ((p847 <= 1) AND (1 <= p847) AND (p2441 <= 1) AND (1 <= p2441))))))) : A (G (((E (F (((p1069 <= 1) AND (1 <= p1069) AND (p3443 <= 1) AND (1 <= p3443)))) OR ((p735 <= 1) AND (1 <= p735) AND (p1290 <= 1) AND (1 <= p1290) AND ((2 <= p266) OR (p266 <= 0) OR (2 <= p1436) OR (p1436 <= 0)))) AND ((2 <= p1033) OR (p1033 <= 0) OR (2 <= p2760) OR (p2760 <= 0) OR (2 <= p588) OR (p588 <= 0) OR (2 <= p2088) OR (p2088 <= 0) OR ((p175 <= 1) AND (1 <= p175) AND (p2810 <= 1) AND (1 <= p2810)))))) : NOT(E ((((2 <= p1009) OR (p1009 <= 0) OR (2 <= p1755) OR (p1755 <= 0) OR (2 <= p1047) OR (p1047 <= 0) OR (2 <= p3018) OR (p3018 <= 0)) U A (G (((p133 <= 1) AND (1 <= p133) AND (p2517 <= 1) AND (1 <= p2517))))))) : E (G ((E (X (((2 <= p1018) OR (p1018 <= 0) OR (2 <= p2160) OR (p2160 <= 0)))) OR (A (F (((p1031 <= 1) AND (1 <= p1031) AND (p2738 <= 1) AND (1 <= p2738)))) AND ((2 <= p602) OR (p602 <= 0) OR (2 <= p3212) OR (p3212 <= 0) OR ((p924 <= 1) AND (1 <= p924) AND (p3023 <= 1) AND (1 <= p3023) AND (p981 <= 1) AND (1 <= p981) AND (p1322 <= 1) AND (1 <= p1322))))))) : NOT(E ((((p896 <= 1) AND (1 <= p896)) U E (F (((p148 <= 1) AND (1 <= p148) AND (p2803 <= 1) AND (1 <= p2803))))))) : A (((A (F (((p282 <= 1) AND (1 <= p282) AND (p2281 <= 1) AND (1 <= p2281)))) OR ((p427 <= 1) AND (1 <= p427) AND (p1482 <= 1) AND (1 <= p1482) AND (p853 <= 1) AND (1 <= p853) AND (p1069 <= 1) AND (1 <= p1069) AND (p3358 <= 1) AND (1 <= p3358))) U ((p1078 <= 1) AND (1 <= p1078) AND (p3724 <= 1) AND (1 <= p3724) AND (p704 <= 1) AND (1 <= p704) AND (p1281 <= 1) AND (1 <= p1281) AND ((2 <= p1008) OR (p1008 <= 0) OR (2 <= p1918) OR (p1918 <= 0)) AND ((2 <= p1001) OR (p1001 <= 0) OR (2 <= p1888) OR (p1888 <= 0) OR ((p602 <= 1) AND (1 <= p602) AND (p1251 <= 1) AND (1 <= p1251)))))) : NOT(A (F (((A (G (((p224 <= 1) AND (1 <= p224) AND (p2544 <= 1) AND (1 <= p2544)))) AND ((p392 <= 1) AND (1 <= p392))) AND ((p2312 <= 1) AND (1 <= p2312)))))) : E ((E (X (((2 <= p1053) OR (p1053 <= 0) OR (2 <= p3212) OR (p3212 <= 0)))) U ((p1019 <= 1) AND (1 <= p1019) AND (p1923 <= 1) AND (1 <= p1923) AND (p1008 <= 1) AND (1 <= p1008) AND (p1890 <= 1) AND (1 <= p1890))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:545
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 103 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((A (X (((p1000 <= 1) AND (1 <= p1000) AND (p1562 <= 1) AND (1 <= p1562)))) OR (((p999 <= 1) AND (1 <= p999) AND (p1555 <= 1) AND (1 <= p1555)) OR (((p511 <= 1) AND (1 <= p511) AND (p2066 <= 1) AND (1 <= p2066)) OR ((p378 <= 1) AND (1 <= p378) AND (p1188 <= 1) AND (1 <= p1188))))))) OR (E (F ((((2 <= p95) OR (p95 <= 0) OR (2 <= p1387) OR (p1387 <= 0)) AND ((2 <= p990) OR (p990 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 103 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((2 <= p1061) OR (p1061 <= 0) OR (2 <= p3554) OR (p3554 <= 0)) AND ((2 <= p1051) OR (p1051 <= 0) OR (2 <= p3118) OR (p3118 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((2 <= p1061) OR (p1061 <= 0) OR (2 <= p3554) OR (p3554 <= 0)) AND ((2 <= p1051) OR (p1051 <= 0) OR (2 <= p3118) OR (p3118 <= 0)))))
lola: processed formula length: 145
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 2 markings, 2 edges
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: (((p1061 <= 1) AND (1 <= p1061) AND (p3554 <= 1) AND (1 <= p3554)) OR ((p1051 <= 1) AND (1 <= p1051) AND (p3118 <= 1) AND (1 <= p3118)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 110 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p95) OR (p95 <= 0) OR (2 <= p1387) OR (p1387 <= 0)) AND ((2 <= p990) OR (p990 <= 0) OR (2 <= p1308) OR (p1308 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((2 <= p95) OR (p95 <= 0) OR (2 <= p1387) OR (p1387 <= 0)) AND ((2 <= p990) OR (p990 <= 0) OR (2 <= p1308) OR (p1308 <= 0)))))
lola: processed formula length: 139
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((2 <= p95) OR (p95 <= 0) OR (2 <= p1387) OR (p1387 <= 0)) AND ((2 <= p990) OR (p990 <= 0) OR (2 <= p1308) OR (p1308 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 16 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 110 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X (((p434 <= 1) AND (1 <= p434) AND (p2043 <= 1) AND (1 <= p2043)))) AND (A (X (((p1065 <= 1) AND (1 <= p1065) AND (p3334 <= 1) AND (1 <= p3334)))) AND A (F ((((p224 <= 1) AND (1 <= p224) AND (p3103 <= 1) AND (1 <= p3103)) OR ((p1009 <= 1) AND (1 <= p1009) AND (p1673 <= 1) AND (1 <= p1673)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AX(((p434 <= 1) AND (1 <= p434) AND (p2043 <= 1) AND (1 <= p2043))) AND (AX(((p1065 <= 1) AND (1 <= p1065) AND (p3334 <= 1) AND (1 <= p3334))) AND AF((((p224 <= 1) AND (1 <= p224) AND (p3103 <= 1) AND (1 <= p3103)) OR ((p1009 <= 1) AND (1 <= p1009) AND (p1673 <= 1) AND (1 <= p1673)))))))
lola: processed formula length: 293
lola: 41 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 2 will run for 118 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (((p1058 <= 1) AND (1 <= p1058) AND (p3310 <= 1) AND (1 <= p3310)))))) OR E (X ((((p344 <= 1) AND (1 <= p344) AND (p3419 <= 1) AND (1 <= p3419)) OR ((p1049 <= 1) AND (1 <= p1049) AND (p2991 <= 1) AND (1 <= p2991))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 118 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p1058 <= 1) AND (1 <= p1058) AND (p3310 <= 1) AND (1 <= p3310))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((p1058 <= 1) AND (1 <= p1058) AND (p3310 <= 1) AND (1 <= p3310))
lola: processed formula length: 65
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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 0
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: 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: ((2 <= p1058) OR (p1058 <= 0) OR (2 <= p3310) OR (p3310 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p1058 <= 1) AND (1 <= p1058) AND (p3310 <= 1) AND (1 <= p3310))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: write sara problem file to CTLFireability-2-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-0.sara.
sara: try reading problem file CTLFireability-2-1.sara.
lola: sara is running 0 secs || sara is running 0 secs || 3312 markings, 451151 edges, 662 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6623 markings, 945063 edges, 662 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9982 markings, 1437844 edges, 672 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 13329 markings, 1930696 edges, 669 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 16722 markings, 2421027 edges, 679 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 20093 markings, 2883945 edges, 674 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 22932 markings, 3293850 edges, 568 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 24993 markings, 3573754 edges, 412 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 27012 markings, 3858840 edges, 404 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 29813 markings, 4248018 edges, 560 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 33452 markings, 4738009 edges, 728 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 37111 markings, 5224744 edges, 732 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 40443 markings, 5711653 edges, 666 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 43542 markings, 6135625 edges, 620 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 46746 markings, 6586336 edges, 641 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 50122 markings, 7074060 edges, 675 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 53754 markings, 7560040 edges, 726 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 56844 markings, 7995156 edges, 618 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 60255 markings, 8480573 edges, 682 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 63984 markings, 8966971 edges, 746 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 67368 markings, 9453981 edges, 677 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 70327 markings, 9873150 edges, 592 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 71965 markings, 10116203 edges, 328 markings/sec, 110 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown yes unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 3944028 KB
lola: time consumption: 2033 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown yes unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown
sara: place or transition ordering is non-deterministic

lola: time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown yes unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 3944028 KB
lola: time consumption: 3571 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 12166008 kB
After kill :
MemTotal: 16427456 kB
MemFree: 12166316 kB

--------------------
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="DLCflexbar-PT-8a"
export BK_EXAMINATION="CTLFireability"
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 DLCflexbar-PT-8a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900200436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCflexbar-PT-8a.tgz
mv DLCflexbar-PT-8a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;