fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r176-tajo-158987872300724
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for QuasiCertifProtocol-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.110 3600000.00 14496.00 60.10 FTFFTTFFFTTTTFTT normal

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-158987872300724.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872300724
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591178383379

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 09:59:45] [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 09:59:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 09:59:45] [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:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 546 ms
[2020-06-03 09:59:45] [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:45] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 60 ms.
[2020-06-03 09:59:45] [INFO ] Computed order based on color domains.
[2020-06-03 09:59:45] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions in 6 ms.
[2020-06-03 09:59:45] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Incomplete random walk after 100000 steps, including 16427 resets, run finished after 348 ms. (steps per millisecond=287 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0]
// Phase 1: matrix 56 rows 86 cols
[2020-06-03 09:59:46] [INFO ] Computed 31 place invariants in 6 ms
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned unsat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 8 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-06-03 09:59:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:59:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:46] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2020-06-03 09:59:46] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-06-03 09:59:46] [INFO ] Added : 11 causal constraints over 3 iterations in 28 ms. Result :sat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-03 09:59:46] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-06-03 09:59:46] [INFO ] Added : 8 causal constraints over 2 iterations in 28 ms. Result :sat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 6 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-03 09:59:46] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-06-03 09:59:46] [INFO ] Added : 16 causal constraints over 4 iterations in 31 ms. Result :sat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-06-03 09:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:46] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-06-03 09:59:46] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 7 ms.
[2020-06-03 09:59:47] [INFO ] Added : 22 causal constraints over 5 iterations in 38 ms. Result :sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-03 09:59:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-06-03 09:59:47] [INFO ] Added : 11 causal constraints over 3 iterations in 18 ms. Result :sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-06-03 09:59:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-06-03 09:59:47] [INFO ] Added : 19 causal constraints over 4 iterations in 26 ms. Result :sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 7 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-06-03 09:59:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-06-03 09:59:47] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-03 09:59:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:59:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 6 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:47] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-06-03 09:59:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-06-03 09:59:47] [INFO ] Added : 14 causal constraints over 3 iterations in 23 ms. Result :sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-06-03 09:59:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-06-03 09:59:47] [INFO ] Added : 24 causal constraints over 5 iterations in 33 ms. Result :sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 8 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 8 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-03 09:59:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-06-03 09:59:47] [INFO ] Added : 21 causal constraints over 5 iterations in 33 ms. Result :sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 8 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-06-03 09:59:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-06-03 09:59:47] [INFO ] Added : 22 causal constraints over 5 iterations in 31 ms. Result :sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-03 09:59:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-06-03 09:59:47] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2020-06-03 09:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:59:48] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-03 09:59:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-06-03 09:59:48] [INFO ] Added : 19 causal constraints over 4 iterations in 37 ms. Result :sat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-03 09:59:48] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 09:59:48] [INFO ] Flatten gal took : 28 ms
[2020-06-03 09:59:48] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 09:59:48] [INFO ] Flatten gal took : 11 ms
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 09:59:48] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-03 09:59:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ QuasiCertifProtocol-COL-02 @ 3570 seconds

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

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

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

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

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

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

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

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

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

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

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

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

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

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLFireability @ 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=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 09:59:48 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "E (G (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80))))",
"processed_size": 65,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 6,
"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": 4,
"visible_transitions": 0
},
"processed": "(((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))",
"processed_size": 90,
"rewrites": 33
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 8
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "AX(AF(EG(((1 <= p65) OR (1 <= p64) OR (1 <= p66)))))",
"processed_size": 54,
"rewrites": 34
},
"net":
{
"conflict_clusters": 20,
"singleton_clusters": 0
},
"result":
{
"edges": 435,
"markings": 197,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"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": 4,
"visible_transitions": 0
},
"processed": "(((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0)))",
"processed_size": 90,
"rewrites": 34
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 27
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((p80 <= 0) R (p78 <= 0)))",
"processed_size": 29,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"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": 4,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72)))))",
"processed_size": 98,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p79 <= 0)))",
"processed_size": 18,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"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": "E (G (((p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p78 <= 0))))",
"processed_size": 65,
"rewrites": 32
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 6,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (G ((((((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61))) AND ((1 <= p65) OR (1 <= p64) OR (1 <= p66))) OR (((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0))))))",
"processed_size": 247,
"rewrites": 32
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 31
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 120,
"problems": 24
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p78)",
"processed_size": 10,
"rewrites": 33
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 6,
"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 <= p80) OR (1 <= p77) OR (p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p78 <= 0))))",
"processed_size": 95,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p79 <= 0)",
"processed_size": 10,
"rewrites": 34
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 12,
"adisj": 4,
"aneg": 0,
"comp": 34,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 34,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 29,
"visible_transitions": 0
},
"processed": "AF(((1 <= p79) AND (EX((((1 <= p13) AND (1 <= p14) AND (1 <= p15) AND (1 <= p67)) OR ((1 <= p16) AND (1 <= p17) AND (1 <= p18) AND (1 <= p68)) OR ((1 <= p19) AND (1 <= p20) AND (1 <= p21) AND (1 <= p69)))) AND (A(((1 <= p65) OR (1 <= p64) OR (1 <= p66)) U (((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)))) AND (((1 <= p0) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p51)) OR ((1 <= p0) AND (1 <= p49)) OR ((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72)))))))",
"processed_size": 546,
"rewrites": 34
},
"net":
{
"conflict_clusters": 20,
"singleton_clusters": 0
},
"result":
{
"edges": 30,
"markings": 31,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "E (G (((p77 <= 0) OR (1 <= p79) OR (1 <= p78))))",
"processed_size": 50,
"rewrites": 32
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": "E (G (((p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p76 <= 0))))",
"processed_size": 65,
"rewrites": 32
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"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": "(((p35 <= 0) OR (p62 <= 0)) AND ((p36 <= 0) OR (p63 <= 0)) AND ((p34 <= 0) OR (p61 <= 0)))",
"processed_size": 93,
"rewrites": 34
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E ((((1 <= p76) OR (1 <= p65) OR (1 <= p64) OR (1 <= p66)) R (p79 <= 0)))",
"processed_size": 76,
"rewrites": 34
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"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": "((p43 <= 0) OR (p44 <= 0) OR (p45 <= 0) OR (p80 <= 0))",
"processed_size": 57,
"rewrites": 34
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 17,
"aneg": 0,
"comp": 31,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "((1 <= p79) AND ((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0)) AND ((((p42 <= 0) OR (p60 <= 0)) AND ((p41 <= 0) OR (p59 <= 0)) AND ((p40 <= 0) OR (p58 <= 0))) OR (((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))) AND ((((p48 <= 0) OR (p57 <= 0)) AND ((p46 <= 0) OR (p55 <= 0)) AND ((p47 <= 0) OR (p56 <= 0))) OR (((p0 <= 0) OR (p68 <= 0)) AND ((p0 <= 0) OR (p69 <= 0)) AND ((p0 <= 0) OR (p67 <= 0)))))",
"processed_size": 495,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p81) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76)))",
"processed_size": 74,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"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": "E (G (((p65 <= 0) AND (p64 <= 0) AND (p66 <= 0))))",
"processed_size": 50,
"rewrites": 32
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 4,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "((((p0 <= 0) OR (p62 <= 0)) AND ((p0 <= 0) OR (p63 <= 0)) AND ((p0 <= 0) OR (p61 <= 0))) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p10) AND (1 <= p49)))",
"processed_size": 272,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 51180,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : A(F(**)) : (A(X(A(F(**)))) AND E(F(**))) : (E(X(E(G(**)))) OR (E(G(**)) AND **)) : (A(F(**)) OR **) : A(X(A(F(E(G(**)))))) : (A((* R *)) AND (E(X(**)) AND (A(G(**)) OR A(F(**))))) : E(G(**)) : (E(X(E(F(**)))) AND (E(F(*)) AND (E(G(*)) AND E(G(**))))) : ((** OR (E(G(*)) OR (A(G(**)) AND **))) AND **) : TRUE : A(F((** AND (E(X(**)) AND (A((** U **)) AND **))))) : E(G(**)) : E((* R *))"
},
"net":
{
"arcs": 223,
"conflict_clusters": 20,
"places": 86,
"places_significant": 55,
"singleton_clusters": 0,
"transitions": 56
},
"result":
{
"preliminary_value": "yes no no yes no no no yes yes yes yes no yes yes ",
"value": "yes no no yes no no no yes yes yes yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 CTLFireability.xml
lola: E (G ((0 <= 0))) : A (F ((((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61))))) : (A (X (A (F ((1 <= p79))))) AND E (F (((1 <= p80) OR (1 <= p77) OR (p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p78 <= 0))))) : (E (X (E (G ((((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0))))))) OR (E (G (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80)))) AND ((((p48 <= 0) OR (p57 <= 0)) AND ((p46 <= 0) OR (p55 <= 0)) AND ((p47 <= 0) OR (p56 <= 0)) AND ((p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p76 <= 0))) OR ((p81 <= 0) AND ((p48 <= 0) OR (p57 <= 0)) AND ((p46 <= 0) OR (p55 <= 0)) AND ((p47 <= 0) OR (p56 <= 0))) OR ((1 <= p77) AND (p71 <= 0) AND (p70 <= 0) AND (p72 <= 0))))) : (A (F (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80)))) OR ((1 <= p79) AND ((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0)) AND ((((p42 <= 0) OR (p60 <= 0)) AND ((p41 <= 0) OR (p59 <= 0)) AND ((p40 <= 0) OR (p58 <= 0))) OR (((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))) AND ((((p48 <= 0) OR (p57 <= 0)) AND ((p46 <= 0) OR (p55 <= 0)) AND ((p47 <= 0) OR (p56 <= 0))) OR (((p0 <= 0) OR (p68 <= 0)) AND ((p0 <= 0) OR (p69 <= 0)) AND ((p0 <= 0) OR (p67 <= 0)))))) : A (X (A (F (E (G (((1 <= p65) OR (1 <= p64) OR (1 <= p66)))))))) : ((NOT(E (((1 <= p80) U (1 <= p78)))) AND E (X ((((1 <= p0) AND (1 <= p55)) OR ((1 <= p0) AND (1 <= p56)) OR ((1 <= p0) AND (1 <= p57)))))) AND (A (G ((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72))))) OR A (F ((((1 <= p0) AND (1 <= p66)) OR ((1 <= p0) AND (1 <= p64)) OR ((1 <= p0) AND (1 <= p65))))))) : E (G (((p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p76 <= 0)))) : (((E (X (E (F ((1 <= p78))))) AND NOT(A (G ((1 <= p79))))) AND NOT(A (F (((1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p78)))))) AND E (G ((((((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61))) AND ((1 <= p65) OR (1 <= p64) OR (1 <= p66))) OR (((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0))))))) : ((((1 <= p79) OR NOT(A (F (((1 <= p65) OR (1 <= p64) OR (1 <= p66)))))) OR (A (G ((((1 <= p0) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p51)) OR ((1 <= p0) AND (1 <= p49))))) AND ((1 <= p81) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76))))) AND ((((p0 <= 0) OR (p62 <= 0)) AND ((p0 <= 0) OR (p63 <= 0)) AND ((p0 <= 0) OR (p61 <= 0))) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p10) AND (1 <= p49)))) : E (G ((0 <= 0))) : A (F (((((1 <= p79) AND E (X ((((1 <= p13) AND (1 <= p14) AND (1 <= p15) AND (1 <= p67)) OR ((1 <= p16) AND (1 <= p17) AND (1 <= p18) AND (1 <= p68)) OR ((1 <= p19) AND (1 <= p20) AND (1 <= p21) AND (1 <= p69)))))) AND A ((((1 <= p65) OR (1 <= p64) OR (1 <= p66)) U (((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)))))) AND (((1 <= p0) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p51)) OR ((1 <= p0) AND (1 <= p49)) OR ((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72)))))) : E (G (((p77 <= 0) OR (1 <= p79) OR (1 <= p78)))) : NOT(A ((((p76 <= 0) AND (p65 <= 0) AND (p64 <= 0) AND (p66 <= 0)) U (1 <= p79))))
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 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: 31 rewrites
lola: closed formula file CTLFireability.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 274 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: 31 rewrites
lola: closed formula file CTLFireability.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 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (G ((((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0))))))) OR (E (G (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80)))) AND ((((p48 <= 0) OR (p57 <= 0)) AND ((p46 <= 0) OR (p55 <= 0)) AND ((p47 <= 0) OR (p56 <= 0)) AND ((p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p76 <= 0))) OR ((p81 <= 0) AND ((p48 <= 0) OR (p57 <= 0)) AND ((p46 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80))))
lola: processed formula length: 65
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: no
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: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: formula 0: ((p43 <= 0) OR (p44 <= 0) OR (p45 <= 0) OR (p80 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))
lola: processed formula length: 90
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: state equation task get result unparse finished id 0
lola: The predicate is possibly preserved from some successor.
lola: 5 markings, 4 edges
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (E (G (((1 <= p65) OR (1 <= p64) OR (1 <= p66))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AF(EG(((1 <= p65) OR (1 <= p64) OR (1 <= p66)))))
lola: processed formula length: 54
lola: 34 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: 197 markings, 435 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p80 <= 0) R (p78 <= 0))) AND (E (X ((((1 <= p0) AND (1 <= p55)) OR ((1 <= p0) AND (1 <= p56)) OR ((1 <= p0) AND (1 <= p57))))) AND (A (G ((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72))))) OR A (F ((((1 <= p0) AND (1 <= p66)) OR ((1 <= p0) AND (1 <= p64)) OR ((1 <= p0) AND (1 <= p65))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p0) AND (1 <= p66)) OR ((1 <= p0) AND (1 <= p64)) OR ((1 <= p0) AND (1 <= p65)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0)))
lola: processed formula length: 90
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: formula 0: (((1 <= p0) AND (1 <= p66)) OR ((1 <= p0) AND (1 <= p64)) OR ((1 <= p0) AND (1 <= p65)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p80 <= 0) R (p78 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((p80 <= 0) R (p78 <= 0)))
lola: processed formula length: 29
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p78)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72)))))
lola: processed formula length: 98
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not invariant.
lola: formula 0: (((p0 <= 0) OR (p70 <= 0)) AND ((p0 <= 0) OR (p71 <= 0)) AND ((p0 <= 0) OR (p72 <= 0)))
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((1 <= p78))))) AND (E (F ((p79 <= 0))) AND (E (G (((p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p78 <= 0)))) AND E (G ((((((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61))) AND ((1 <= p65) OR (1 <= p64) OR (1 <= p66))) OR (((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p79 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p79 <= 0)))
lola: processed formula length: 18
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p79 <= 0)
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p78 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p78 <= 0))))
lola: processed formula length: 65
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p78))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61))) AND ((1 <= p65) OR (1 <= p64) OR (1 <= p66))) OR (((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61))) AND ((1 <= p65) OR (1 <= p64) OR (1 <= p66))) OR (((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0))))))
lola: processed formula length: 247
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 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: (((((p35 <= 0) OR (p62 <= 0)) AND ((p36 <= 0) OR (p63 <= 0)) AND ((p34 <= 0) OR (p61 <= 0))) OR ((p65 <= 0) AND (p64 <= 0) AND (p66 <= 0))) AND (((1 <= p0) AND (1 <= p66)) OR ((1 <= p0) AND (1 <= p64)) OR ((1 <= p0) AND (1 <= p65))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 120 literals and 24 conjunctive subformulas
lola: The predicate is possibly preserved.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((1 <= p78)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (1 <= p78)
lola: processed formula length: 10
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: 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: (1 <= p78)
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 /EXEF
lola: The predicate is reachable from some successor.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((1 <= p79))))) AND E (F (((1 <= p80) OR (1 <= p77) OR (p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p78 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p80) OR (1 <= p77) OR (p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p78 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p80) OR (1 <= p77) OR (p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p78 <= 0))))
lola: processed formula length: 95
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
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: ((1 <= p80) OR (1 <= p77) OR (p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p78 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 6 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= p79)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p79 <= 0)
lola: processed formula length: 10
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p79)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur from all successors.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p79) AND (E (X ((((1 <= p13) AND (1 <= p14) AND (1 <= p15) AND (1 <= p67)) OR ((1 <= p16) AND (1 <= p17) AND (1 <= p18) AND (1 <= p68)) OR ((1 <= p19) AND (1 <= p20) AND (1 <= p21) AND (1 <= p69))))) AND (A ((((1 <= p65) OR (1 <= p64) OR (1 <= p66)) U (((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56))))) AND (((1 <= p0) AND (1 <= p50)) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((1 <= p79) AND (EX((((1 <= p13) AND (1 <= p14) AND (1 <= p15) AND (1 <= p67)) OR ((1 <= p16) AND (1 <= p17) AND (1 <= p18) AND (1 <= p68)) OR ((1 <= p19) AND (1 <= p20) AND (1 <= p21) AND (1 <= p69)))) AND (A(((1 <= p65) OR (1 <= p64) OR (1 <= p66)) U (((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)))) AND (((1 <= p0) AND (1 <= p50)) OR ((1 <= p0... (shortened)
lola: processed formula length: 546
lola: 34 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: 31 markings, 30 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p77 <= 0) OR (1 <= p79) OR (1 <= p78))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p77 <= 0) OR (1 <= p79) OR (1 <= p78))))
lola: processed formula length: 50
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 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 <= p77) AND (p79 <= 0) AND (p78 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p76 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p76 <= 0))))
lola: processed formula length: 65
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 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 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p35 <= 0) OR (p62 <= 0)) AND ((p36 <= 0) OR (p63 <= 0)) AND ((p34 <= 0) OR (p61 <= 0)))
lola: processed formula length: 93
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur.
lola: formula 0: (((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61)))
lola: state equation task get result unparse finished id 0
lola: 8 markings, 7 edges
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p76) OR (1 <= p65) OR (1 <= p64) OR (1 <= p66)) R (p79 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E ((((1 <= p76) OR (1 <= p65) OR (1 <= p64) OR (1 <= p66)) R (p79 <= 0)))
lola: processed formula length: 76
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p79)
lola: state equation task get result unparse finished id 0
lola: 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80)))) OR ((1 <= p79) AND ((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0)) AND ((((p42 <= 0) OR (p60 <= 0)) AND ((p41 <= 0) OR (p59 <= 0)) AND ((p40 <= 0) OR (p58 <= 0))) OR (((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))) AND ((((p48 <= 0) OR (p57 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p43 <= 0) OR (p44 <= 0) OR (p45 <= 0) OR (p80 <= 0))
lola: processed formula length: 57
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: formula 0: ((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80))
lola: state equation task get result unparse finished id 0
lola: The predicate does not eventually occur.
lola: 7 markings, 6 edges
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p79) AND ((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0)) AND ((((p42 <= 0) OR (p60 <= 0)) AND ((p41 <= 0) OR (p59 <= 0)) AND ((p40 <= 0) OR (p58 <= 0))) OR (((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))) AND ((((p48 <= 0) OR (p57 <= 0)) AND ((p46 <= 0) OR (p55 <= 0)) AND ((p47 <= 0) OR (p56 <= 0))) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p79) AND ((p0 <= 0) OR (p66 <= 0)) AND ((p0 <= 0) OR (p64 <= 0)) AND ((p0 <= 0) OR (p65 <= 0)) AND ((((p42 <= 0) OR (p60 <= 0)) AND ((p41 <= 0) OR (p59 <= 0)) AND ((p40 <= 0) OR (p58 <= 0))) OR (((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))) AND ((((p48 <= 0) OR (p57 <= 0)) AND ((p46 <= 0) OR (p55 <= 0)) AND ((p47 <= 0) OR (p56 <= 0))) O... (shortened)
lola: processed formula length: 495
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 31 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p79) OR (E (G (((p65 <= 0) AND (p64 <= 0) AND (p66 <= 0)))) OR (A (G ((((1 <= p0) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p51)) OR ((1 <= p0) AND (1 <= p49))))) AND ((1 <= p81) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76)))))) AND ((((p0 <= 0) OR (p62 <= 0)) AND ((p0 <= 0) OR (p63 <= 0)) AND ((p0 <= 0) OR (p61 <= 0))) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p81) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p81) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76)))
lola: processed formula length: 74
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 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: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p65 <= 0) AND (p64 <= 0) AND (p66 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p65 <= 0) AND (p64 <= 0) AND (p66 <= 0))))
lola: processed formula length: 50
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p65) OR (1 <= p64) OR (1 <= p66))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p0 <= 0) OR (p62 <= 0)) AND ((p0 <= 0) OR (p63 <= 0)) AND ((p0 <= 0) OR (p61 <= 0))) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p10) AND (1 <= p49)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((p0 <= 0) OR (p62 <= 0)) AND ((p0 <= 0) OR (p63 <= 0)) AND ((p0 <= 0) OR (p61 <= 0))) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p10) AND (1 <= p49)))
lola: processed formula length: 272
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 18 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no no yes yes yes yes no yes yes
lola:
preliminary result: yes no no yes no no no yes yes yes yes no yes yes
lola: memory consumption: 51180 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="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 QuasiCertifProtocol-COL-02, 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 r176-tajo-158987872300724"
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 [ "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 ;