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.r176-tajo-158987872300721.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 QuasiCertifProtocol-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872300721
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 34K 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 QuasiCertifProtocol-COL-02-00
FORMULA_NAME QuasiCertifProtocol-COL-02-01
FORMULA_NAME QuasiCertifProtocol-COL-02-02
FORMULA_NAME QuasiCertifProtocol-COL-02-03
FORMULA_NAME QuasiCertifProtocol-COL-02-04
FORMULA_NAME QuasiCertifProtocol-COL-02-05
FORMULA_NAME QuasiCertifProtocol-COL-02-06
FORMULA_NAME QuasiCertifProtocol-COL-02-07
FORMULA_NAME QuasiCertifProtocol-COL-02-08
FORMULA_NAME QuasiCertifProtocol-COL-02-09
FORMULA_NAME QuasiCertifProtocol-COL-02-10
FORMULA_NAME QuasiCertifProtocol-COL-02-11
FORMULA_NAME QuasiCertifProtocol-COL-02-12
FORMULA_NAME QuasiCertifProtocol-COL-02-13
FORMULA_NAME QuasiCertifProtocol-COL-02-14
FORMULA_NAME QuasiCertifProtocol-COL-02-15

=== Now, execution of the tool begins

BK_START 1591178355017

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 09:59:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 09:59:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 09:59:17] [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-03 09:59:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 560 ms
[2020-06-03 09:59:17] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

[2020-06-03 09:59:17] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 24 ms.
[2020-06-03 09:59:17] [INFO ] Computed order based on color domains.
[2020-06-03 09:59:17] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions in 11 ms.
[2020-06-03 09:59:17] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 16419 resets, run finished after 359 ms. (steps per millisecond=278 ) properties seen :[0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 56 rows 86 cols
[2020-06-03 09:59:18] [INFO ] Computed 31 place invariants in 6 ms
[2020-06-03 09:59:18] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned unsat
[2020-06-03 09:59:18] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 09:59:18] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 09:59:18] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-06-03 09:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:18] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-06-03 09:59:18] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-06-03 09:59:18] [INFO ] Added : 28 causal constraints over 6 iterations in 129 ms. Result :sat
[2020-06-03 09:59:18] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:18] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 6 ms returned sat
[2020-06-03 09:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:18] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-03 09:59:18] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 8 ms.
[2020-06-03 09:59:18] [INFO ] Added : 27 causal constraints over 6 iterations in 70 ms. Result :sat
[2020-06-03 09:59:18] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-03 09:59:18] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-06-03 09:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:18] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-03 09:59:18] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-06-03 09:59:19] [INFO ] Added : 28 causal constraints over 6 iterations in 196 ms. Result :sat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 28 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 12 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-06-03 09:59:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:59:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 6 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:19] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-06-03 09:59:19] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-06-03 09:59:19] [INFO ] Added : 28 causal constraints over 6 iterations in 77 ms. Result :sat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 28 ms returned unsat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 27 ms returned unsat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-06-03 09:59:19] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 13 ms.
[2020-06-03 09:59:19] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-03 09:59:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:59:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:19] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-06-03 09:59:19] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 15 ms.
[2020-06-03 09:59:19] [INFO ] Added : 27 causal constraints over 6 iterations in 62 ms. Result :sat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 8 ms returned sat
[2020-06-03 09:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-06-03 09:59:20] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 6 ms.
[2020-06-03 09:59:20] [INFO ] Added : 17 causal constraints over 4 iterations in 63 ms. Result :sat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-06-03 09:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-03 09:59:20] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 2 ms.
[2020-06-03 09:59:20] [INFO ] Added : 27 causal constraints over 6 iterations in 66 ms. Result :sat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 3 ms returned sat
[2020-06-03 09:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-03 09:59:20] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-06-03 09:59:20] [INFO ] Added : 20 causal constraints over 4 iterations in 34 ms. Result :sat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-06-03 09:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-03 09:59:20] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 9 ms.
[2020-06-03 09:59:20] [INFO ] Added : 20 causal constraints over 4 iterations in 27 ms. Result :sat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-06-03 09:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:20] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-03 09:59:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:59:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-03 09:59:20] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 6 ms returned sat
[2020-06-03 09:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:20] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2020-06-03 09:59:20] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-06-03 09:59:20] [INFO ] Added : 28 causal constraints over 6 iterations in 42 ms. Result :sat
Successfully simplified 12 atomic propositions for a total of 17 simplifications.
[2020-06-03 09:59:20] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 09:59:20] [INFO ] Flatten gal took : 25 ms
FORMULA QuasiCertifProtocol-COL-02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 09:59:20] [INFO ] Applying decomposition
[2020-06-03 09:59:20] [INFO ] Flatten gal took : 11 ms
[2020-06-03 09:59:20] [INFO ] Decomposing Gal with order
[2020-06-03 09:59:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 09:59:20] [INFO ] Removed a total of 48 redundant transitions.
[2020-06-03 09:59:20] [INFO ] Flatten gal took : 62 ms
[2020-06-03 09:59:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2020-06-03 09:59:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2020-06-03 09:59:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-COL-02 @ 3570 seconds

FORMULA QuasiCertifProtocol-COL-02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-02-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-02-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-02-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-02-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-02-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-02-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-02-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ QuasiCertifProtocol-COL-02

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 09:59:21 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((p3 <= p57 + p56 + p55)))",
"processed_size": 31,
"rewrites": 61
},
"result":
{
"edges": 609,
"markings": 251,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (((p83 + p84 + p85 <= 2) OR (F (G ((p71 + p70 + p72 + 1 <= p49 + p50 + p51))) AND (3 <= p83 + p84 + p85))))",
"processed_size": 109,
"rewrites": 61
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X (X (G ((X ((p76 <= p49 + p50 + p51)) AND (1 <= p2))))))",
"processed_size": 60,
"rewrites": 61
},
"result":
{
"edges": 32,
"markings": 32,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p43 + p44 + p45 <= p49 + p50 + p51)))",
"processed_size": 44,
"rewrites": 61
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p0)))",
"processed_size": 17,
"rewrites": 61
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G ((((3 <= p43 + p44 + p45) U (1 <= p81)) AND X ((X ((p31 + p32 + p33 + 1 <= p2)) AND (p31 + p32 + p33 + 1 <= p2))))))",
"processed_size": 121,
"rewrites": 61
},
"result":
{
"edges": 34,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((p46 + p48 + p47 <= 1))",
"processed_size": 26,
"rewrites": 61
},
"result":
{
"edges": 31,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((2 <= p63 + p62 + p61)))",
"processed_size": 30,
"rewrites": 61
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((p34 + p36 + p35 + 1 <= p52 + p54 + p53)))",
"processed_size": 48,
"rewrites": 61
},
"result":
{
"edges": 154,
"markings": 108,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 18968,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(**)) : G(F(**)) : X((** OR (F(G(*)) AND **))) : X(X(X(G((X(**) AND **))))) : X(F(**)) : X(F(**)) : F(G(((** U **) AND X((X(*) AND **))))) : G(F(*)) : X(*)"
},
"net":
{
"arcs": 223,
"conflict_clusters": 20,
"places": 86,
"places_significant": 55,
"singleton_clusters": 0,
"transitions": 56
},
"result":
{
"preliminary_value": "no no yes no yes no no no no ",
"value": "no no yes no yes no no no no "
},
"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: 142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2752
lola: finding significant places
lola: 86 places, 56 transitions, 55 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: G (X (G ((p3 <= p57 + p56 + p55)))) : F (G (X (((0 <= 0) U G (F ((2 <= p63 + p62 + p61))))))) : (X ((p83 + p84 + p85 <= 2)) OR X ((F (NOT(F ((p49 + p50 + p51 <= p71 + p70 + p72)))) AND (3 <= p83 + p84 + p85)))) : X (X (NOT(X (NOT(G ((X ((p76 <= p49 + p50 + p51)) AND (1 <= p2)))))))) : X (F ((p43 + p44 + p45 <= p49 + p50 + p51))) : F (X (((0 <= 0) U (1 <= p0)))) : NOT(G (X (NOT(G ((((3 <= p43 + p44 + p45) U (1 <= p81)) AND X ((NOT(X ((p2 <= p31 + p32 + p33))) AND (p31 + p32 + p33 + 1 <= p2))))))))) : NOT(F (G (X ((p52 + p54 + p53 <= p34 + p36 + p35))))) : ((1 <= 0) U NOT(X ((2 <= p46 + p48 + p47))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p3 <= p57 + p56 + p55)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p3 <= p57 + p56 + p55)))
lola: processed formula length: 31
lola: 61 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 251 markings, 609 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p83 + p84 + p85 <= 2) OR (F (G ((p71 + p70 + p72 + 1 <= p49 + p50 + p51))) AND (3 <= p83 + p84 + p85))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p83 + p84 + p85 <= 2) OR (F (G ((p71 + p70 + p72 + 1 <= p49 + p50 + p51))) AND (3 <= p83 + p84 + p85))))
lola: processed formula length: 109
lola: 61 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((X ((p76 <= p49 + p50 + p51)) AND (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((X ((p76 <= p49 + p50 + p51)) AND (1 <= p2))))))
lola: processed formula length: 60
lola: 61 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 32 markings, 32 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p43 + p44 + p45 <= p49 + p50 + p51)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p43 + p44 + p45 <= p49 + p50 + p51)))
lola: processed formula length: 44
lola: 61 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p0)))
lola: processed formula length: 17
lola: 61 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((3 <= p43 + p44 + p45) U (1 <= p81)) AND X ((X ((p31 + p32 + p33 + 1 <= p2)) AND (p31 + p32 + p33 + 1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((3 <= p43 + p44 + p45) U (1 <= p81)) AND X ((X ((p31 + p32 + p33 + 1 <= p2)) AND (p31 + p32 + p33 + 1 <= p2))))))
lola: processed formula length: 121
lola: 61 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 34 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p46 + p48 + p47 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p46 + p48 + p47 <= 1))
lola: processed formula length: 26
lola: 61 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 31 markings, 31 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p63 + p62 + p61)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((2 <= p63 + p62 + p61)))
lola: processed formula length: 30
lola: 61 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p34 + p36 + p35 + 1 <= p52 + p54 + p53)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p34 + p36 + p35 + 1 <= p52 + p54 + p53)))
lola: processed formula length: 48
lola: 61 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 108 markings, 154 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no no no no
lola:
preliminary result: no no yes no yes no no no no
lola: memory consumption: 18968 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-02"
export BK_EXAMINATION="LTLCardinality"
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 QuasiCertifProtocol-COL-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987872300721"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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