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.r178-tajo-158987883000865.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 DrinkVendingMachine-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987883000865
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 3.5K Mar 31 07:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 31 07:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 30 00:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 30 00:30 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 5.6K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 28 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 27 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 27 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 68K 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 DrinkVendingMachine-PT-02-00
FORMULA_NAME DrinkVendingMachine-PT-02-01
FORMULA_NAME DrinkVendingMachine-PT-02-02
FORMULA_NAME DrinkVendingMachine-PT-02-03
FORMULA_NAME DrinkVendingMachine-PT-02-04
FORMULA_NAME DrinkVendingMachine-PT-02-05
FORMULA_NAME DrinkVendingMachine-PT-02-06
FORMULA_NAME DrinkVendingMachine-PT-02-07
FORMULA_NAME DrinkVendingMachine-PT-02-08
FORMULA_NAME DrinkVendingMachine-PT-02-09
FORMULA_NAME DrinkVendingMachine-PT-02-10
FORMULA_NAME DrinkVendingMachine-PT-02-11
FORMULA_NAME DrinkVendingMachine-PT-02-12
FORMULA_NAME DrinkVendingMachine-PT-02-13
FORMULA_NAME DrinkVendingMachine-PT-02-14
FORMULA_NAME DrinkVendingMachine-PT-02-15

=== Now, execution of the tool begins

BK_START 1591249925988

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 05:52:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 05:52:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 05:52:18] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-06-04 05:52:18] [INFO ] Transformed 24 places.
[2020-06-04 05:52:18] [INFO ] Transformed 72 transitions.
[2020-06-04 05:52:18] [INFO ] Parsed PT model containing 24 places and 72 transitions in 102 ms.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 284 ms. (steps per millisecond=352 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 52 rows 24 cols
[2020-06-04 05:52:18] [INFO ] Computed 12 place invariants in 5 ms
[2020-06-04 05:52:18] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned unsat
[2020-06-04 05:52:18] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2020-06-04 05:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:18] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-04 05:52:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:52:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2020-06-04 05:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:18] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-06-04 05:52:18] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 9 ms.
[2020-06-04 05:52:18] [INFO ] Added : 36 causal constraints over 8 iterations in 62 ms. Result :sat
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2020-06-04 05:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-04 05:52:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:52:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-04 05:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:19] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-04 05:52:19] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 4 ms.
[2020-06-04 05:52:19] [INFO ] Added : 36 causal constraints over 8 iterations in 42 ms. Result :sat
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-06-04 05:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-04 05:52:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:52:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-04 05:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:19] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-04 05:52:19] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 4 ms.
[2020-06-04 05:52:19] [INFO ] Added : 36 causal constraints over 8 iterations in 39 ms. Result :sat
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-06-04 05:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-04 05:52:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:52:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-04 05:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:19] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-04 05:52:19] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 9 ms.
[2020-06-04 05:52:19] [INFO ] Added : 36 causal constraints over 8 iterations in 44 ms. Result :sat
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-06-04 05:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-04 05:52:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:52:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-04 05:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-04 05:52:19] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 5 ms.
[2020-06-04 05:52:19] [INFO ] Added : 36 causal constraints over 8 iterations in 38 ms. Result :sat
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-06-04 05:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-04 05:52:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:52:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-04 05:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 05:52:19] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-04 05:52:19] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 5 ms.
[2020-06-04 05:52:19] [INFO ] Added : 36 causal constraints over 8 iterations in 38 ms. Result :sat
[2020-06-04 05:52:19] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-04 05:52:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 05:52:19] [INFO ] Flatten gal took : 32 ms
FORMULA DrinkVendingMachine-PT-02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 05:52:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 05:52:19] [INFO ] Flatten gal took : 13 ms
[2020-06-04 05:52:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DrinkVendingMachine-PT-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 05:52:19] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 05:52:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DrinkVendingMachine-PT-02 @ 3570 seconds

