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 440K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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.7K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 282K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-0050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630900263
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526828160398

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0050 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ JoinFreeModules-PT-0050 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 652/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8032
lola: finding significant places
lola: 251 places, 401 transitions, 200 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 451 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0050-CTLFireability.task
lola: E ((FIREABLE(t361) U (A (F (FIREABLE(t145))) OR FIREABLE(t49)))) : A (G (NOT(A (F (FIREABLE(t53)))))) : NOT(E (F ((FIREABLE(t249) AND (FIREABLE(t254) OR FIREABLE(t19)) AND FIREABLE(t114) AND FIREABLE(t330) AND (FIREABLE(t245) OR FIREABLE(t382)))))) : A (X (A (X (FIREABLE(t100))))) : E (G (A (F (((FIREABLE(t137) OR FIREABLE(t272)) AND FIREABLE(t80)))))) : A (F (E (((FIREABLE(t207) OR FIREABLE(t292)) U NOT FIREABLE(t50))))) : (E ((A (F (FIREABLE(t160))) U E (X (FIREABLE(t193))))) AND A (G (A (F (NOT FIREABLE(t379)))))) : ((FIREABLE(t365) OR A ((NOT FIREABLE(t400) U (FIREABLE(t94) OR FIREABLE(t321))))) OR FIREABLE(t376)) : E (F (FIREABLE(t183))) : E (F (A (G (E (X (FIREABLE(t386))))))) : A (G (NOT(A (G (NOT FIREABLE(t113)))))) : A (G (FIREABLE(t4))) : E (F (E (F (E (F (FIREABLE(t297))))))) : A (X (E (F ((FIREABLE(t268) AND FIREABLE(t141)))))) : ((E (X ((FIREABLE(t374) AND (FIREABLE(t201) OR FIREABLE(t392))))) OR A (F (E (F (FIREABLE(t48)))))) OR (A (G ((NOT FIREABLE(t46) OR NOT FIREABLE(t69)))) AND FIREABLE(t270))) : E (F ((E (G (NOT FIREABLE(t71))) AND (A (F (FIREABLE(t184))) OR A (F (FIREABLE(t255)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (X (FIREABLE(t100)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(AX(FIREABLE(t100)))
lola: processed formula length: 22
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0050-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((A (F (FIREABLE(t160))) U E (X (FIREABLE(t193))))) AND A (G (A (F (NOT FIREABLE(t379))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: (E(A(TRUE U FIREABLE(t160)) U EX(FIREABLE(t193))) AND NOT(E(TRUE U NOT(A(TRUE U NOT FIREABLE(t379))))))
lola: processed formula length: 103
lola: 20 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 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: 5 markings, 6 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0050-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (E (X (FIREABLE(t386)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U NOT(E(TRUE U NOT(EX(FIREABLE(t386))))))
lola: processed formula length: 48
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 683857 markings, 913380 edges, 136771 markings/sec, 0 secs
lola: 1503032 markings, 2009431 edges, 163835 markings/sec, 5 secs
lola: 2315342 markings, 3095381 edges, 162462 markings/sec, 10 secs
lola: 3119455 markings, 4170982 edges, 160823 markings/sec, 15 secs
lola: 3924245 markings, 5247896 edges, 160958 markings/sec, 20 secs
lola: 4732813 markings, 6329133 edges, 161714 markings/sec, 25 secs
lola: 5540565 markings, 7409282 edges, 161550 markings/sec, 30 secs
lola: 6349683 markings, 8491425 edges, 161824 markings/sec, 35 secs
lola: 7157130 markings, 9571962 edges, 161489 markings/sec, 40 secs
lola: 7968502 markings, 10657182 edges, 162274 markings/sec, 45 secs
lola: 8771218 markings, 11730345 edges, 160543 markings/sec, 50 secs
lola: 9569825 markings, 12798366 edges, 159721 markings/sec, 55 secs
lola: 10369304 markings, 13868180 edges, 159896 markings/sec, 60 secs
lola: 11164983 markings, 14932455 edges, 159136 markings/sec, 65 secs
lola: 11970726 markings, 16009526 edges, 161149 markings/sec, 70 secs
lola: 12767984 markings, 17076172 edges, 159452 markings/sec, 75 secs
lola: 13569366 markings, 18148385 edges, 160276 markings/sec, 80 secs
lola: 14371979 markings, 19222006 edges, 160523 markings/sec, 85 secs
lola: 15173520 markings, 20293208 edges, 160308 markings/sec, 90 secs
lola: 15967266 markings, 21355348 edges, 158749 markings/sec, 95 secs
lola: 16575893 markings, 22169731 edges, 121725 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((FIREABLE(t268) AND FIREABLE(t141))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U (FIREABLE(t268) AND FIREABLE(t141))))
lola: processed formula length: 49
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 844774 markings, 1115095 edges, 168955 markings/sec, 0 secs
lola: 1751141 markings, 2312675 edges, 181273 markings/sec, 5 secs
lola: 2659312 markings, 3510569 edges, 181634 markings/sec, 10 secs
lola: 3564682 markings, 4705874 edges, 181074 markings/sec, 15 secs
lola: 4476559 markings, 5907384 edges, 182375 markings/sec, 20 secs
lola: 5386117 markings, 7111081 edges, 181912 markings/sec, 25 secs
lola: 6297065 markings, 8312499 edges, 182190 markings/sec, 30 secs
lola: 7208154 markings, 9515353 edges, 182218 markings/sec, 35 secs
lola: 8114452 markings, 10711848 edges, 181260 markings/sec, 40 secs
lola: 9019499 markings, 11906195 edges, 181009 markings/sec, 45 secs
lola: 9924372 markings, 13100552 edges, 180975 markings/sec, 50 secs
lola: 10832906 markings, 14299182 edges, 181707 markings/sec, 55 secs
lola: 11738752 markings, 15494148 edges, 181169 markings/sec, 60 secs
lola: 12644265 markings, 16688168 edges, 181103 markings/sec, 65 secs
lola: 13549274 markings, 17883266 edges, 181002 markings/sec, 70 secs
lola: 14453157 markings, 19077196 edges, 180777 markings/sec, 75 secs
lola: 15356833 markings, 20268519 edges, 180735 markings/sec, 80 secs
lola: 16260745 markings, 21462491 edges, 180782 markings/sec, 85 secs
lola: 17157321 markings, 22645893 edges, 179315 markings/sec, 90 secs
lola: 18062505 markings, 23838864 edges, 181037 markings/sec, 95 secs
lola: 18966595 markings, 25035297 edges, 180818 markings/sec, 100 secs
lola: 19873986 markings, 26232438 edges, 181478 markings/sec, 105 secs
lola: 20782042 markings, 27429674 edges, 181611 markings/sec, 110 secs
lola: 21682417 markings, 28618874 edges, 180075 markings/sec, 115 secs
lola: 22586773 markings, 29813480 edges, 180871 markings/sec, 120 secs
lola: 23483673 markings, 30995834 edges, 179380 markings/sec, 125 secs
lola: 24383883 markings, 32184780 edges, 180042 markings/sec, 130 secs
lola: 25279918 markings, 33367474 edges, 179207 markings/sec, 135 secs
lola: 26182314 markings, 34556761 edges, 180479 markings/sec, 140 secs
lola: 27075047 markings, 35738098 edges, 178547 markings/sec, 145 secs
lola: 27974429 markings, 36924660 edges, 179876 markings/sec, 150 secs
lola: 28873956 markings, 38111357 edges, 179905 markings/sec, 155 secs
lola: 29771346 markings, 39296164 edges, 179478 markings/sec, 160 secs
lola: 30668913 markings, 40481202 edges, 179513 markings/sec, 165 secs
lola: 31564241 markings, 41662697 edges, 179066 markings/sec, 170 secs
lola: 32461273 markings, 42846134 edges, 179406 markings/sec, 175 secs
lola: 33358396 markings, 44029394 edges, 179425 markings/sec, 180 secs
lola: 34257293 markings, 45215277 edges, 179779 markings/sec, 185 secs
lola: 35151536 markings, 46395923 edges, 178849 markings/sec, 190 secs
lola: 36045848 markings, 47576745 edges, 178862 markings/sec, 195 secs
lola: 36936799 markings, 48752517 edges, 178190 markings/sec, 200 secs
lola: 37831726 markings, 49933155 edges, 178985 markings/sec, 205 secs
lola: 38723687 markings, 51110954 edges, 178392 markings/sec, 210 secs
lola: 39623776 markings, 52297000 edges, 180018 markings/sec, 215 secs
lola: 40364274 markings, 53276272 edges, 148100 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((FIREABLE(t374) AND (FIREABLE(t201) OR FIREABLE(t392))))) OR (E (F (FIREABLE(t48))) OR (A (G ((NOT FIREABLE(t46) OR NOT FIREABLE(t69)))) AND FIREABLE(t270))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t270)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t270)
lola: processed formula length: 14
lola: 15 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t48)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t48)))
lola: processed formula length: 21
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t48)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-0050-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(t4)))
lola: processed formula length: 20
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(t4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0050-CTLFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 50 markings, 50 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0050-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t297)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t297)))
lola: processed formula length: 22
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t297)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0050-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t183)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t183)))
lola: processed formula length: 22
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t183)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0050-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t53)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G (NOT FIREABLE(t53)))
lola: processed formula length: 25
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: FIREABLE(t53)
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: 4 markings, 3 edges
lola: state equation: write sara problem file to JoinFreeModules-PT-0050-CTLFireability-8-0.sara
lola: ========================================

