Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913700323.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-PT-V20P10N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 7.7K Mar 26 02:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 26 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 25 20:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K Mar 25 20:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.8K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 230K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Mar 25 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 25 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 129K Mar 25 12:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 376K Mar 25 12:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.5M 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 BridgeAndVehicles-PT-V20P10N50-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591143767410

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:22:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 00:22:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:22:48] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2020-06-03 00:22:49] [INFO ] Transformed 108 places.
[2020-06-03 00:22:49] [INFO ] Transformed 2228 transitions.
[2020-06-03 00:22:49] [INFO ] Parsed PT model containing 108 places and 2228 transitions in 268 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 121 ms.
Incomplete random walk after 100000 steps, including 577 resets, run finished after 735 ms. (steps per millisecond=136 ) properties seen :[1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1]
[2020-06-03 00:22:49] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2020-06-03 00:22:49] [INFO ] Computed 7 place invariants in 9 ms
[2020-06-03 00:22:50] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-06-03 00:22:50] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-03 00:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:22:50] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-06-03 00:22:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:22:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-03 00:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:22:50] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-06-03 00:22:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:22:50] [INFO ] [Nat]Added 102 Read/Feed constraints in 25 ms returned sat
[2020-06-03 00:22:50] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 243 ms.
[2020-06-03 00:23:00] [INFO ] Added : 195 causal constraints over 39 iterations in 9710 ms. Result :sat
[2020-06-03 00:23:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:23:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:23:00] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2020-06-03 00:23:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:23:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:23:00] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-06-03 00:23:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:23:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-03 00:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:23:00] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2020-06-03 00:23:00] [INFO ] [Nat]Added 102 Read/Feed constraints in 24 ms returned sat
[2020-06-03 00:23:00] [INFO ] Deduced a trap composed of 5 places in 192 ms
[2020-06-03 00:23:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2020-06-03 00:23:00] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 78 ms.
[2020-06-03 00:23:07] [INFO ] Added : 210 causal constraints over 42 iterations in 6694 ms. Result :sat
[2020-06-03 00:23:07] [INFO ] Deduced a trap composed of 5 places in 231 ms
[2020-06-03 00:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2020-06-03 00:23:07] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:23:07] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:23:07] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:23:07] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:23:07] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-06-03 00:23:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:23:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:23:07] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2020-06-03 00:23:07] [INFO ] [Nat]Added 102 Read/Feed constraints in 19 ms returned sat
[2020-06-03 00:23:08] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 167 ms.
[2020-06-03 00:23:20] [INFO ] Added : 285 causal constraints over 57 iterations in 12571 ms. Result :sat
[2020-06-03 00:23:20] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
[2020-06-03 00:23:21] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 00:23:21] [INFO ] Flatten gal took : 269 ms
[2020-06-03 00:23:21] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 00:23:21] [INFO ] Flatten gal took : 123 ms
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 00:23:21] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 00:23:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BridgeAndVehicles-PT-V20P10N50 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3049
rslt: Output for CTLCardinality @ BridgeAndVehicles-PT-V20P10N50

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(EF((p0 + 1 <= p26 + p27)))",
"processed_size": 29,
"rewrites": 22
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 329,
"markings": 329,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "AF(AX(((1 <= p5))))",
"processed_size": 19,
"rewrites": 22
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 31645300,
"markings": 9080862,
"produced_by": "CTL model checker",
"value": true
},
"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": 492
},
"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": "(p22 <= 2)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 167,
"markings": 168,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 41
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 574
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (G ((((p56 <= 0) OR (p55 + 1 <= p25)) AND ((p24 <= p22) OR (p24 <= p26 + p27)))))",
"processed_size": 85,
"rewrites": 21
},
"result":
{
"edges": 5044399,
"markings": 1547689,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2226
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 685
},
"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 <= p35)",
"processed_size": 10,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 856
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": "E (G (((1 <= p103) OR (p59 <= 0))))",
"processed_size": 36,
"rewrites": 21
},
"result":
{
"edges": 8237,
"markings": 3822,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 88
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 856
},
"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 <= p49)",
"processed_size": 10,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1142
},
"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": "(p24 <= 0)",
"processed_size": 10,
"rewrites": 24
},
"result":
{
"edges": 91,
"markings": 92,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1142
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((DEADLOCK OR F ((p39 <= p47))))",
"processed_size": 34,
"rewrites": 22
},
"result":
{
"edges": 34080723,
"markings": 9685183,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1667
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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": "E (G (NOT DEADLOCK))",
"processed_size": 20,
"rewrites": 21
},
"result":
{
"edges": 31785798,
"markings": 9080822,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2228
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3220
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((p25 <= 1) R (p56 + 1 <= p49)))",
"processed_size": 35,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3220
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G ((F ((p88 <= p81)) OR ((p92 <= p77) AND (p37 <= p104) AND ((p40 <= p45) OR (p49 <= p92)))))",
"processed_size": 94,
"rewrites": 22
},
"result":
{
"edges": 37229534,
"markings": 8753888,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 81388,
"runtime": 521.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(**)) : FALSE : (A((* R *)) OR E(G(NODEADLOCK))) : (** OR E(F(A(G(**))))) : TRUE : A(X(E(F(*)))) : A(F(**)) : A(G((DEADLOCK OR A(F(**))))) : (** OR E(G(**))) : A(G((A(F(**)) OR **))) : A(F(A(X(**))))"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "no no no yes yes yes no yes no yes yes ",
"value": "no no no yes yes yes no 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: 2336/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: E (G ((((p56 <= 0) OR (p55 + 1 <= p25)) AND ((p24 <= p22) OR (p24 <= p26 + p27))))) : NOT(E (G ((0 <= 0)))) : (NOT(E (((2 <= p25) U (p49 <= p56)))) OR E (G (E (X ((0 <= 0)))))) : ((1 <= p49) OR E (F (A (G ((1 <= p24)))))) : E (G ((0 <= 0))) : NOT(E (X (A (G ((p26 + p27 <= p0)))))) : A (F ((3 <= p22))) : A (G ((A (X ((1 <= 0))) OR A (F ((p39 <= p47)))))) : ((1 <= p35) OR E (G (((1 <= p103) OR (p59 <= 0))))) : A (G ((A (F ((p88 <= p81))) OR ((p92 <= p77) AND (p37 <= p104) AND ((p40 <= p45) OR (p49 <= p92)))))) : A (F (A (X (((1 <= p5))))))
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:279
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
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:335
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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: subprocess 1 will run for 354 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: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p0 + 1 <= p26 + p27)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((p0 + 1 <= p26 + p27)))
lola: processed formula length: 29
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 329 markings, 329 edges
lola: ========================================
lola: subprocess 3 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(((1 <= p5))))
lola: processed formula length: 19
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 497533 markings, 1600581 edges, 99507 markings/sec, 0 secs
lola: 983947 markings, 3247565 edges, 97283 markings/sec, 5 secs
lola: 1466374 markings, 4884766 edges, 96485 markings/sec, 10 secs
lola: 1954220 markings, 6564397 edges, 97569 markings/sec, 15 secs
lola: 2434992 markings, 8232277 edges, 96154 markings/sec, 20 secs
lola: 2916853 markings, 9901712 edges, 96372 markings/sec, 25 secs
lola: 3389295 markings, 11551344 edges, 94488 markings/sec, 30 secs
lola: 3866903 markings, 13191067 edges, 95522 markings/sec, 35 secs
lola: 4342818 markings, 14900256 edges, 95183 markings/sec, 40 secs
lola: 4818323 markings, 16566326 edges, 95101 markings/sec, 45 secs
lola: 5293888 markings, 18193288 edges, 95113 markings/sec, 50 secs
lola: 5770530 markings, 19916488 edges, 95328 markings/sec, 55 secs
lola: 6236092 markings, 21528937 edges, 93112 markings/sec, 60 secs
lola: 6714095 markings, 23253253 edges, 95601 markings/sec, 65 secs
lola: 7177564 markings, 24856440 edges, 92694 markings/sec, 70 secs
lola: 7656906 markings, 26588361 edges, 95868 markings/sec, 75 secs
lola: 8115664 markings, 28163328 edges, 91752 markings/sec, 80 secs
lola: 8572880 markings, 29856384 edges, 91443 markings/sec, 85 secs
lola: 9045298 markings, 31527412 edges, 94484 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9080862 markings, 31645300 edges
lola: ========================================
lola: subprocess 4 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p22)))
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: (p22 <= 2)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p22)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 168 markings, 167 edges
lola: ========================================
lola: subprocess 5 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p56 <= 0) OR (p55 + 1 <= p25)) AND ((p24 <= p22) OR (p24 <= p26 + p27)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p56 <= 0) OR (p55 + 1 <= p25)) AND ((p24 <= p22) OR (p24 <= p26 + p27)))))
lola: processed formula length: 85
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p56) AND (p25 <= p55)) OR ((p22 + 1 <= p24) AND (p26 + p27 + 1 <= p24)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 149)
lola: 445367 markings, 1370462 edges, 89073 markings/sec, 0 secs || sara is running 0 secs
lola: 872505 markings, 2773710 edges, 85428 markings/sec, 5 secs || sara is running 5 secs
lola: 1295340 markings, 4174291 edges, 84567 markings/sec, 10 secs || sara is running 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1547689 markings, 5044399 edges
lola: ========================================
lola: subprocess 6 will run for 685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p35) OR E (G (((1 <= p103) OR (p59 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p35)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p35)
lola: processed formula length: 10
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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: subprocess 7 will run for 856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p103) OR (p59 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p103) OR (p59 <= 0))))
lola: processed formula length: 36
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p103 <= 0) AND (1 <= p59))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 3822 markings, 8237 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p49) OR E (F (A (G ((1 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p49)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p49)
lola: processed formula length: 10
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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: subprocess 8 will run for 1142 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p24)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p24 <= 0)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p24)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: state equation task get result rewrite finished id 1
lola: The predicate is possibly invariant.
lola: 92 markings, 91 edges
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p24 <= 0)
lola: state equation task get result unparse finished id 1
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 1142 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((DEADLOCK OR A (F ((p39 <= p47))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((DEADLOCK OR F ((p39 <= p47))))
lola: processed formula length: 34
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 641277 markings, 2088694 edges, 128255 markings/sec, 0 secs
lola: 1268519 markings, 4235715 edges, 125448 markings/sec, 5 secs
lola: 1867477 markings, 6303065 edges, 119792 markings/sec, 10 secs
lola: 2444411 markings, 8317408 edges, 115387 markings/sec, 15 secs
lola: 2951559 markings, 10125483 edges, 101430 markings/sec, 20 secs
lola: 3433571 markings, 11807992 edges, 96402 markings/sec, 25 secs
lola: 3960616 markings, 13659411 edges, 105409 markings/sec, 30 secs
lola: 4470639 markings, 15508036 edges, 102005 markings/sec, 35 secs
lola: 4950150 markings, 17185203 edges, 95902 markings/sec, 40 secs
lola: 5479100 markings, 19066146 edges, 105790 markings/sec, 45 secs
lola: 5990189 markings, 20893450 edges, 102218 markings/sec, 50 secs
lola: 6492708 markings, 22643554 edges, 100504 markings/sec, 55 secs
lola: 7001067 markings, 24487006 edges, 101672 markings/sec, 60 secs
lola: 7498935 markings, 26223943 edges, 99574 markings/sec, 65 secs
lola: 7981549 markings, 27995164 edges, 96523 markings/sec, 70 secs
lola: 8486096 markings, 29785395 edges, 100909 markings/sec, 75 secs
lola: 8965108 markings, 31493684 edges, 95802 markings/sec, 80 secs
lola: 9482538 markings, 33357943 edges, 103486 markings/sec, 85 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The universal single path CTL formula holds.
lola: 9685183 markings, 34080723 edges
lola: ========================================
lola: subprocess 9 will run for 1667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p25 <= 1) R (p56 + 1 <= p49))) OR E (G (NOT DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (NOT DEADLOCK))
lola: processed formula length: 20
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:779
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: DEADLOCK
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: 413287 markings, 1333110 edges, 82657 markings/sec, 0 secs || sara not yet started (preprocessing)
lola: 820997 markings, 2710871 edges, 81542 markings/sec, 5 secs || sara not yet started (preprocessing)
lola: 1231818 markings, 4104314 edges, 82164 markings/sec, 10 secs || sara not yet started (preprocessing)
lola: 1633500 markings, 5496395 edges, 80336 markings/sec, 15 secs || sara not yet started (preprocessing)
lola: 2035605 markings, 6886657 edges, 80421 markings/sec, 20 secs || sara not yet started (preprocessing)
lola: 2437909 markings, 8279936 edges, 80461 markings/sec, 25 secs || sara not yet started (preprocessing)
lola: 2834816 markings, 9663462 edges, 79381 markings/sec, 30 secs || sara not yet started (preprocessing)
lola: 3238184 markings, 11046185 edges, 80674 markings/sec, 35 secs || sara not yet started (preprocessing)
lola: 3630604 markings, 12459363 edges, 78484 markings/sec, 40 secs || sara not yet started (preprocessing)
lola: 4025572 markings, 13838798 edges, 78994 markings/sec, 45 secs || sara not yet started (preprocessing)
lola: 4421624 markings, 15239469 edges, 79210 markings/sec, 50 secs || sara not yet started (preprocessing)
lola: 4815320 markings, 16629665 edges, 78739 markings/sec, 55 secs || sara not yet started (preprocessing)
lola: 5216725 markings, 18022747 edges, 80281 markings/sec, 60 secs || sara not yet started (preprocessing)
lola: 5604139 markings, 19420492 edges, 77483 markings/sec, 65 secs || sara not yet started (preprocessing)
lola: 6000665 markings, 20825762 edges, 79305 markings/sec, 70 secs || sara not yet started (preprocessing)
lola: 6391437 markings, 22200511 edges, 78154 markings/sec, 75 secs || sara not yet started (preprocessing)
lola: 6787654 markings, 23621834 edges, 79243 markings/sec, 80 secs || sara not yet started (preprocessing)
lola: 7180365 markings, 24977531 edges, 78542 markings/sec, 85 secs || sara not yet started (preprocessing)
lola: 7566375 markings, 26395558 edges, 77202 markings/sec, 90 secs || sara not yet started (preprocessing)
lola: 7959450 markings, 27784354 edges, 78615 markings/sec, 95 secs || sara not yet started (preprocessing)
lola: 8344834 markings, 29143893 edges, 77077 markings/sec, 100 secs || sara not yet started (preprocessing)
lola: 8740970 markings, 30571274 edges, 79227 markings/sec, 105 secs || sara not yet started (preprocessing)
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 9080822 markings, 31785798 edges
lola: ========================================
lola: subprocess 10 will run for 3220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p25 <= 1) R (p56 + 1 <= p49)))
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 (((p25 <= 1) R (p56 + 1 <= p49)))
lola: processed formula length: 35
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
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: (p49 <= p56)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 3220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((p88 <= p81))) OR ((p92 <= p77) AND (p37 <= p104) AND ((p40 <= p45) OR (p49 <= p92))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p88 <= p81)) OR ((p92 <= p77) AND (p37 <= p104) AND ((p40 <= p45) OR (p49 <= p92)))))
lola: processed formula length: 94
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 192292 markings, 733427 edges, 38458 markings/sec, 0 secs
lola: 436877 markings, 1727791 edges, 48917 markings/sec, 5 secs
lola: 657837 markings, 2622119 edges, 44192 markings/sec, 10 secs
lola: 896074 markings, 3603236 edges, 47647 markings/sec, 15 secs
lola: 1150878 markings, 4658972 edges, 50961 markings/sec, 20 secs
lola: 1418203 markings, 5765844 edges, 53465 markings/sec, 25 secs
lola: 1699890 markings, 6956692 edges, 56337 markings/sec, 30 secs
lola: 1892561 markings, 7759324 edges, 38534 markings/sec, 35 secs
lola: 2188435 markings, 8995254 edges, 59175 markings/sec, 40 secs
lola: 2434239 markings, 10053997 edges, 49161 markings/sec, 45 secs
lola: 2695323 markings, 11145265 edges, 52217 markings/sec, 50 secs
lola: 2954844 markings, 12262553 edges, 51904 markings/sec, 55 secs
lola: 3216439 markings, 13354057 edges, 52319 markings/sec, 60 secs
lola: 3432578 markings, 14284776 edges, 43228 markings/sec, 65 secs
lola: 3745057 markings, 15590386 edges, 62496 markings/sec, 70 secs
lola: 3960687 markings, 16548739 edges, 43126 markings/sec, 75 secs
lola: 4291084 markings, 17956956 edges, 66079 markings/sec, 80 secs
lola: 4507896 markings, 18871478 edges, 43362 markings/sec, 85 secs
lola: 4715108 markings, 19780746 edges, 41442 markings/sec, 90 secs
lola: 5064228 markings, 21246157 edges, 69824 markings/sec, 95 secs
lola: 5281394 markings, 22199251 edges, 43433 markings/sec, 100 secs
lola: 5489807 markings, 23116589 edges, 41683 markings/sec, 105 secs
lola: 5850063 markings, 24640403 edges, 72051 markings/sec, 110 secs
lola: 6062964 markings, 25558404 edges, 42580 markings/sec, 115 secs
lola: 6279673 markings, 26530571 edges, 43342 markings/sec, 120 secs
lola: 6579189 markings, 27821440 edges, 59903 markings/sec, 125 secs
lola: 6857528 markings, 28966211 edges, 55668 markings/sec, 130 secs
lola: 7082293 markings, 29983567 edges, 44953 markings/sec, 135 secs
lola: 7294231 markings, 30922347 edges, 42388 markings/sec, 140 secs
lola: 7657578 markings, 32483049 edges, 72669 markings/sec, 145 secs
lola: 7886230 markings, 33433263 edges, 45730 markings/sec, 150 secs
lola: 8111825 markings, 34454005 edges, 45119 markings/sec, 155 secs
lola: 8323503 markings, 35395043 edges, 42336 markings/sec, 160 secs
lola: 8680600 markings, 36935374 edges, 71419 markings/sec, 165 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The universal single path CTL formula holds.
lola: 8753888 markings, 37229534 edges
lola: RESULT
lola:
SUMMARY: no no no yes yes yes no yes no yes yes
lola:
preliminary result: no no no yes yes yes no yes no yes yes
lola: ========================================
lola: memory consumption: 81388 KB
lola: time consumption: 521 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V20P10N50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BridgeAndVehicles-PT-V20P10N50, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913700323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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