FORMULA DrinkVendingMachine-PT-02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ DrinkVendingMachine-PT-02

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) U X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20))))",
"processed_size": 193,
"rewrites": 83
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "X (((G ((p10 + p11 <= 1)) OR (p8 + p9 + 1 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20)) U X (((p21 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) OR (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 <= p8 + p9)))))",
"processed_size": 218,
"rewrites": 83
},
"result":
{
"edges": 268,
"markings": 118,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "X (((2 <= p19 + p22) U (p19 + p22 <= p10 + p11)))",
"processed_size": 49,
"rewrites": 83
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (F ((X (F ((2 <= p19 + p22))) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20))))",
"processed_size": 126,
"rewrites": 83
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (G ((X ((p19 + p22 <= p21 + p23)) AND ((p8 + p9 <= p21 + p23) AND (p21 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))",
"processed_size": 124,
"rewrites": 83
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 26,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "F (G ((F ((((p19 + p22 + 1 <= p8 + p9) R (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p8 + p9)) AND (p21 + p23 <= 1))) OR X (X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p8 + p9)))))))",
"processed_size": 192,
"rewrites": 83
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "X (X (X (X (F ((1 <= p19 + p22))))))",
"processed_size": 36,
"rewrites": 83
},
"result":
{
"edges": 1502,
"markings": 486,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "X (G ((p15 + 1 <= p19)))",
"processed_size": 24,
"rewrites": 83
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p11 <= p23)",
"processed_size": 12,
"rewrites": 83
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p21 <= p22))",
"processed_size": 16,
"rewrites": 83
},
"result":
{
"edges": 22,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "G ((p23 + 1 <= p5))",
"processed_size": 19,
"rewrites": 83
},
"result":
{
"edges": 19,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (((p8 + 1 <= p17) AND (F (G ((p22 + 1 <= p1))) OR G ((p8 + 1 <= p17)))))",
"processed_size": 74,
"rewrites": 83
},
"result":
{
"edges": 13,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((G ((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 <= p21 + p23)) OR (1 <= p19 + p22))))",
"processed_size": 94,
"rewrites": 83
},
"result":
{
"edges": 17620,
"markings": 2451,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 25444,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** U X(F(**))) : X(((G(*) OR *) U X(**))) : X((** U **)) : X(F((X(F(*)) OR **))) : X(G((X(**) AND (** AND **)))) : F(G((F(((* R *) AND *)) OR X(X(F(*)))))) : G(F((G(**) OR **))) : X(X(X(X(F(*))))) : X((X(G(*)) AND (** U X(**)))) : (X(G(*)) OR (F(G(*)) AND F(G(*)))) : F((* AND (F(G(*)) OR G(*)))) : X(((** U **) AND (G(**) OR **))) : G(*) : (X(**) AND (G(**) AND (G(F(**)) OR **)))"
},
"net":
{
"arcs": 280,
"conflict_clusters": 13,
"places": 24,
"places_significant": 12,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "no yes no no no no yes yes no no no no no no ",
"value": "no yes no no no no yes yes no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 76/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24
lola: finding significant places
lola: 24 places, 52 transitions, 12 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: ((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) U X (F (((1 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20) U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20))))) : X ((NOT(((1 <= 0) U (F ((2 <= p10 + p11)) AND (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 <= p8 + p9)))) U X (((p21 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) OR (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 <= p8 + p9))))) : X (((2 <= p19 + p22) U (p19 + p22 <= p10 + p11))) : X (F ((F (NOT(X ((p19 + p22 <= 1)))) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20)))) : G (X (G (((X ((p19 + p22 <= p21 + p23)) AND (p8 + p9 <= p21 + p23)) AND (p21 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))) : F (NOT(F ((G ((((p8 + p9 <= p19 + p22) U (p8 + p9 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) OR (2 <= p21 + p23))) AND G (X (X ((p8 + p9 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))))) : X (G (NOT(X (F (X (F (NOT(F (X ((G ((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 <= p21 + p23)) OR (1 <= p19 + p22)))))))))))) : X (X (X (F (X (NOT(((1 <= 0) U (p19 + p22 <= 0)))))))) : X ((X (G (NOT(F ((p1 <= p15))))) AND ((1 <= p23) U X ((1 <= p23))))) : (NOT(G (F ((p19 <= p15)))) U G (X (NOT(((1 <= 0) U (p19 <= p15)))))) : F (NOT((X (G (F (X (F ((p1 <= p22)))))) U (p17 <= p8)))) : X ((((1 <= p2) U (p5 <= p22)) AND (G ((1 <= p2)) OR (p22 <= p6)))) : NOT(((F (((p5 <= p23) AND (1 <= p19))) OR X ((G ((1 <= p22)) AND F ((1 <= p19))))) U F ((p5 <= p23)))) : ((X ((p23 <= p10)) AND G ((p21 <= p22))) AND (G (((1 <= p12) U F ((p23 <= p10)))) OR (p11 <= p23)))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) U X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) U X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20))))
lola: processed formula length: 193
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G ((p10 + p11 <= 1)) OR (p8 + p9 + 1 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20)) U X (((p21 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) OR (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 <= p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G ((p10 + p11 <= 1)) OR (p8 + p9 + 1 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20)) U X (((p21 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) OR (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 <= p8 + p9)))))
lola: processed formula length: 218
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 118 markings, 268 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((2 <= p19 + p22) U (p19 + p22 <= p10 + p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((2 <= p19 + p22) U (p19 + p22 <= p10 + p11)))
lola: processed formula length: 49
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F ((2 <= p19 + p22))) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F ((2 <= p19 + p22))) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20))))
lola: processed formula length: 126
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p19 + p22 <= p21 + p23)) AND ((p8 + p9 <= p21 + p23) AND (p21 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p19 + p22 <= p21 + p23)) AND ((p8 + p9 <= p21 + p23) AND (p21 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
lola: processed formula length: 124
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((p19 + p22 + 1 <= p8 + p9) R (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p8 + p9)) AND (p21 + p23 <= 1))) OR X (X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p8 + p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((p19 + p22 + 1 <= p8 + p9) R (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p8 + p9)) AND (p21 + p23 <= 1))) OR X (X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p8 + p9)))))))
lola: processed formula length: 192
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (F ((1 <= p19 + p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (F ((1 <= p19 + p22))))))
lola: processed formula length: 36
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 486 markings, 1502 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((p15 + 1 <= p1))) AND ((1 <= p23) U X ((1 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((p15 + 1 <= p1))) AND ((1 <= p23) U X ((1 <= p23)))))
lola: processed formula length: 63
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p15 + 1 <= p19))) OR (F (G ((p15 + 1 <= p19))) AND F (G ((p15 + 1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p15 + 1 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p15 + 1 <= p19)))
lola: processed formula length: 24
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 31 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p15 + 1 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p15 + 1 <= p19)))
lola: processed formula length: 24
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p2) U (p5 <= p22)) AND (G ((1 <= p2)) OR (p22 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p2) U (p5 <= p22)) AND (G ((1 <= p2)) OR (p22 <= p6))))
lola: processed formula length: 66
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p23 <= p10)) AND (G ((p21 <= p22)) AND (G (F ((p23 <= p10))) OR (p11 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p11 <= p23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p11 <= p23)
lola: processed formula length: 12
lola: 83 rewrites
lola: closed formula file LTLCardinality.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 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p21 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p21 <= p22))
lola: processed formula length: 16
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p23 + 1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p23 + 1 <= p5))
lola: processed formula length: 19
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 19 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p8 + 1 <= p17) AND (F (G ((p22 + 1 <= p1))) OR G ((p8 + 1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((p8 + 1 <= p17) AND (F (G ((p22 + 1 <= p1))) OR G ((p8 + 1 <= p17)))))
lola: processed formula length: 74
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 13 edges
lola: ========================================
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 <= p21 + p23)) OR (1 <= p19 + p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p20 <= p21 + p23)) OR (1 <= p19 + p22))))
lola: processed formula length: 94
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2451 markings, 17620 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no yes yes no no no no no no
lola:
preliminary result: no yes no no no no yes yes no no no no no no
lola: memory consumption: 25444 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DrinkVendingMachine-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987883000865"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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