About the Execution of Irma.struct for GPPP-PT-C0100N0000001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.480 | 3262695.00 | 4260897.00 | 60967.20 | F?F?T?FTTTFF?F?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is GPPP-PT-C0100N0000001000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-blw7-152650003600318
=====================================================================
--------------------
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 GPPP-PT-C0100N0000001000-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527197630935
BK_STOP 1527200893630
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using GPPP-PT-C0100N0000001000 as instance name.
Using GPPP as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 538454, 'Memory': 15953.19, 'Tool': 'marcie'}, {'Time': 1045652, 'Memory': 15953.35, 'Tool': 'marcie'}, {'Time': 1417628, 'Memory': 15952.78, 'Tool': 'lola'}, {'Time': 1429570, 'Memory': 15923.15, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality marcie GPPP-PT-C0100N0000001000...
timeout --kill-after=10s --signal=SIGINT 1m for testing only
check for maximal unmarked siphon
Marcie rev. 8852M (built: crohr on 2017-05-03)
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6
parse successfull
net created successfully
Net: GPPP_PT_C0100N0000001000
(NrP: 33 NrTr: 22 NrArc: 83)
ok
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
net check time: 0m 0.000sec
init dd package: 0m 1.472sec
parse successfull
net created successfully
Net: GPPP_PT_C0100N0000001000
(NrP: 33 NrTr: 22 NrArc: 83)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.864sec
iterations count:11921 (541), effective:2875 (130)
RS generation: 3m42.847sec
-> reachability set: #nodes 713713 (7.1e+05) #states 20,292,531,036,711,574 (16)
starting MCC model checker
--------------------------
initing FirstDep: 0m 0.000sec
iterations count:100 (4), effective:11 (0)
checking: ~ [AG [EF [3<=GSH]]]
normalized: E [true U ~ [E [true U 3<=GSH]]]
abstracting: (3<=GSH)
states: 20,156,724,355,828,212 (16)
sat_reach.icc:155: Timeout: after 210 sec
std::bad_alloc
MC time: 3m31.062sec
checking: AX [EF [~ [3<=NADPplus]]]
normalized: ~ [EX [~ [E [true U ~ [3<=NADPplus]]]]]
abstracting: (3<=NADPplus)
states: 20,292,531,036,711,574 (16)
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-14 CANNOT_COMPUTE
/usr/bin/mcc-head: line 8: 7 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}
CTLCardinality marcie GPPP-PT-C0100N0000001000...
timeout --kill-after=10s --signal=SIGINT 1m for testing only
check for maximal unmarked siphon
Marcie rev. 8852M (built: crohr on 2017-05-03)
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6
parse successfull
net created successfully
Net: GPPP_PT_C0100N0000001000
(NrP: 33 NrTr: 22 NrArc: 83)
ok
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
net check time: 0m 0.000sec
init dd package: 0m 1.352sec
ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!
parse successfull
net created successfully
Net: GPPP_PT_C0100N0000001000
(NrP: 33 NrTr: 22 NrArc: 83)
check for maximal unmarked siphon
ok
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
net check time: 0m 0.000sec
init dd package: 0m 3.980sec
initing FirstDep: 0m 0.000sec
iterations count:11921 (541), effective:2875 (130)
initing FirstDep: 0m 0.000sec
RS generation: 4m 4.096sec
-> reachability set: #nodes 713713 (7.1e+05) #states 20,292,531,036,711,574 (16)
starting MCC model checker
--------------------------
checking: ~ [AG [EF [3<=GSH]]]
normalized: E [true U ~ [E [true U 3<=GSH]]]
abstracting: (3<=GSH)
states: 20,156,724,355,828,212 (16)
iterations count:100 (4), effective:11 (0)
sat_reach.icc:155: Timeout: after 209 sec
MC time: 3m30.024sec
std::bad_alloc
checking: AX [EF [~ [3<=NADPplus]]]
normalized: ~ [EX [~ [E [true U ~ [3<=NADPplus]]]]]
abstracting: (3<=NADPplus)
states: 20,292,531,036,711,574 (16)
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-14 CANNOT_COMPUTE
/usr/bin/mcc-head: line 8: 7 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}
CTLCardinality lola GPPP-PT-C0100N0000001000...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
GPPP-PT-C0100N0000001000: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000001000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ GPPP-PT-C0100N0000001000 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: (E (F (((GSSG <= 1) OR (GSSG + 1 <= F6P)))) OR (((2 <= NADPH) OR ((1 <= S7P) AND (FBP <= b1)) OR (a1 <= 1)) AND ((2 <= _2PG) OR A (X ((3 <= FBP)))))) : (A (G (E (G ((S7P <= Pi))))) OR E (X ((c1 <= b1)))) : NOT((((3 <= NADPplus) OR (GSSG <= NADplus)) AND NOT(E (F ((ATP <= DHAP)))))) : (((E (G ((3 <= a1))) AND (Lac <= F6P)) OR E (F (((ATP <= R5P) AND (F6P <= Ru5P))))) AND A (F (A (G ((Ru5P <= ADP)))))) : NOT(A (G (E (F ((3 <= GSH)))))) : A (F (A (G (((1 <= c1) OR (GAP <= GSSG)))))) : A (X (((1 <= NADPplus) AND E (G ((F6P <= R5P)))))) : (E (((S7P <= Ru5P) U (3 <= NADH))) OR A (F (((c1 <= 0) OR ((Ru5P <= _2PG) AND (3 <= R5P)))))) : E (F (E (F (((1 <= Gluc) AND (Gluc <= R5P)))))) : E (F ((A (G ((DHAP <= NADH))) OR ((3 <= DHAP) AND (2 <= DHAP) AND (GSSG <= FBP))))) : A (F ((((FBP <= ATP) OR (G6P + 1 <= b2)) AND A (G ((Pyr <= DHAP)))))) : (A (G ((E4P <= 0))) OR (NOT(A (F ((1 <= F6P)))) AND NOT(A (G ((1 <= Ru5P)))))) : A (G (((3 <= PEP) OR (((GSSG <= ADP) OR (PEP <= c1)) AND (ADP <= ATP))))) : NOT((E (F (((3 <= NADH) OR (3 <= Lac)))) OR NOT(A (X (TRUE))))) : A (X (E (F ((NADPplus <= 2))))) : NOT(NOT((E (F ((NADplus <= PEP))) AND A (F ((1 <= Gluc))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((GSSG <= 1) OR (GSSG + 1 <= F6P)))) OR (((2 <= NADPH) OR ((1 <= S7P) AND (FBP <= b1)) OR (a1 <= 1)) AND ((2 <= _2PG) OR A (X ((3 <= FBP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((GSSG <= 1) OR (GSSG + 1 <= F6P))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2469682 markings, 9062255 edges, 493936 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= NADPH) OR ((1 <= S7P) AND (FBP <= b1)) OR (a1 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= NADPH) OR ((1 <= S7P) AND (FBP <= b1)) OR (a1 <= 1))
lola: processed formula length: 61
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (G ((S7P <= Pi))))) OR E (X ((c1 <= b1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((S7P <= Pi)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (Pi + 1 <= S7P))))
lola: processed formula length: 40
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1732648 markings, 11810367 edges, 346517 markings/sec, 0 secs
lola: 3244365 markings, 23624441 edges, 302343 markings/sec, 5 secs
lola: 4782795 markings, 34914698 edges, 307686 markings/sec, 10 secs
lola: 6464776 markings, 46370571 edges, 336396 markings/sec, 15 secs
lola: 8001278 markings, 58318325 edges, 307300 markings/sec, 20 secs
lola: 9389983 markings, 69953017 edges, 277741 markings/sec, 25 secs
lola: 10933052 markings, 81656486 edges, 308614 markings/sec, 30 secs
lola: 12195975 markings, 91027102 edges, 252585 markings/sec, 35 secs
lola: 13552276 markings, 100139063 edges, 271260 markings/sec, 40 secs
lola: 14829112 markings, 109889845 edges, 255367 markings/sec, 45 secs
lola: 16021320 markings, 119404660 edges, 238442 markings/sec, 50 secs
lola: 17299632 markings, 128463889 edges, 255662 markings/sec, 55 secs
lola: 18803004 markings, 141369959 edges, 300674 markings/sec, 60 secs
lola: 20307574 markings, 154288616 edges, 300914 markings/sec, 65 secs
lola: 21685489 markings, 166658389 edges, 275583 markings/sec, 70 secs
lola: 22960692 markings, 178524858 edges, 255041 markings/sec, 75 secs
lola: 24318482 markings, 189248911 edges, 271558 markings/sec, 80 secs
lola: 25541237 markings, 199340877 edges, 244551 markings/sec, 85 secs
lola: 26711989 markings, 209568061 edges, 234150 markings/sec, 90 secs
lola: 27954466 markings, 219651999 edges, 248495 markings/sec, 95 secs
lola: 29361911 markings, 231736192 edges, 281489 markings/sec, 100 secs
lola: 30755390 markings, 243703173 edges, 278696 markings/sec, 105 secs
lola: 32077393 markings, 255373366 edges, 264401 markings/sec, 110 secs
lola: 33280966 markings, 266573654 edges, 240715 markings/sec, 115 secs
lola: 34460305 markings, 276917635 edges, 235868 markings/sec, 120 secs
lola: 35656462 markings, 288123546 edges, 239231 markings/sec, 125 secs
lola: 36835665 markings, 299168529 edges, 235841 markings/sec, 130 secs
lola: 38014100 markings, 310247372 edges, 235687 markings/sec, 135 secs
lola: 39038352 markings, 320479534 edges, 204850 markings/sec, 140 secs
lola: 40060862 markings, 330646577 edges, 204502 markings/sec, 145 secs
lola: 41236114 markings, 342163767 edges, 235050 markings/sec, 150 secs
lola: 42564134 markings, 352473031 edges, 265604 markings/sec, 155 secs
lola: 43752617 markings, 362319212 edges, 237697 markings/sec, 160 secs
lola: 44910372 markings, 372431365 edges, 231551 markings/sec, 165 secs
lola: 46144404 markings, 382371228 edges, 246806 markings/sec, 170 secs
lola: 47543663 markings, 393037085 edges, 279852 markings/sec, 175 secs
lola: 48816924 markings, 404069319 edges, 254652 markings/sec, 180 secs
lola: 50065247 markings, 414843935 edges, 249665 markings/sec, 185 secs
lola: 51278783 markings, 424714880 edges, 242707 markings/sec, 190 secs
lola: 52708292 markings, 436479690 edges, 285902 markings/sec, 195 secs
lola: 54133276 markings, 448190109 edges, 284997 markings/sec, 200 secs
lola: 55563677 markings, 459959489 edges, 286080 markings/sec, 205 secs
lola: 56983709 markings, 471633042 edges, 284006 markings/sec, 210 secs
lola: 58391747 markings, 483214241 edges, 281608 markings/sec, 215 secs
lola: 59788600 markings, 494701872 edges, 279371 markings/sec, 220 secs
lola: 61176623 markings, 506116487 edges, 277605 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((3 <= NADPplus) OR (GSSG <= NADplus)) AND NOT(E (F ((ATP <= DHAP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NADPplus <= 2) AND (NADplus + 1 <= GSSG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NADPplus <= 2) AND (NADplus + 1 <= GSSG))
lola: processed formula length: 43
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: processed formula with 2 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 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ATP <= DHAP)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((3 <= a1))) AND (Lac <= F6P)) OR E (F (((ATP <= R5P) AND (F6P <= Ru5P))))) AND A (F (A (G ((Ru5P <= ADP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= a1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (a1 <= 2)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
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: 407 markings, 407 edges
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Lac <= F6P)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Lac <= F6P)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: processed formula with 1 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 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((Ru5P <= ADP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((Ru5P <= ADP)))))
lola: processed formula: A (F (A (G ((Ru5P <= ADP)))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: 4610103 markings, 6977601 edges, 922021 markings/sec, 0 secs
lola: 8956910 markings, 13473940 edges, 869361 markings/sec, 5 secs
lola: 13176952 markings, 19780879 edges, 844008 markings/sec, 10 secs
lola: 17330020 markings, 25984789 edges, 830614 markings/sec, 15 secs
lola: 21456011 markings, 32148994 edges, 825198 markings/sec, 20 secs
lola: 25589159 markings, 38326217 edges, 826630 markings/sec, 25 secs
lola: 29715361 markings, 44501107 edges, 825240 markings/sec, 30 secs
lola: 33860715 markings, 50698648 edges, 829071 markings/sec, 35 secs
lola: 37932296 markings, 56772612 edges, 814316 markings/sec, 40 secs
lola: 41971600 markings, 62789826 edges, 807861 markings/sec, 45 secs
lola: 45952943 markings, 68737616 edges, 796269 markings/sec, 50 secs
lola: 49941928 markings, 74707875 edges, 797797 markings/sec, 55 secs
lola: 53975403 markings, 80710212 edges, 806695 markings/sec, 60 secs
lola: 57953605 markings, 86666222 edges, 795640 markings/sec, 65 secs
lola: 61906883 markings, 92546415 edges, 790656 markings/sec, 70 secs
lola: 65845914 markings, 98442831 edges, 787806 markings/sec, 75 secs
lola: 69811342 markings, 104343570 edges, 793086 markings/sec, 80 secs
lola: 73760023 markings, 110225935 edges, 789736 markings/sec, 85 secs
lola: 77700325 markings, 116103992 edges, 788060 markings/sec, 90 secs
lola: 81682056 markings, 122036906 edges, 796346 markings/sec, 95 secs
lola: 85591072 markings, 127866249 edges, 781803 markings/sec, 100 secs
lola: 89521789 markings, 133737122 edges, 786143 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (F ((3 <= GSH))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (3 <= GSH))))
lola: processed formula length: 35
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2433344 markings, 12421841 edges, 3689348869717491712 markings/sec, 0 secs
lola: 4646640 markings, 24694851 edges, 442659 markings/sec, 5 secs
lola: 7074065 markings, 36786844 edges, 485485 markings/sec, 10 secs
lola: 8998005 markings, 48565664 edges, 384788 markings/sec, 15 secs
lola: 11004056 markings, 60163979 edges, 401210 markings/sec, 20 secs
lola: 12902891 markings, 69976035 edges, 379767 markings/sec, 25 secs
lola: 14729099 markings, 79601306 edges, 365242 markings/sec, 30 secs
lola: 16288855 markings, 88990599 edges, 311951 markings/sec, 35 secs
lola: 18380353 markings, 99775841 edges, 418300 markings/sec, 40 secs
lola: 20193552 markings, 111530081 edges, 362640 markings/sec, 45 secs
lola: 22083406 markings, 123199682 edges, 377971 markings/sec, 50 secs
lola: 24049626 markings, 134586580 edges, 393244 markings/sec, 55 secs
lola: 25622516 markings, 145481859 edges, 314578 markings/sec, 60 secs
lola: 27042420 markings, 155778853 edges, 283981 markings/sec, 65 secs
lola: 28664732 markings, 165852925 edges, 324462 markings/sec, 70 secs
lola: 30213429 markings, 175005174 edges, 309739 markings/sec, 75 secs
lola: 31640881 markings, 183655273 edges, 285490 markings/sec, 80 secs
lola: 32832957 markings, 192143198 edges, 238415 markings/sec, 85 secs
lola: 34296716 markings, 200512804 edges, 292752 markings/sec, 90 secs
lola: 36116873 markings, 211068527 edges, 364031 markings/sec, 95 secs
lola: 37618115 markings, 221228064 edges, 300248 markings/sec, 100 secs
lola: 39409539 markings, 231878530 edges, 358285 markings/sec, 105 secs
lola: 41159197 markings, 242049587 edges, 349932 markings/sec, 110 secs
lola: 42614801 markings, 252131529 edges, 291121 markings/sec, 115 secs
lola: 43873975 markings, 261496501 edges, 251835 markings/sec, 120 secs
lola: 45444029 markings, 271372756 edges, 314011 markings/sec, 125 secs
lola: 46780698 markings, 279464896 edges, 267334 markings/sec, 130 secs
lola: 48215019 markings, 287715673 edges, 286864 markings/sec, 135 secs
lola: 49340486 markings, 295439335 edges, 225093 markings/sec, 140 secs
lola: 50507270 markings, 303329117 edges, 233357 markings/sec, 145 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 51312750 markings, 307453762 edges
lola: ========================================
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((1 <= c1) OR (GAP <= GSSG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((1 <= c1) OR (GAP <= GSSG))))))
lola: processed formula: A (F (A (G (((1 <= c1) OR (GAP <= GSSG))))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3889328 markings, 7675949 edges, 777866 markings/sec, 0 secs
lola: 7669068 markings, 15161585 edges, 755948 markings/sec, 5 secs
lola: 11427895 markings, 22609539 edges, 751765 markings/sec, 10 secs
lola: 15158153 markings, 30003016 edges, 746052 markings/sec, 15 secs
lola: 18879080 markings, 37379611 edges, 744185 markings/sec, 20 secs
lola: 22436956 markings, 44433104 edges, 711575 markings/sec, 25 secs
lola: 26082593 markings, 51661901 edges, 729127 markings/sec, 30 secs
lola: 29724861 markings, 58884553 edges, 728454 markings/sec, 35 secs
lola: 33272222 markings, 65918804 edges, 709472 markings/sec, 40 secs
lola: 36898477 markings, 73110791 edges, 725251 markings/sec, 45 secs
lola: 40545826 markings, 80344085 edges, 729470 markings/sec, 50 secs
lola: 44173003 markings, 87537881 edges, 725435 markings/sec, 55 secs
lola: 47789624 markings, 94711282 edges, 723324 markings/sec, 60 secs
lola: 51389681 markings, 101851781 edges, 720011 markings/sec, 65 secs
lola: 54973724 markings, 108961091 edges, 716809 markings/sec, 70 secs
lola: 58591071 markings, 116135924 edges, 723469 markings/sec, 75 secs
lola: 62170570 markings, 123236190 edges, 715900 markings/sec, 80 secs
lola: 65688939 markings, 130215652 edges, 703674 markings/sec, 85 secs
lola: 69125774 markings, 137033266 edges, 687367 markings/sec, 90 secs
lola: 72638606 markings, 144001753 edges, 702566 markings/sec, 95 secs
lola: 76151367 markings, 150970073 edges, 702552 markings/sec, 100 secs
lola: 79657230 markings, 157924738 edges, 701173 markings/sec, 105 secs
lola: 83214804 markings, 164982029 edges, 711515 markings/sec, 110 secs
lola: 86770532 markings, 172036199 edges, 711146 markings/sec, 115 secs
lola: 90321511 markings, 179080942 edges, 710196 markings/sec, 120 secs
lola: 93863024 markings, 186106381 edges, 708303 markings/sec, 125 secs
lola: 97388548 markings, 193100604 edges, 705105 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= NADPplus) AND E (G ((F6P <= R5P))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= NADPplus)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((1 <= NADPplus)))
lola: processed formula: A (X ((1 <= NADPplus)))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((F6P <= R5P)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (R5P + 1 <= F6P))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 801 markings, 800 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((S7P <= Ru5P) U (3 <= NADH))) OR A (F (((c1 <= 0) OR ((Ru5P <= _2PG) AND (3 <= R5P))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((S7P <= Ru5P) U (3 <= NADH)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((S7P <= Ru5P) U (3 <= NADH))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
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: 3014 markings, 3415 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 361 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((1 <= Gluc) AND (Gluc <= R5P))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((DHAP <= NADH))) OR ((3 <= DHAP) AND (2 <= DHAP) AND (GSSG <= FBP)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((DHAP <= NADH)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (NADH + 1 <= DHAP))))
lola: processed formula length: 43
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4088 markings, 10253 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 482 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((FBP <= ATP) OR (G6P + 1 <= b2)) AND A (G ((Pyr <= DHAP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((FBP <= ATP) OR (G6P + 1 <= b2)) AND A (G ((Pyr <= DHAP))))))
lola: processed formula: A (F ((((FBP <= ATP) OR (G6P + 1 <= b2)) AND A (G ((Pyr <= DHAP))))))
lola: processed formula length: 70
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 5986 markings, 7773 edges
lola: ========================================
lola: subprocess 11 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((E4P <= 0))) OR (NOT(A (F ((1 <= F6P)))) AND NOT(A (G ((1 <= Ru5P))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E4P <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 12 will run for 723 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((F6P <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= F6P)))
lola: processed formula length: 25
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 802 markings, 801 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 723 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= PEP) OR (((GSSG <= ADP) OR (PEP <= c1)) AND (ADP <= ATP)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2602199 markings, 11054764 edges, 520440 markings/sec, 0 secs
lola: sara is running 5 secs || 4849471 markings, 20781139 edges, 449454 markings/sec, 5 secs
lola: sara is running 10 secs || 6699236 markings, 30655647 edges, 369953 markings/sec, 10 secs
lola: sara is running 15 secs || 8378014 markings, 39569567 edges, 335756 markings/sec, 15 secs
lola: sara is running 20 secs || 10096931 markings, 48253953 edges, 343783 markings/sec, 20 secs
lola: sara is running 25 secs || 11434849 markings, 55472606 edges, 267584 markings/sec, 25 secs
lola: sara is running 30 secs || 12985587 markings, 63590706 edges, 310148 markings/sec, 30 secs
lola: sara is running 35 secs || 14589911 markings, 71743373 edges, 320865 markings/sec, 35 secs
lola: sara is running 40 secs || 16072195 markings, 79759222 edges, 296457 markings/sec, 40 secs
lola: sara is running 45 secs || 17616938 markings, 87827744 edges, 308949 markings/sec, 45 secs
lola: sara is running 50 secs || 19252035 markings, 96219298 edges, 327019 markings/sec, 50 secs
lola: sara is running 55 secs || 20695307 markings, 104049398 edges, 288654 markings/sec, 55 secs
lola: sara is running 60 secs || 22399205 markings, 112700190 edges, 340780 markings/sec, 60 secs
lola: sara is running 65 secs || 24218559 markings, 122324430 edges, 363871 markings/sec, 65 secs
lola: sara is running 70 secs || 25832709 markings, 131007963 edges, 322830 markings/sec, 70 secs
lola: sara is running 75 secs || 27469901 markings, 139204342 edges, 327438 markings/sec, 75 secs
lola: sara is running 80 secs || 29027187 markings, 147562554 edges, 311457 markings/sec, 80 secs
lola: sara is running 85 secs || 30488119 markings, 155343564 edges, 292186 markings/sec, 85 secs
lola: sara is running 90 secs || 31941643 markings, 163429255 edges, 290705 markings/sec, 90 secs
lola: sara is running 95 secs || 33272724 markings, 171677793 edges, 266216 markings/sec, 95 secs
lola: sara is running 100 secs || 34530659 markings, 179350312 edges, 251587 markings/sec, 100 secs
lola: sara is running 105 secs || 36040672 markings, 187226684 edges, 302003 markings/sec, 105 secs
lola: sara is running 110 secs || 37495750 markings, 194987970 edges, 291016 markings/sec, 110 secs
lola: sara is running 115 secs || 38824780 markings, 202145316 edges, 265806 markings/sec, 115 secs
lola: sara is running 120 secs || 40199159 markings, 209332621 edges, 274876 markings/sec, 120 secs
lola: sara is running 125 secs || 41367604 markings, 216462744 edges, 233689 markings/sec, 125 secs
lola: sara is running 130 secs || 42505661 markings, 223451386 edges, 227611 markings/sec, 130 secs
lola: sara is running 135 secs || 43670205 markings, 230471553 edges, 232909 markings/sec, 135 secs
lola: sara is running 140 secs || 45026049 markings, 237400110 edges, 271169 markings/sec, 140 secs
lola: sara is running 145 secs || 46277092 markings, 244082962 edges, 250209 markings/sec, 145 secs
lola: sara is running 150 secs || 47511565 markings, 250791792 edges, 246895 markings/sec, 150 secs
lola: sara is running 155 secs || 48868059 markings, 257764002 edges, 271299 markings/sec, 155 secs
lola: sara is running 160 secs || 50003299 markings, 264567108 edges, 227048 markings/sec, 160 secs
lola: sara is running 165 secs || 51123859 markings, 271532562 edges, 224112 markings/sec, 165 secs
lola: sara is running 170 secs || 52165889 markings, 277882427 edges, 208406 markings/sec, 170 secs
lola: sara is running 175 secs || 53438494 markings, 284659984 edges, 254521 markings/sec, 175 secs
lola: sara is running 180 secs || 54838163 markings, 292022138 edges, 279934 markings/sec, 180 secs
lola: sara is running 185 secs || 56172407 markings, 299304915 edges, 266849 markings/sec, 185 secs
lola: sara is running 190 secs || 57643197 markings, 306829746 edges, 294158 markings/sec, 190 secs
lola: sara is running 195 secs || 58797873 markings, 313753610 edges, 230935 markings/sec, 195 secs
lola: sara is running 200 secs || 59973113 markings, 321014042 edges, 235048 markings/sec, 200 secs
lola: sara is running 205 secs || 61086642 markings, 327833198 edges, 222706 markings/sec, 205 secs
lola: sara is running 210 secs || 62575193 markings, 335598381 edges, 297710 markings/sec, 210 secs
lola: sara is running 215 secs || 64221780 markings, 344460027 edges, 329317 markings/sec, 215 secs
lola: sara is running 220 secs || 65700970 markings, 352344587 edges, 295838 markings/sec, 220 secs
lola: sara is running 225 secs || 67202795 markings, 359813241 edges, 300365 markings/sec, 225 secs
lola: sara is running 230 secs || 68629744 markings, 367542954 edges, 285390 markings/sec, 230 secs
lola: sara is running 235 secs || 69965867 markings, 374714940 edges, 267225 markings/sec, 235 secs
lola: sara is running 240 secs || 71317577 markings, 381809062 edges, 270342 markings/sec, 240 secs
lola: sara is running 245 secs || 72445294 markings, 388760795 edges, 225543 markings/sec, 245 secs
lola: sara is running 250 secs || 73553180 markings, 395487098 edges, 221577 markings/sec, 250 secs
lola: sara is running 255 secs || 74721481 markings, 402549201 edges, 233660 markings/sec, 255 secs
lola: sara is running 260 secs || 76089995 markings, 410276796 edges, 273703 markings/sec, 260 secs
lola: sara is running 265 secs || 77374667 markings, 418238537 edges, 256934 markings/sec, 265 secs
lola: sara is running 270 secs || 78563756 markings, 425434323 edges, 237818 markings/sec, 270 secs
lola: sara is running 275 secs || 79940089 markings, 432866196 edges, 275267 markings/sec, 275 secs
lola: sara is running 280 secs || 81267599 markings, 439862342 edges, 265502 markings/sec, 280 secs
lola: sara is running 285 secs || 82541591 markings, 446717531 edges, 254798 markings/sec, 285 secs
lola: sara is running 290 secs || 83923759 markings, 453898697 edges, 276434 markings/sec, 290 secs
lola: sara is running 295 secs || 85016862 markings, 460204182 edges, 218621 markings/sec, 295 secs
lola: sara is running 300 secs || 86106190 markings, 466890986 edges, 217866 markings/sec, 300 secs
lola: sara is running 305 secs || 87070269 markings, 472863966 edges, 192816 markings/sec, 305 secs
lola: sara is running 310 secs || 88226329 markings, 479571754 edges, 231212 markings/sec, 310 secs
lola: sara is running 315 secs || 89372848 markings, 486131990 edges, 229304 markings/sec, 315 secs
lola: sara is running 320 secs || 90513378 markings, 493151333 edges, 228106 markings/sec, 320 secs
lola: sara is running 325 secs || 91570577 markings, 499667256 edges, 211440 markings/sec, 325 secs
lola: sara is running 330 secs || 92779945 markings, 506554779 edges, 241874 markings/sec, 330 secs
lola: sara is running 335 secs || 94112625 markings, 513306545 edges, 266536 markings/sec, 335 secs
lola: sara is running 340 secs || 95409125 markings, 520290107 edges, 259300 markings/sec, 340 secs
lola: sara is running 345 secs || 96664178 markings, 527032055 edges, 251011 markings/sec, 345 secs
lola: sara is running 350 secs || 97886159 markings, 533520566 edges, 244396 markings/sec, 350 secs
lola: sara is running 355 secs || 98908108 markings, 539830322 edges, 204390 markings/sec, 355 secs
lola: sara is running 360 secs || 99933023 markings, 546072569 edges, 204983 markings/sec, 360 secs
lola: sara is running 365 secs || 101001465 markings, 552598634 edges, 213688 markings/sec, 365 secs
lola: sara is running 370 secs || 102171242 markings, 559064036 edges, 233955 markings/sec, 370 secs
lola: sara is running 375 secs || 103265045 markings, 565742994 edges, 218761 markings/sec, 375 secs
lola: sara is running 380 secs || 104323811 markings, 572213729 edges, 211753 markings/sec, 380 secs
lola: sara is running 385 secs || 105413752 markings, 578869007 edges, 217988 markings/sec, 385 secs
lola: sara is running 390 secs || 106717458 markings, 585573905 edges, 260741 markings/sec, 390 secs
lola: sara is running 395 secs || 108096102 markings, 592891717 edges, 275729 markings/sec, 395 secs
lola: sara is running 400 secs || 109368124 markings, 599807869 edges, 254404 markings/sec, 400 secs
lola: sara is running 405 secs || 110745363 markings, 606897678 edges, 275448 markings/sec, 405 secs
lola: sara is running 410 secs || 111832251 markings, 613427791 edges, 217378 markings/sec, 410 secs
lola: sara is running 415 secs || 112935517 markings, 620268533 edges, 220653 markings/sec, 415 secs
lola: sara is running 420 secs || 113986196 markings, 626624928 edges, 210136 markings/sec, 420 secs
lola: sara is running 425 secs || 115210029 markings, 633457258 edges, 244767 markings/sec, 425 secs
lola: sara is running 430 secs || 116334551 markings, 640218910 edges, 224904 markings/sec, 430 secs
lola: sara is running 435 secs || 117464909 markings, 647204641 edges, 226072 markings/sec, 435 secs
lola: sara is running 440 secs || 118556575 markings, 653921317 edges, 218333 markings/sec, 440 secs
lola: sara is running 445 secs || 119947527 markings, 661136776 edges, 278190 markings/sec, 445 secs
lola: sara is running 450 secs || 121550116 markings, 669684631 edges, 320518 markings/sec, 450 secs
lola: sara is running 455 secs || 123031342 markings, 677682202 edges, 296245 markings/sec, 455 secs
lola: sara is running 460 secs || 124504988 markings, 685015509 edges, 294729 markings/sec, 460 secs
lola: sara is running 465 secs || 125860600 markings, 692205021 edges, 271122 markings/sec, 465 secs
lola: sara is running 470 secs || 127106345 markings, 698999729 edges, 249149 markings/sec, 470 secs
lola: sara is running 475 secs || 128472529 markings, 706029407 edges, 273237 markings/sec, 475 secs
lola: sara is running 480 secs || 129558757 markings, 712547004 edges, 217246 markings/sec, 480 secs
lola: sara is running 485 secs || 130683237 markings, 719530442 edges, 224896 markings/sec, 485 secs
lola: sara is running 490 secs || 131724730 markings, 725890589 edges, 208299 markings/sec, 490 secs
lola: sara is running 495 secs || 132955523 markings, 732706748 edges, 246159 markings/sec, 495 secs
lola: sara is running 500 secs || 134047695 markings, 739322010 edges, 218434 markings/sec, 500 secs
lola: sara is running 505 secs || 135154672 markings, 746139878 edges, 221395 markings/sec, 505 secs
lola: sara is running 510 secs || 136234120 markings, 752767456 edges, 215890 markings/sec, 510 secs
lola: sara is running 515 secs || 137444720 markings, 759444338 edges, 242120 markings/sec, 515 secs
lola: sara is running 520 secs || 138674416 markings, 766971693 edges, 245939 markings/sec, 520 secs
lola: sara is running 525 secs || 139836384 markings, 774069634 edges, 232394 markings/sec, 525 secs
lola: sara is running 530 secs || 141134243 markings, 781720493 edges, 259572 markings/sec, 530 secs
lola: sara is running 535 secs || 142410426 markings, 788169530 edges, 255237 markings/sec, 535 secs
lola: sara is running 540 secs || 143675924 markings, 794988576 edges, 253100 markings/sec, 540 secs
lola: sara is running 545 secs || 144879985 markings, 801433542 edges, 240812 markings/sec, 545 secs
lola: sara is running 550 secs || 146129987 markings, 807891269 edges, 250000 markings/sec, 550 secs
lola: sara is running 555 secs || 147148246 markings, 814043047 edges, 203652 markings/sec, 555 secs
lola: sara is running 560 secs || 148201398 markings, 820581208 edges, 210630 markings/sec, 560 secs
lola: sara is running 565 secs || 149184884 markings, 826560032 edges, 196697 markings/sec, 565 secs
lola: sara is running 570 secs || 150289121 markings, 832791521 edges, 220847 markings/sec, 570 secs
lola: sara is running 575 secs || 151353909 markings, 839017225 edges, 212958 markings/sec, 575 secs
lola: sara is running 580 secs || 152393724 markings, 845472904 edges, 207963 markings/sec, 580 secs
lola: sara is running 585 secs || 153354542 markings, 851415876 edges, 192164 markings/sec, 585 secs
lola: sara is running 590 secs || 154493208 markings, 857944375 edges, 227733 markings/sec, 590 secs
lola: sara is running 595 secs || 155627663 markings, 864473576 edges, 226891 markings/sec, 595 secs
lola: sara is running 600 secs || 156755527 markings, 871441594 edges, 225573 markings/sec, 600 secs
lola: sara is running 605 secs || 157779050 markings, 877737771 edges, 204705 markings/sec, 605 secs
lola: sara is running 610 secs || 158961263 markings, 884469169 edges, 236443 markings/sec, 610 secs
lola: sara is running 615 secs || 160186532 markings, 890614083 edges, 245054 markings/sec, 615 secs
lola: sara is running 620 secs || 161376913 markings, 897115028 edges, 238076 markings/sec, 620 secs
lola: sara is running 625 secs || 162534211 markings, 903278714 edges, 231460 markings/sec, 625 secs
lola: sara is running 630 secs || 163753258 markings, 909552184 edges, 243809 markings/sec, 630 secs
lola: sara is running 635 secs || 164735616 markings, 915467428 edges, 196472 markings/sec, 635 secs
lola: sara is running 640 secs || 165735219 markings, 921699636 edges, 199921 markings/sec, 640 secs
lola: sara is running 645 secs || 166687219 markings, 927512290 edges, 190400 markings/sec, 645 secs
lola: sara is running 650 secs || 167774991 markings, 933755874 edges, 217554 markings/sec, 650 secs
lola: sara is running 655 secs || 168810268 markings, 939683664 edges, 207055 markings/sec, 655 secs
lola: sara is running 660 secs || 169825683 markings, 945907517 edges, 203083 markings/sec, 660 secs
lola: sara is running 665 secs || 170755747 markings, 951613251 edges, 186013 markings/sec, 665 secs
lola: sara is running 670 secs || 171787253 markings, 957833406 edges, 206301 markings/sec, 670 secs
lola: sara is running 675 secs || 172940352 markings, 964252345 edges, 230620 markings/sec, 675 secs
lola: sara is running 680 secs || 173994595 markings, 970727801 edges, 210849 markings/sec, 680 secs
lola: sara is running 685 secs || 174992293 markings, 976828951 edges, 199540 markings/sec, 685 secs
lola: sara is running 690 secs || 176080973 markings, 983432807 edges, 217736 markings/sec, 690 secs
lola: sara is running 695 secs || 177371336 markings, 990023366 edges, 258073 markings/sec, 695 secs
lola: sara is running 700 secs || 178713644 markings, 997151053 edges, 268462 markings/sec, 700 secs
lola: sara is running 705 secs || 179988274 markings, 1004086815 edges, 254926 markings/sec, 705 secs
lola: sara is running 710 secs || 181341069 markings, 1011042678 edges, 270559 markings/sec, 710 secs
lola: sara is running 715 secs || 182414541 markings, 1017469781 edges, 214694 markings/sec, 715 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 722 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((3 <= NADH) OR (3 <= Lac)))) OR NOT(A (X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 14 will run for 1084 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((NADPplus <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (NADPplus <= 2)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2091412 markings, 11891979 edges, 2532752247494803456 markings/sec, 0 secs
lola: 4105088 markings, 23590615 edges, 402735 markings/sec, 5 secs
lola: 5739849 markings, 34219840 edges, 326952 markings/sec, 10 secs
lola: 7570824 markings, 44630730 edges, 366195 markings/sec, 15 secs
lola: 9424910 markings, 55636447 edges, 370817 markings/sec, 20 secs
lola: 11020439 markings, 65934789 edges, 319106 markings/sec, 25 secs
lola: 12585560 markings, 75983995 edges, 313024 markings/sec, 30 secs
lola: 14199314 markings, 86010959 edges, 322751 markings/sec, 35 secs
lola: 15790875 markings, 95635908 edges, 318312 markings/sec, 40 secs
lola: 17249325 markings, 104720674 edges, 291690 markings/sec, 45 secs
lola: 18953771 markings, 116024295 edges, 340889 markings/sec, 50 secs
lola: 20705351 markings, 127772840 edges, 350316 markings/sec, 55 secs
lola: 22303866 markings, 139248772 edges, 319703 markings/sec, 60 secs
lola: 23840973 markings, 150526263 edges, 307421 markings/sec, 65 secs
lola: 25606356 markings, 162003548 edges, 353077 markings/sec, 70 secs
lola: 27040494 markings, 172215581 edges, 286828 markings/sec, 75 secs
lola: 28310630 markings, 181804745 edges, 254027 markings/sec, 80 secs
lola: 29666178 markings, 191598855 edges, 271110 markings/sec, 85 secs
lola: 30904463 markings, 200965189 edges, 247657 markings/sec, 90 secs
lola: 32285208 markings, 210815235 edges, 276149 markings/sec, 95 secs
lola: 33478760 markings, 219186992 edges, 238710 markings/sec, 100 secs
lola: 34657691 markings, 227682157 edges, 235786 markings/sec, 105 secs
lola: 36151015 markings, 237824269 edges, 298665 markings/sec, 110 secs
lola: 37737258 markings, 248466972 edges, 317249 markings/sec, 115 secs
lola: 39258671 markings, 258985605 edges, 304283 markings/sec, 120 secs
lola: 40617378 markings, 269178391 edges, 271741 markings/sec, 125 secs
lola: 42161182 markings, 279690480 edges, 308761 markings/sec, 130 secs
lola: 43678203 markings, 289772748 edges, 303404 markings/sec, 135 secs
lola: 44894934 markings, 298796742 edges, 243346 markings/sec, 140 secs
lola: 46098271 markings, 307661859 edges, 240667 markings/sec, 145 secs
lola: 47323772 markings, 316604442 edges, 245100 markings/sec, 150 secs
lola: 48465579 markings, 325222100 edges, 228361 markings/sec, 155 secs
lola: 49726108 markings, 334249823 edges, 252106 markings/sec, 160 secs
lola: 50876893 markings, 342223442 edges, 230157 markings/sec, 165 secs
lola: 51926549 markings, 349903171 edges, 209931 markings/sec, 170 secs
lola: 53296253 markings, 359277718 edges, 273941 markings/sec, 175 secs
lola: 54926592 markings, 370211719 edges, 326068 markings/sec, 180 secs
lola: 56535043 markings, 381131846 edges, 321690 markings/sec, 185 secs
lola: 57927309 markings, 391576062 edges, 278453 markings/sec, 190 secs
lola: 59468346 markings, 402270612 edges, 308207 markings/sec, 195 secs
lola: 61051725 markings, 412679644 edges, 316676 markings/sec, 200 secs
lola: 62308652 markings, 421926984 edges, 251385 markings/sec, 205 secs
lola: 63510821 markings, 430863002 edges, 240434 markings/sec, 210 secs
lola: 64768944 markings, 439998347 edges, 251625 markings/sec, 215 secs
lola: 65942062 markings, 448885756 edges, 234624 markings/sec, 220 secs
lola: 67235655 markings, 458144547 edges, 258719 markings/sec, 225 secs
lola: 68390864 markings, 466154230 edges, 231042 markings/sec, 230 secs
lola: 69479694 markings, 474119174 edges, 217766 markings/sec, 235 secs
lola: 70741160 markings, 483444388 edges, 252293 markings/sec, 240 secs
lola: 72057169 markings, 493586928 edges, 263202 markings/sec, 245 secs
lola: 73374556 markings, 503743400 edges, 263477 markings/sec, 250 secs
lola: 74581075 markings, 513600519 edges, 241304 markings/sec, 255 secs
lola: 75725741 markings, 523332949 edges, 228933 markings/sec, 260 secs
lola: 77026058 markings, 533467764 edges, 260063 markings/sec, 265 secs
lola: 78362848 markings, 543494282 edges, 267358 markings/sec, 270 secs
lola: 79375709 markings, 551838433 edges, 202572 markings/sec, 275 secs
lola: 80279255 markings, 559760803 edges, 180709 markings/sec, 280 secs
lola: 81293857 markings, 567996340 edges, 202920 markings/sec, 285 secs
lola: 82296842 markings, 576293716 edges, 200597 markings/sec, 290 secs
lola: 83202082 markings, 584202238 edges, 181048 markings/sec, 295 secs
lola: 84263634 markings, 592692422 edges, 212310 markings/sec, 300 secs
lola: 85268318 markings, 600771565 edges, 200937 markings/sec, 305 secs
lola: 86094746 markings, 607671503 edges, 165286 markings/sec, 310 secs
lola: 86975131 markings, 614852798 edges, 176077 markings/sec, 315 secs
lola: 88172356 markings, 623613575 edges, 239445 markings/sec, 320 secs
lola: 89767888 markings, 634315936 edges, 319106 markings/sec, 325 secs
lola: 91353950 markings, 644951861 edges, 317212 markings/sec, 330 secs
lola: 92721009 markings, 655183907 edges, 273412 markings/sec, 335 secs
lola: 94169652 markings, 665498519 edges, 289729 markings/sec, 340 secs
lola: 95743865 markings, 675730597 edges, 314843 markings/sec, 345 secs
lola: 97005460 markings, 684773522 edges, 252319 markings/sec, 350 secs
lola: 98094580 markings, 693111957 edges, 217824 markings/sec, 355 secs
lola: 99315189 markings, 701859813 edges, 244122 markings/sec, 360 secs
lola: 100417249 markings, 710325365 edges, 220412 markings/sec, 365 secs
lola: 101654657 markings, 719034555 edges, 247482 markings/sec, 370 secs
lola: 102864269 markings, 727522776 edges, 241922 markings/sec, 375 secs
lola: 103862489 markings, 734959943 edges, 199644 markings/sec, 380 secs
lola: 105012558 markings, 743047851 edges, 230014 markings/sec, 385 secs
lola: 106645065 markings, 753966593 edges, 326501 markings/sec, 390 secs
lola: 108272729 markings, 764887705 edges, 325533 markings/sec, 395 secs
lola: 109662195 markings, 774832088 edges, 277893 markings/sec, 400 secs
lola: 111063737 markings, 785348611 edges, 280308 markings/sec, 405 secs
lola: 112729602 markings, 796204403 edges, 333173 markings/sec, 410 secs
lola: 114145345 markings, 805989634 edges, 283149 markings/sec, 415 secs
lola: 115307921 markings, 814929793 edges, 232515 markings/sec, 420 secs
lola: 116553003 markings, 823786675 edges, 249016 markings/sec, 425 secs
lola: 117732439 markings, 832706938 edges, 235887 markings/sec, 430 secs
lola: 118984911 markings, 841663898 edges, 250494 markings/sec, 435 secs
lola: 120255825 markings, 850593030 edges, 254183 markings/sec, 440 secs
lola: 121269703 markings, 858111975 edges, 202776 markings/sec, 445 secs
lola: 122420911 markings, 866222873 edges, 230242 markings/sec, 450 secs
lola: 124012923 markings, 876877925 edges, 318402 markings/sec, 455 secs
lola: 125608826 markings, 887582941 edges, 319181 markings/sec, 460 secs
lola: 127087091 markings, 898096093 edges, 295653 markings/sec, 465 secs
lola: 128478005 markings, 908533296 edges, 278183 markings/sec, 470 secs
lola: 130110832 markings, 919232731 edges, 326565 markings/sec, 475 secs
lola: 131541515 markings, 929056181 edges, 286137 markings/sec, 480 secs
lola: 132717009 markings, 938038641 edges, 235099 markings/sec, 485 secs
lola: 133997169 markings, 947204892 edges, 256032 markings/sec, 490 secs
lola: 135179461 markings, 956115019 edges, 236458 markings/sec, 495 secs
lola: 136422898 markings, 965053936 edges, 248687 markings/sec, 500 secs
lola: 137176761 markings, 970545106 edges, 150773 markings/sec, 505 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (F ((NADplus <= PEP))) AND A (F ((1 <= Gluc))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NADplus <= PEP)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2615338 markings, 8940494 edges, 523068 markings/sec, 0 secs
lola: sara is running 5 secs || 4922580 markings, 17167540 edges, 461448 markings/sec, 5 secs
lola: sara is running 10 secs || 7214138 markings, 25696264 edges, 458312 markings/sec, 10 secs
lola: sara is running 15 secs || 9776925 markings, 34054510 edges, 512557 markings/sec, 15 secs
lola: sara is running 20 secs || 12141023 markings, 41733192 edges, 472820 markings/sec, 20 secs
lola: sara is running 25 secs || 14457188 markings, 49274098 edges, 463233 markings/sec, 25 secs
lola: sara is running 30 secs || 16728533 markings, 56682379 edges, 454269 markings/sec, 30 secs
lola: sara is running 35 secs || 18987165 markings, 64036503 edges, 451726 markings/sec, 35 secs
lola: sara is running 40 secs || 21240868 markings, 71414110 edges, 450741 markings/sec, 40 secs
lola: sara is running 45 secs || 23431884 markings, 78543141 edges, 438203 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no unknown yes unknown no yes yes yes no no unknown no unknown no
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----
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="GPPP-PT-C0100N0000001000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000001000.tgz
mv GPPP-PT-C0100N0000001000 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is GPPP-PT-C0100N0000001000, 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 r091-blw7-152650003600318"
echo "====================================================================="
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 '
echo "FORMULA_NAME $x"
done
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 ;