fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987852900251
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for NeoElection-COL-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.270 3600000.00 25339.00 158.40 FTTTTTFFTFFTFFFT normal

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.r174-csrt-158987852900251.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 NeoElection-COL-6, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852900251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.9K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 98K Apr 30 13:04 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 NeoElection-COL-6-CTLCardinality-00
FORMULA_NAME NeoElection-COL-6-CTLCardinality-01
FORMULA_NAME NeoElection-COL-6-CTLCardinality-02
FORMULA_NAME NeoElection-COL-6-CTLCardinality-03
FORMULA_NAME NeoElection-COL-6-CTLCardinality-04
FORMULA_NAME NeoElection-COL-6-CTLCardinality-05
FORMULA_NAME NeoElection-COL-6-CTLCardinality-06
FORMULA_NAME NeoElection-COL-6-CTLCardinality-07
FORMULA_NAME NeoElection-COL-6-CTLCardinality-08
FORMULA_NAME NeoElection-COL-6-CTLCardinality-09
FORMULA_NAME NeoElection-COL-6-CTLCardinality-10
FORMULA_NAME NeoElection-COL-6-CTLCardinality-11
FORMULA_NAME NeoElection-COL-6-CTLCardinality-12
FORMULA_NAME NeoElection-COL-6-CTLCardinality-13
FORMULA_NAME NeoElection-COL-6-CTLCardinality-14
FORMULA_NAME NeoElection-COL-6-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591137018625

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:30:21] [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-02 22:30:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:30:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 22:30:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1333 ms
[2020-06-02 22:30:23] [INFO ] sort/places :
M * STAGE->P-stage,
M * POS->P-sendAnnPs__broadcasting,P-startNeg__broadcasting,
M * M * MT * M->P-network,P-poll__networl,
M * POS * M->P-masterList,
M * BOOL * M->P-masterState,
M * M * NEGSTEP->P-negotiation,
M->P-crashed,dead,P-electedPrimary,P-electedSecondary,P-electionFailed,P-electionInit,P-poll__handlingMessage,P-poll__pollEnd,P-poll__waitingMessage,P-polling,

[2020-06-02 22:30:23] [INFO ] Detected 4 constant HL places corresponding to 315 PT places.
[2020-06-02 22:30:23] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 4830 PT places and 13580.0 transition bindings in 85 ms.
[2020-06-02 22:30:23] [INFO ] Computed order based on color domains.
[2020-06-02 22:30:23] [INFO ] Unfolded HLPN to a Petri net with 4830 places and 8005 transitions in 262 ms.
[2020-06-02 22:30:23] [INFO ] Unfolded HLPN properties in 3 ms.
Deduced a syphon composed of 4507 places in 53 ms
Reduce places removed 4537 places and 7611 transitions.
Reduce places removed 13 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 451 ms.
Incomplete random walk after 100000 steps, including 244 resets, run finished after 666 ms. (steps per millisecond=150 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 0, 1, 1]
[2020-06-02 22:30:24] [INFO ] Flow matrix only has 369 transitions (discarded 25 similar events)
// Phase 1: matrix 369 rows 280 cols
[2020-06-02 22:30:24] [INFO ] Computed 77 place invariants in 41 ms
[2020-06-02 22:30:25] [INFO ] [Real]Absence check using 47 positive place invariants in 475 ms returned unsat
[2020-06-02 22:30:25] [INFO ] [Real]Absence check using 47 positive place invariants in 37 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-02 22:30:25] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-02 22:30:26] [INFO ] Flatten gal took : 193 ms
[2020-06-02 22:30:26] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-02 22:30:26] [INFO ] Flatten gal took : 82 ms
FORMULA NeoElection-COL-6-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 22:30:26] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-02 22:30:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 22 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ NeoElection-COL-6 @ 3570 seconds

