Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389600172.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 Solitaire-PT-FrnCT7x7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389600172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 9 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 92K Apr 27 15:14 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 Solitaire-PT-FrnCT7x7-CTLFireability-00
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-01
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-02
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-03
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-04
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-05
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-06
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-07
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-08
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-09
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-10
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-11
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-12
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-13
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-14
FORMULA_NAME Solitaire-PT-FrnCT7x7-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591205688930

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:34:52] [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 17:34:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:34:52] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2020-06-03 17:34:52] [INFO ] Transformed 75 places.
[2020-06-03 17:34:52] [INFO ] Transformed 92 transitions.
[2020-06-03 17:34:52] [INFO ] Parsed PT model containing 75 places and 92 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Incomplete random walk after 100000 steps, including 3879 resets, run finished after 445 ms. (steps per millisecond=224 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 92 rows 75 cols
[2020-06-03 17:34:53] [INFO ] Computed 38 place invariants in 8 ms
[2020-06-03 17:34:53] [INFO ] [Real]Absence check using 37 positive place invariants in 42 ms returned sat
[2020-06-03 17:34:53] [INFO ] [Real]Absence check using 37 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-06-03 17:34:53] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 17:34:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 17:34:53] [INFO ] Flatten gal took : 189 ms
[2020-06-03 17:34:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 17:34:53] [INFO ] Flatten gal took : 29 ms
FORMULA Solitaire-PT-FrnCT7x7-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 17:34:53] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 19 ms.
[2020-06-03 17:34:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Solitaire-PT-FrnCT7x7 @ 3570 seconds

FORMULA Solitaire-PT-FrnCT7x7-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-FrnCT7x7-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Solitaire-PT-FrnCT7x7-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ Solitaire-PT-FrnCT7x7

{
"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",
"--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 17:34:55 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "EF((((1 <= p4) AND (1 <= p9) AND (1 <= p11)) AND AX((((1 <= p8) AND (1 <= p48) AND (1 <= p52)) OR ((1 <= p21) AND (1 <= p23) AND (1 <= p37))))))",
"processed_size": 145,
"rewrites": 25
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 68308483,
"markings": 12641318,
"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": 247
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "AF((EX((((1 <= p27) AND (1 <= p30) AND (1 <= p33)) OR ((1 <= p20) AND (1 <= p23) AND (1 <= p36)))) AND ((p41 <= 0) OR (p59 <= 0) OR (p66 <= 0))))",
"processed_size": 148,
"rewrites": 25
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 42,
"markings": 43,
"produced_by": "CTL model checker",
"value": false
},
"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": 268
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "AG((AX(((p42 <= 0) OR (p51 <= 0) OR (p69 <= 0))) OR EF((((1 <= p51) AND (1 <= p68) AND (1 <= p72)) OR ((1 <= p49) AND (1 <= p52) AND (1 <= p55))))))",
"processed_size": 151,
"rewrites": 26
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 699,
"markings": 340,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 58028,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(*)) OR **) : A(G(A(F(**)))) : E(F((** AND A(X(**))))) : E(G(**)) : E(G((E(X(**)) AND (** AND (** AND **))))) : (E((* R *)) AND A((A(F(**)) U A(G(**))))) : A(F((E(X(**)) AND **))) : (E((A(G(**)) U A(F(**)))) OR A(F(**))) : (A(F(E(G(*)))) OR E(F(E(G(**))))) : E((A(F(**)) U **)) : A(G((A(X(**)) OR E(F(**))))) : E(G(((A(F(**)) OR **) AND **))) : E(F((* AND E(G(*))))) : (A(F(**)) OR A(X(E((** U **))))) : A(F((A(G(**)) AND (E(X(**)) OR **))))"
},
"net":
{
"arcs": 644,
"conflict_clusters": 1,
"places": 75,
"places_significant": 37,
"singleton_clusters": 0,
"transitions": 92
},
"result":
{
"interim_value": "unknown unknown yes unknown unknown unknown no unknown unknown unknown no unknown unknown unknown unknown ",
"preliminary_value": "unknown unknown yes unknown unknown unknown no unknown unknown unknown no 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: 167/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2400
lola: finding significant places
lola: 75 places, 92 transitions, 37 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: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: LP says that atomic proposition is always true: (1 <= p74)
lola: (NOT(E (F (((1 <= p4) AND (1 <= p11) AND (1 <= p14) AND (1 <= p37) AND (1 <= p60) AND (1 <= p64) AND ((p12 <= 0) OR (p20 <= 0) OR (p29 <= 0)))))) OR ((1 <= p25) AND (1 <= p39) AND (1 <= p62))) : A (G (A (G (A (F (((1 <= p22) AND (1 <= p35) AND (1 <= p42)))))))) : E (F ((((1 <= p4) AND (1 <= p9) AND (1 <= p11)) AND A (X ((((1 <= p8) AND (1 <= p48) AND (1 <= p52)) OR ((1 <= p21) AND (1 <= p23) AND (1 <= p37)))))))) : E (G (((p7 <= 0) OR (p44 <= 0) OR (p52 <= 0) OR (((p42 <= 0) OR (p51 <= 0) OR (p69 <= 0)) AND ((p24 <= 0) OR (p29 <= 0) OR (p39 <= 0)))))) : E (G ((((E (X (((1 <= p8) AND (1 <= p48) AND (1 <= p52)))) AND ((p4 <= 0) OR (p11 <= 0) OR (p14 <= 0))) AND ((p7 <= 0) OR (p42 <= 0) OR (p51 <= 0))) AND ((p6 <= 0) OR (p13 <= 0) OR (p21 <= 0) OR (p25 <= 0) OR (p39 <= 0) OR (p62 <= 0))))) : (NOT(A (((((1 <= p48) AND (1 <= p54) AND (1 <= p71)) OR ((1 <= p23) AND (1 <= p35) AND (1 <= p43))) U ((1 <= p43) AND (1 <= p49) AND (1 <= p56) AND (1 <= p6) AND (1 <= p12) AND (1 <= p52))))) AND A ((A (F (((1 <= p1) AND (1 <= p15) AND (1 <= p20)))) U A (G (((1 <= p0) AND (1 <= p15) AND (1 <= p21))))))) : A (F ((E (X ((((1 <= p27) AND (1 <= p30) AND (1 <= p33)) OR ((1 <= p20) AND (1 <= p23) AND (1 <= p36))))) AND ((p41 <= 0) OR (p59 <= 0) OR (p66 <= 0))))) : (E ((A (G (((1 <= p13) AND (1 <= p35) AND (1 <= p41)))) U A (F (((1 <= p12) AND (1 <= p20) AND (1 <= p29)))))) OR A (F (((1 <= p25) AND (1 <= p32) AND (1 <= p36))))) : (NOT(E (G (A (F (((1 <= p36) AND (1 <= p40) AND (1 <= p51))))))) OR E (F (E (G (((1 <= p4) AND (1 <= p10) AND (1 <= p15))))))) : E ((A (F (((1 <= p58) AND (1 <= p63) AND (1 <= p64) AND (1 <= p25) AND (1 <= p28) AND (1 <= p39)))) U ((1 <= p4) AND (1 <= p11) AND (1 <= p14) AND (1 <= p37) AND (1 <= p40) AND (1 <= p50) AND (1 <= p6) AND (1 <= p45) AND (1 <= p52) AND ((p42 <= 0) OR (p49 <= 0) OR (p57 <= 0))))) : A (G ((A (X (((p42 <= 0) OR (p51 <= 0) OR (p69 <= 0)))) OR E (F ((((1 <= p51) AND (1 <= p68) AND (1 <= p72)) OR ((1 <= p49) AND (1 <= p52) AND (1 <= p55)))))))) : E (G (((A (F (((1 <= p34) AND (1 <= p40) AND (1 <= p59)))) OR ((1 <= p7) AND (1 <= p42) AND (1 <= p51) AND (1 <= p25) AND (1 <= p37) AND (1 <= p41))) AND ((p5 <= 0) OR (p15 <= 0) OR (p18 <= 0) OR (p7 <= 0) OR (p42 <= 0) OR (p51 <= 0) OR ((1 <= p24) AND (1 <= p37) AND (1 <= p40)))))) : NOT(A (G ((((1 <= p34) AND (1 <= p40) AND (1 <= p59)) OR A (F (((1 <= p25) AND (1 <= p28) AND (1 <= p39)))))))) : (A (F ((((1 <= p59) AND (1 <= p68) AND (1 <= p70)) OR ((1 <= p37) AND (1 <= p60) AND (1 <= p64) AND (((1 <= p20) AND (1 <= p29) AND (1 <= p31)) OR ((1 <= p23) AND (1 <= p26) AND (1 <= p39))))))) OR A (X (E ((((1 <= p20) AND (1 <= p29) AND (1 <= p31)) U ((1 <= p48) AND (1 <= p54) AND (1 <= p71))))))) : A (F ((A (G ((((1 <= p35) AND (1 <= p42) AND (1 <= p48)) OR ((1 <= p25) AND (1 <= p28) AND (1 <= p39))))) AND (E (X (((1 <= p5) AND (1 <= p13) AND (1 <= p35)))) OR ((1 <= p23) AND (1 <= p34) AND (1 <= p39) AND (1 <= p0) AND (1 <= p15) AND (1 <= p21) AND (((1 <= p14) AND (1 <= p20)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p11))))))))
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:389
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p4) AND (1 <= p9) AND (1 <= p11)) AND A (X ((((1 <= p8) AND (1 <= p48) AND (1 <= p52)) OR ((1 <= p21) AND (1 <= p23) AND (1 <= p37))))))))
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((((1 <= p4) AND (1 <= p9) AND (1 <= p11)) AND AX((((1 <= p8) AND (1 <= p48) AND (1 <= p52)) OR ((1 <= p21) AND (1 <= p23) AND (1 <= p37))))))
lola: processed formula length: 145
lola: 25 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 910479 markings, 4224566 edges, 182096 markings/sec, 0 secs
lola: 1807297 markings, 8297498 edges, 179364 markings/sec, 5 secs
lola: 2560430 markings, 12024392 edges, 150627 markings/sec, 10 secs
lola: 3236868 markings, 15621780 edges, 135288 markings/sec, 15 secs
lola: 3894211 markings, 19286273 edges, 131469 markings/sec, 20 secs
lola: 4605749 markings, 22940517 edges, 142308 markings/sec, 25 secs
lola: 5312796 markings, 26575377 edges, 141409 markings/sec, 30 secs
lola: 5987121 markings, 30107357 edges, 134865 markings/sec, 35 secs
lola: 6603056 markings, 33593135 edges, 123187 markings/sec, 40 secs
lola: 7198431 markings, 37032149 edges, 119075 markings/sec, 45 secs
lola: 7769013 markings, 40257012 edges, 114116 markings/sec, 50 secs
lola: 8368714 markings, 43572899 edges, 119940 markings/sec, 55 secs
lola: 9144124 markings, 47148577 edges, 155082 markings/sec, 60 secs
lola: 9758528 markings, 50478732 edges, 122881 markings/sec, 65 secs
lola: 10359337 markings, 53848556 edges, 120162 markings/sec, 70 secs
lola: 10941237 markings, 57234006 edges, 116380 markings/sec, 75 secs
lola: 11449086 markings, 60516276 edges, 101570 markings/sec, 80 secs
lola: 11930180 markings, 63845692 edges, 96219 markings/sec, 85 secs
lola: 12435962 markings, 67247630 edges, 101156 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 12641318 markings, 68308483 edges
lola: ========================================
lola: subprocess 1 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X (((1 <= p8) AND (1 <= p48) AND (1 <= p52)))) AND (((p4 <= 0) OR (p11 <= 0) OR (p14 <= 0)) AND (((p7 <= 0) OR (p42 <= 0) OR (p51 <= 0)) AND ((p6 <= 0) OR (p13 <= 0) OR (p21 <= 0) OR (p25 <= 0) OR (p39 <= 0) OR (p62 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EX(((1 <= p8) AND (1 <= p48) AND (1 <= p52))) AND (((p4 <= 0) OR (p11 <= 0) OR (p14 <= 0)) AND (((p7 <= 0) OR (p42 <= 0) OR (p51 <= 0)) AND ((p6 <= 0) OR (p13 <= 0) OR (p21 <= 0) OR (p25 <= 0) OR (p39 <= 0) OR (p62 <= 0))))))
lola: processed formula length: 238
lola: 25 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 722548 markings, 1319793 edges, 144510 markings/sec, 0 secs
lola: 1375510 markings, 2645723 edges, 130592 markings/sec, 5 secs
lola: 2047084 markings, 4012318 edges, 134315 markings/sec, 10 secs
lola: 2693367 markings, 5420322 edges, 129257 markings/sec, 15 secs
lola: 3274209 markings, 6819069 edges, 116168 markings/sec, 20 secs
lola: 3898737 markings, 8202628 edges, 124906 markings/sec, 25 secs
lola: 4514641 markings, 9606442 edges, 123181 markings/sec, 30 secs
lola: 5121711 markings, 10972075 edges, 121414 markings/sec, 35 secs
lola: 5707835 markings, 12335934 edges, 117225 markings/sec, 40 secs
lola: 6325312 markings, 13596984 edges, 123495 markings/sec, 45 secs
lola: 6906194 markings, 14868319 edges, 116176 markings/sec, 50 secs
lola: 7517107 markings, 16185195 edges, 122183 markings/sec, 55 secs
lola: 8106621 markings, 17437478 edges, 117903 markings/sec, 60 secs
lola: 8654717 markings, 18718869 edges, 109619 markings/sec, 65 secs
lola: 9175626 markings, 19988191 edges, 104182 markings/sec, 70 secs
lola: 9742616 markings, 21411607 edges, 113398 markings/sec, 75 secs
lola: 10290961 markings, 22813637 edges, 109669 markings/sec, 80 secs
lola: 10850104 markings, 24306586 edges, 111829 markings/sec, 85 secs
lola: 11374860 markings, 25773539 edges, 104951 markings/sec, 90 secs
lola: 11882271 markings, 27200059 edges, 101482 markings/sec, 95 secs
lola: 12422898 markings, 28616108 edges, 108125 markings/sec, 100 secs
lola: 12957889 markings, 29976499 edges, 106998 markings/sec, 105 secs
lola: 13419217 markings, 31333173 edges, 92266 markings/sec, 110 secs
lola: 13945807 markings, 32754535 edges, 105318 markings/sec, 115 secs
lola: 14430730 markings, 34104740 edges, 96985 markings/sec, 120 secs
lola: 14961546 markings, 35593722 edges, 106163 markings/sec, 125 secs
lola: 15514113 markings, 37143632 edges, 110513 markings/sec, 130 secs
lola: 16054938 markings, 38631965 edges, 108165 markings/sec, 135 secs
lola: 16610654 markings, 40121733 edges, 111143 markings/sec, 140 secs
lola: 17088798 markings, 41585443 edges, 95629 markings/sec, 145 secs
lola: 17591975 markings, 43106409 edges, 100635 markings/sec, 150 secs
lola: 18105374 markings, 44510170 edges, 102680 markings/sec, 155 secs
lola: 18583612 markings, 45966994 edges, 95648 markings/sec, 160 secs
lola: 19036817 markings, 47419504 edges, 90641 markings/sec, 165 secs
lola: 19495475 markings, 48841716 edges, 91732 markings/sec, 170 secs
lola: 19965752 markings, 50349952 edges, 94055 markings/sec, 175 secs
lola: 20443208 markings, 51835880 edges, 95491 markings/sec, 180 secs
lola: 20930605 markings, 53230095 edges, 97479 markings/sec, 185 secs
lola: 21393764 markings, 54693155 edges, 92632 markings/sec, 190 secs
lola: 21842053 markings, 56144838 edges, 89658 markings/sec, 195 secs
lola: 22264703 markings, 57595782 edges, 84530 markings/sec, 200 secs
lola: 22685889 markings, 58990444 edges, 84237 markings/sec, 205 secs
lola: 23156894 markings, 60441674 edges, 94201 markings/sec, 210 secs
lola: 23714484 markings, 61711194 edges, 111518 markings/sec, 215 secs
lola: 24282870 markings, 62929716 edges, 113677 markings/sec, 220 secs
lola: 24825848 markings, 64119280 edges, 108596 markings/sec, 225 secs
lola: 25374713 markings, 65286474 edges, 109773 markings/sec, 230 secs
lola: 25889038 markings, 66477006 edges, 102865 markings/sec, 235 secs
lola: 26377063 markings, 67668021 edges, 97605 markings/sec, 240 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 3083548 KB
lola: time consumption: 348 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((((1 <= p27) AND (1 <= p30) AND (1 <= p33)) OR ((1 <= p20) AND (1 <= p23) AND (1 <= p36))))) AND ((p41 <= 0) OR (p59 <= 0) OR (p66 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EX((((1 <= p27) AND (1 <= p30) AND (1 <= p33)) OR ((1 <= p20) AND (1 <= p23) AND (1 <= p36)))) AND ((p41 <= 0) OR (p59 <= 0) OR (p66 <= 0))))
lola: processed formula length: 148
lola: 25 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 1 significant temporal operators and needs 5 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: 43 markings, 42 edges
lola: ========================================
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X (((p42 <= 0) OR (p51 <= 0) OR (p69 <= 0)))) OR E (F ((((1 <= p51) AND (1 <= p68) AND (1 <= p72)) OR ((1 <= p49) AND (1 <= p52) AND (1 <= p55))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AX(((p42 <= 0) OR (p51 <= 0) OR (p69 <= 0))) OR EF((((1 <= p51) AND (1 <= p68) AND (1 <= p72)) OR ((1 <= p49) AND (1 <= p52) AND (1 <= p55))))))
lola: processed formula length: 151
lola: 26 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: 340 markings, 699 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p59) AND (1 <= p68) AND (1 <= p70)) OR ((1 <= p37) AND (1 <= p60) AND (1 <= p64) AND (((1 <= p20) AND (1 <= p29) AND (1 <= p31)) OR ((1 <= p23) AND (1 <= p26) AND (1 <= p39))))))) OR A (X (E ((((1 <= p20) AND (1 <= p29) AND (1 <= p31)) U ((1 <= p48) AND (1 <= p54) AND (1 <= p71)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown unknown no unknown unknown unknown no unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 58028 KB
lola: time consumption: 640 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown unknown no unknown unknown unknown no unknown unknown unknown unknown
lola:
preliminary result: unknown unknown yes unknown unknown unknown no unknown unknown unknown no unknown unknown unknown unknown
lola: memory consumption: 58028 KB
lola: time consumption: 3570 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: 16427332 kB
MemFree: 16094584 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16094788 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="Solitaire-PT-FrnCT7x7"
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 Solitaire-PT-FrnCT7x7, 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 r194-csrt-159033389600172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Solitaire-PT-FrnCT7x7.tgz
mv Solitaire-PT-FrnCT7x7 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 ;