FORMULA JoinFreeModules-PT-0050-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t249) OR (NOT FIREABLE(t254) AND NOT FIREABLE(t19)) OR NOT FIREABLE(t114) OR NOT FIREABLE(t330) OR (NOT FIREABLE(t245) AND NOT FIREABLE(t382)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((NOT FIREABLE(t249) OR (NOT FIREABLE(t254) AND NOT FIREABLE(t19)) OR NOT FIREABLE(t114) OR NOT FIREABLE(t330) OR (NOT FIREABLE(t245) AND NOT FIREABLE(t382)))))
lola: processed formula length: 169
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (FIREABLE(t249) AND (FIREABLE(t254) OR FIREABLE(t19)) AND FIREABLE(t114) AND FIREABLE(t330) AND (FIREABLE(t245) OR FIREABLE(t382)))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: state equation: write sara problem file to JoinFreeModules-PT-0050-CTLFireability-9-0.sara
lola: ========================================

FORMULA JoinFreeModules-PT-0050-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(t113)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(t113)
lola: processed formula length: 14
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0050-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 948404 markings, 1267449 edges, 189681 markings/sec, 0 secs
lola: 1949581 markings, 2606528 edges, 200235 markings/sec, 5 secs
lola: 2945467 markings, 3938818 edges, 199177 markings/sec, 10 secs
lola: 3883504 markings, 5193170 edges, 187607 markings/sec, 15 secs
lola: 4814685 markings, 6438510 edges, 186236 markings/sec, 20 secs
lola: 5764805 markings, 7709576 edges, 190024 markings/sec, 25 secs
lola: 6758945 markings, 9038587 edges, 198828 markings/sec, 30 secs
lola: 7753908 markings, 10369479 edges, 198993 markings/sec, 35 secs
lola: 8744598 markings, 11694476 edges, 198138 markings/sec, 40 secs
lola: 9734280 markings, 13018344 edges, 197936 markings/sec, 45 secs
lola: 10719196 markings, 14335721 edges, 196983 markings/sec, 50 secs
lola: 11710205 markings, 15661234 edges, 198202 markings/sec, 55 secs
lola: 12698786 markings, 16983755 edges, 197716 markings/sec, 60 secs
lola: 13690385 markings, 18310195 edges, 198320 markings/sec, 65 secs
lola: 14678226 markings, 19631521 edges, 197568 markings/sec, 70 secs
lola: 15664761 markings, 20950868 edges, 197307 markings/sec, 75 secs
lola: 16646431 markings, 22263844 edges, 196334 markings/sec, 80 secs
lola: 17623952 markings, 23571397 edges, 195504 markings/sec, 85 secs
lola: 18597898 markings, 24873598 edges, 194789 markings/sec, 90 secs
lola: 19591314 markings, 26202066 edges, 198683 markings/sec, 95 secs
lola: 20571564 markings, 27513149 edges, 196050 markings/sec, 100 secs
lola: 21551395 markings, 28823867 edges, 195966 markings/sec, 105 secs
lola: 22525344 markings, 30126702 edges, 194790 markings/sec, 110 secs
lola: 23500744 markings, 31431558 edges, 195080 markings/sec, 115 secs
lola: 24466219 markings, 32723432 edges, 193095 markings/sec, 120 secs
lola: 25439144 markings, 34024602 edges, 194585 markings/sec, 125 secs
lola: 26425687 markings, 35343688 edges, 197309 markings/sec, 130 secs
lola: 27393988 markings, 36638869 edges, 193660 markings/sec, 135 secs
lola: 28377168 markings, 37954056 edges, 196636 markings/sec, 140 secs
lola: 29351673 markings, 39256929 edges, 194901 markings/sec, 145 secs
lola: 30333407 markings, 40570000 edges, 196347 markings/sec, 150 secs

BK_STOP 1526828654876

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

Killed

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="JoinFreeModules-PT-0050"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
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/JoinFreeModules-PT-0050.tgz
mv JoinFreeModules-PT-0050 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 lola"
echo " Input is JoinFreeModules-PT-0050, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-152658630900263"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;