FORMULA NeoElection-COL-6-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-6-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-6-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-6-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-6-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-6-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-6-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLCardinality @ NeoElection-COL-6

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 22:30:26 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": 6,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p232 + p233 + p234 + p235 + p236 + p237)))",
"processed_size": 54,
"rewrites": 11
},
"result":
{
"edges": 384,
"markings": 385,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": 6,
"visible_transitions": 0
},
"processed": "E (F ((2 <= p232 + p233 + p234 + p235 + p236 + p237)))",
"processed_size": 54,
"rewrites": 11
},
"result":
{
"edges": 44,
"markings": 45,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": 6,
"visible_transitions": 0
},
"processed": "E (F ((1 <= p232 + p233 + p234 + p235 + p236 + p237)))",
"processed_size": 54,
"rewrites": 11
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": 6,
"visible_transitions": 0
},
"processed": "E (G ((p238 + p239 + p240 + p241 + p242 + p243 <= 0)))",
"processed_size": 54,
"rewrites": 11
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(p232 + p233 + p234 + p235 + p236 + p237 <= 0)",
"processed_size": 46,
"rewrites": 13
},
"result":
{
"edges": 408,
"markings": 409,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 340
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 20360,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(E(F(**)))) : E(F(**)) : E(F(**)) : TRUE : E(F(**)) : E(G(**)) : NODEADLOCK"
},
"net":
{
"arcs": 2183,
"conflict_clusters": 90,
"places": 280,
"places_significant": 203,
"singleton_clusters": 0,
"transitions": 394
},
"result":
{
"preliminary_value": "yes yes yes yes yes no yes ",
"value": "yes yes yes yes yes no 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: 674/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 280
lola: finding significant places
lola: 280 places, 394 transitions, 203 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: E (G (E (F ((p232 + p233 + p234 + p235 + p236 + p237 <= 0))))) : E (F ((3 <= p232 + p233 + p234 + p235 + p236 + p237))) : E (F (A (((1 <= 0) U (1 <= p232 + p233 + p234 + p235 + p236 + p237))))) : E (G ((0 <= 0))) : E (((0 <= 0) U E (F ((2 <= p232 + p233 + p234 + p235 + p236 + p237))))) : E (G ((p238 + p239 + p240 + p241 + p242 + p243 <= 0))) : E (X ((0 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p232 + p233 + p234 + p235 + p236 + p237)))
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 ((3 <= p232 + p233 + p234 + p235 + p236 + p237)))
lola: processed formula length: 54
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: 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 385 markings, 384 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p232 + p233 + p234 + p235 + p236 + p237)))
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 <= p232 + p233 + p234 + p235 + p236 + p237)))
lola: processed formula length: 54
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: 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 <= p232 + p233 + p234 + p235 + p236 + p237)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 4 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p232 + p233 + p234 + p235 + p236 + p237)))
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 ((1 <= p232 + p233 + p234 + p235 + p236 + p237)))
lola: processed formula length: 54
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: 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p238 + p239 + p240 + p241 + p242 + p243 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p238 + p239 + p240 + p241 + p242 + p243 <= 0)))
lola: processed formula length: 54
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: 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: 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 <= p238 + p239 + p240 + p241 + p242 + p243)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 37 markings, 36 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-5-0.sara.
lola: ...considering subproblem: E (G (E (F ((p232 + p233 + p234 + p235 + p236 + p237 <= 0)))))
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: (p232 + p233 + p234 + p235 + p236 + p237 <= 0)
lola: processed formula length: 46
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 /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: 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 <= p232 + p233 + p234 + p235 + p236 + p237)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
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: (p232 + p233 + p234 + p235 + p236 + p237 <= 0)
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: write sara problem file to CTLCardinality-6-1.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF

lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
sara: try reading problem file CTLCardinality-6-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
lola: Reachability of the predicate is possibly preserved.
lola: 409 markings, 408 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no yes
lola:
preliminary result: yes yes yes yes yes no yes
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: memory consumption: 20360 KB
lola: time consumption: 4 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="NeoElection-COL-6"
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 NeoElection-COL-6, 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 r174-csrt-158987852900251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-6.tgz
mv NeoElection-COL-6 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;