About the Execution of ITS-LoLa for RefineWMG-PT-025026
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?FFFFF??FFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500090.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-025026, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500090
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.5K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 12:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 11 12:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 56K Mar 24 05:38 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-025026-00
FORMULA_NAME RefineWMG-PT-025026-01
FORMULA_NAME RefineWMG-PT-025026-02
FORMULA_NAME RefineWMG-PT-025026-03
FORMULA_NAME RefineWMG-PT-025026-04
FORMULA_NAME RefineWMG-PT-025026-05
FORMULA_NAME RefineWMG-PT-025026-06
FORMULA_NAME RefineWMG-PT-025026-07
FORMULA_NAME RefineWMG-PT-025026-08
FORMULA_NAME RefineWMG-PT-025026-09
FORMULA_NAME RefineWMG-PT-025026-10
FORMULA_NAME RefineWMG-PT-025026-11
FORMULA_NAME RefineWMG-PT-025026-12
FORMULA_NAME RefineWMG-PT-025026-13
FORMULA_NAME RefineWMG-PT-025026-14
FORMULA_NAME RefineWMG-PT-025026-15
=== Now, execution of the tool begins
BK_START 1591226283975
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:18:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 23:18:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:18:05] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2020-06-03 23:18:05] [INFO ] Transformed 129 places.
[2020-06-03 23:18:05] [INFO ] Transformed 103 transitions.
[2020-06-03 23:18:05] [INFO ] Parsed PT model containing 129 places and 103 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100002 steps, including 0 resets, run finished after 205 ms. (steps per millisecond=487 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 103 rows 129 cols
[2020-06-03 23:18:06] [INFO ] Computed 52 place invariants in 3 ms
[2020-06-03 23:18:06] [INFO ] [Real]Absence check using 52 positive place invariants in 23 ms returned sat
[2020-06-03 23:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:18:06] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2020-06-03 23:18:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:18:06] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2020-06-03 23:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:18:06] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2020-06-03 23:18:06] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 9 ms.
[2020-06-03 23:18:06] [INFO ] Added : 52 causal constraints over 11 iterations in 94 ms. Result :sat
[2020-06-03 23:18:06] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2020-06-03 23:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:18:06] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-03 23:18:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:18:06] [INFO ] [Nat]Absence check using 52 positive place invariants in 11 ms returned sat
[2020-06-03 23:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:18:06] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-06-03 23:18:06] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 10 ms.
[2020-06-03 23:18:06] [INFO ] Added : 51 causal constraints over 11 iterations in 92 ms. Result :sat
[2020-06-03 23:18:06] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 23:18:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 23:18:07] [INFO ] Flatten gal took : 51 ms
FORMULA RefineWMG-PT-025026-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:18:07] [INFO ] Flatten gal took : 9 ms
[2020-06-03 23:18:07] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-03 23:18:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-025026 @ 3570 seconds
FORMULA RefineWMG-PT-025026-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-025026-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2519
rslt: Output for LTLFireability @ RefineWMG-PT-025026
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 232/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4128
lola: finding significant places
lola: 129 places, 103 transitions, 77 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: NOT(X (NOT(X ((X (F (((1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p20)))) OR G ((1 <= p32))))))) : NOT(X (NOT(((G (((1 <= p86) AND (1 <= p87) AND (1 <= p89))) OR ((1 <= p91) AND (1 <= p92) AND (1 <= p94))) U X ((1 <= p88)))))) : F (((((G (F (NOT(G ((((1 <= p56) AND (1 <= p57) AND (1 <= p59)) U (1 <= p10)))))) AND (1 <= p111)) AND (1 <= p112)) AND (1 <= p114)) AND ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0)))) : X (G (F (((p107 <= 0) OR (p70 <= 0))))) : (G (NOT(G (NOT(((1 <= p100) U (F ((1 <= p100)) AND G ((1 <= p18)))))))) OR ((1 <= p86) AND (1 <= p87) AND (1 <= p89))) : (NOT(G ((((0 <= 0) U ((1 <= p41) AND (1 <= p42) AND (1 <= p44))) AND F (((1 <= p41) AND (1 <= p42) AND (1 <= p44)))))) OR (1 <= p73)) : (F (((G ((1 <= p97)) AND X ((NOT(F ((p113 <= 0))) OR (p97 <= 0)))) AND (1 <= p113))) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p14))) : G (((NOT(X ((1 <= p60))) AND NOT(X (X ((p77 <= 0))))) AND NOT(F (X (F ((1 <= p63))))))) : X (G ((1 <= p90))) : F (((1 <= p71) AND (1 <= p72) AND (1 <= p74))) : F ((NOT((((1 <= p21) AND (1 <= p22) AND (1 <= p24)) U G ((1 <= p27)))) U ((F ((1 <= p105)) AND (1 <= p105)) U F ((p27 <= 0))))) : G ((NOT(G (F ((1 <= p13)))) OR ((1 <= p111) AND (1 <= p112) AND (1 <= p114)))) : NOT(G ((((1 <= p80) U (1 <= p103)) U G (NOT(F (X (X (F ((1 <= p108)))))))))) : ((G (((1 <= p0) AND (1 <= p126) AND (1 <= p127))) U (1 <= p28)) OR (NOT(X ((1 <= p92))) AND G ((1 <= p92)))) : F ((F ((G (((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0))) AND (1 <= p100))) U X ((1 <= p60))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (F (((1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p20)))) OR G ((1 <= p32)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (F (((1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p20)))) OR G ((1 <= p32)))))
lola: processed formula length: 96
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3546680 markings, 5388190 edges, 709336 markings/sec, 0 secs
lola: 7096909 markings, 10781800 edges, 710046 markings/sec, 5 secs
lola: 10626091 markings, 16143454 edges, 705836 markings/sec, 10 secs
lola: 14147691 markings, 21493554 edges, 704320 markings/sec, 15 secs
lola: 17677310 markings, 26855870 edges, 705924 markings/sec, 20 secs
lola: 21150504 markings, 32132462 edges, 694639 markings/sec, 25 secs
lola: 24535606 markings, 37275224 edges, 677020 markings/sec, 30 secs
lola: 27857356 markings, 42321719 edges, 664350 markings/sec, 35 secs
lola: 31271145 markings, 47508052 edges, 682758 markings/sec, 40 secs
lola: 34754971 markings, 52800777 edges, 696765 markings/sec, 45 secs
lola: 38212270 markings, 58053217 edges, 691460 markings/sec, 50 secs
lola: 41610684 markings, 63216195 edges, 679683 markings/sec, 55 secs
lola: 45077841 markings, 68483599 edges, 693431 markings/sec, 60 secs
lola: 48539102 markings, 73742058 edges, 692252 markings/sec, 65 secs
lola: 51864263 markings, 78793743 edges, 665032 markings/sec, 70 secs
lola: 53275636 markings, 80937959 edges, 282275 markings/sec, 75 secs
lola: 53450532 markings, 81203658 edges, 34979 markings/sec, 80 secs
lola: 54659225 markings, 83042888 edges, 241739 markings/sec, 85 secs
lola: 56177617 markings, 85347957 edges, 303678 markings/sec, 90 secs
lola: 57603543 markings, 87513041 edges, 285185 markings/sec, 95 secs
lola: 59371529 markings, 90199028 edges, 353597 markings/sec, 100 secs
lola: 61779212 markings, 93856834 edges, 481537 markings/sec, 105 secs
lola: 62002769 markings, 94196483 edges, 44711 markings/sec, 110 secs
lola: 63567463 markings, 96573617 edges, 312939 markings/sec, 115 secs
lola: 65250333 markings, 99130260 edges, 336574 markings/sec, 120 secs
lola: 66309168 markings, 100738869 edges, 211767 markings/sec, 125 secs
lola: 66309168 markings, 100738869 edges, 0 markings/sec, 130 secs
lola: 66309168 markings, 100738869 edges, 0 markings/sec, 135 secs
lola: 66309168 markings, 100738869 edges, 0 markings/sec, 140 secs
lola: 66309168 markings, 100738869 edges, 0 markings/sec, 145 secs
lola: 66309168 markings, 100738869 edges, 0 markings/sec, 150 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G (((1 <= p86) AND (1 <= p87) AND (1 <= p89))) OR ((1 <= p91) AND (1 <= p92) AND (1 <= p94))) U X ((1 <= p88))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G (((1 <= p86) AND (1 <= p87) AND (1 <= p89))) OR ((1 <= p91) AND (1 <= p92) AND (1 <= p94))) U X ((1 <= p88))))
lola: processed formula length: 117
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G ((1 <= p97)) AND (X ((G ((1 <= p113)) OR (p97 <= 0))) AND (1 <= p113)))) OR ((1 <= p11) AND (1 <= p12) AND (1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p11) AND (1 <= p12) AND (1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p11) AND (1 <= p12) AND (1 <= p14))
lola: processed formula length: 42
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((1 <= p97)) AND (X ((G ((1 <= p113)) OR (p97 <= 0))) AND (1 <= p113))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((1 <= p97)) AND (X ((G ((1 <= p113)) OR (p97 <= 0))) AND (1 <= p113))))
lola: processed formula length: 78
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3699264 markings, 5811727 edges, 739853 markings/sec, 0 secs
lola: 7359834 markings, 11641667 edges, 732114 markings/sec, 5 secs
lola: 11021922 markings, 17473885 edges, 732418 markings/sec, 10 secs
lola: 14681523 markings, 23264037 edges, 731920 markings/sec, 15 secs
lola: 15781976 markings, 25012655 edges, 220091 markings/sec, 20 secs
lola: 19452209 markings, 30857292 edges, 734047 markings/sec, 25 secs
lola: 22960752 markings, 36417915 edges, 701709 markings/sec, 30 secs
lola: 26568606 markings, 42167764 edges, 721571 markings/sec, 35 secs
lola: 29982060 markings, 47583922 edges, 682691 markings/sec, 40 secs
lola: 33490703 markings, 53144689 edges, 701729 markings/sec, 45 secs
lola: 36935556 markings, 58646340 edges, 688971 markings/sec, 50 secs
lola: 40343429 markings, 64054558 edges, 681575 markings/sec, 55 secs
lola: 43766057 markings, 69484649 edges, 684526 markings/sec, 60 secs
lola: 47293539 markings, 75074040 edges, 705496 markings/sec, 65 secs
lola: 50725871 markings, 80550259 edges, 686466 markings/sec, 70 secs
lola: 53929893 markings, 85617703 edges, 640804 markings/sec, 75 secs
lola: 54087681 markings, 85894907 edges, 31558 markings/sec, 80 secs
lola: 56625387 markings, 89905413 edges, 507541 markings/sec, 85 secs
lola: 59602913 markings, 94658578 edges, 595505 markings/sec, 90 secs
lola: 61419008 markings, 97531945 edges, 363219 markings/sec, 95 secs
lola: 63073302 markings, 100160357 edges, 330859 markings/sec, 100 secs
lola: 63739699 markings, 101211160 edges, 133279 markings/sec, 105 secs
lola: 66621486 markings, 105781210 edges, 576357 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p60 <= 0) AND (X ((1 <= p77)) AND G ((p63 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p60 <= 0) AND (X ((1 <= p77)) AND G ((p63 <= 0))))))
lola: processed formula length: 60
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3979824 markings, 6046234 edges, 795965 markings/sec, 0 secs
lola: 7919297 markings, 12031193 edges, 787895 markings/sec, 5 secs
lola: 11682360 markings, 17748170 edges, 752613 markings/sec, 10 secs
lola: 15480018 markings, 23517680 edges, 759532 markings/sec, 15 secs
lola: 19246076 markings, 29239200 edges, 753212 markings/sec, 20 secs
lola: 23026296 markings, 34982233 edges, 756044 markings/sec, 25 secs
lola: 26681176 markings, 40534882 edges, 730976 markings/sec, 30 secs
lola: 30317588 markings, 46059386 edges, 727282 markings/sec, 35 secs
lola: 33934384 markings, 51554128 edges, 723359 markings/sec, 40 secs
lola: 37651763 markings, 57201673 edges, 743476 markings/sec, 45 secs
lola: 41463194 markings, 62992124 edges, 762286 markings/sec, 50 secs
lola: 45213280 markings, 68689353 edges, 750017 markings/sec, 55 secs
lola: 48872961 markings, 74249265 edges, 731936 markings/sec, 60 secs
lola: 52429724 markings, 79652823 edges, 711353 markings/sec, 65 secs
lola: 53919295 markings, 81920842 edges, 297914 markings/sec, 70 secs
lola: 56765475 markings, 86240680 edges, 569236 markings/sec, 75 secs
lola: 56830471 markings, 86338560 edges, 12999 markings/sec, 80 secs
lola: 56830471 markings, 86338560 edges, 0 markings/sec, 85 secs
lola: 56830471 markings, 86338560 edges, 0 markings/sec, 90 secs
lola: 56907204 markings, 86455145 edges, 15347 markings/sec, 95 secs
lola: 59395569 markings, 90236601 edges, 497673 markings/sec, 100 secs
lola: 62179254 markings, 94496385 edges, 556737 markings/sec, 105 secs
lola: 64896950 markings, 98593407 edges, 543539 markings/sec, 110 secs
lola: 66359123 markings, 100815135 edges, 292435 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p90)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p90)))
lola: processed formula length: 18
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p108))) OR F ((((p80 <= 0) R (p103 <= 0)) AND X (X (F ((1 <= p108)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p108)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p108)))
lola: processed formula length: 19
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p80 <= 0) R (p103 <= 0)) AND X (X (F ((1 <= p108))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p80 <= 0) R (p103 <= 0)) AND X (X (F ((1 <= p108))))))
lola: processed formula length: 60
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p28) OR ((G (((1 <= p0) AND (1 <= p126) AND (1 <= p127))) AND F ((1 <= p28))) OR (X ((p92 <= 0)) AND G ((1 <= p92)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p92))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p92))
lola: processed formula length: 14
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 410 markings, 634 edges
lola: ========================================
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p28)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p28)
lola: processed formula length: 10
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p28))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p28 <= 0)
lola: processed formula length: 10
lola: 135 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p60)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p60)))
lola: processed formula length: 18
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p27 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (1 <= p27)
lola: processed formula length: 10
lola: 135 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 493 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p71) AND (1 <= p72) AND (1 <= p74)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p71 <= 0) OR (p72 <= 0) OR (p74 <= 0))
lola: processed formula length: 42
lola: 135 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p107 <= 0) OR (p70 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p107 <= 0) OR (p70 <= 0))))
lola: processed formula length: 36
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 629 markings, 1048 edges
lola: ========================================
lola: subprocess 11 will run for 739 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((p13 <= 0))) OR ((1 <= p111) AND (1 <= p112) AND (1 <= p114))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((p13 <= 0))) OR ((1 <= p111) AND (1 <= p112) AND (1 <= p114))))
lola: processed formula length: 73
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 527 markings, 632 edges
lola: ========================================
lola: subprocess 12 will run for 986 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((G ((p10 <= 0)) OR (((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0)) AND (p10 <= 0))))) AND ((1 <= p111) AND ((1 <= p112) AND ((1 <= p114) AND ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((G ((p10 <= 0)) OR (((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0)) AND (p10 <= 0))))) AND ((1 <= p111) AND ((1 <= p112) AND ((1 <= p114) AND ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0)))))))
lola: processed formula length: 194
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1637 markings, 2940 edges
lola: subprocess 13 will run for 1479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (((p41 <= 0) OR (p42 <= 0) OR (p44 <= 0))) OR G (((p41 <= 0) OR (p42 <= 0) OR (p44 <= 0))))) OR (1 <= p73))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: lola: RUNNING
========================================
lola: subprocess 13 will run for 1479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p73)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p73)
lola: processed formula length: 10
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 2958 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p41 <= 0) OR (p42 <= 0) OR (p44 <= 0))) OR G (((p41 <= 0) OR (p42 <= 0) OR (p44 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p41 <= 0) OR (p42 <= 0) OR (p44 <= 0))) OR G (((p41 <= 0) OR (p42 <= 0) OR (p44 <= 0)))))
lola: processed formula length: 102
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 389 markings, 481 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 2958 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((F ((1 <= p100)) AND G ((1 <= p18))))) OR ((1 <= p86) AND (1 <= p87) AND (1 <= p89)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2958 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p86) AND (1 <= p87) AND (1 <= p89))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p86) AND (1 <= p87) AND (1 <= p89))
lola: processed formula length: 42
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X ((X (F (((1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p20)))) OR G ((1 <= p32)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (F (((1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p20)))) OR G ((1 <= p32)))))
lola: processed formula length: 96
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3703980 markings, 5627162 edges, 740796 markings/sec, 0 secs
lola: 7310156 markings, 11105781 edges, 721235 markings/sec, 5 secs
lola: 10905179 markings, 16567446 edges, 719005 markings/sec, 10 secs
lola: 14507060 markings, 22039528 edges, 720376 markings/sec, 15 secs
lola: 17967116 markings, 27296156 edges, 692011 markings/sec, 20 secs
lola: 21386835 markings, 32491493 edges, 683944 markings/sec, 25 secs
lola: 24767515 markings, 37627536 edges, 676136 markings/sec, 30 secs
lola: 28153793 markings, 42772071 edges, 677256 markings/sec, 35 secs
lola: 31600042 markings, 48007721 edges, 689250 markings/sec, 40 secs
lola: 35060504 markings, 53264965 edges, 692092 markings/sec, 45 secs
lola: 38520602 markings, 58521636 edges, 692020 markings/sec, 50 secs
lola: 41984319 markings, 63783814 edges, 692743 markings/sec, 55 secs
lola: 45505949 markings, 69134004 edges, 704326 markings/sec, 60 secs
lola: 48914711 markings, 74312706 edges, 681752 markings/sec, 65 secs
lola: 52305865 markings, 79464652 edges, 678231 markings/sec, 70 secs
lola: 54155408 markings, 82276030 edges, 369909 markings/sec, 75 secs
lola: 56214690 markings, 85404740 edges, 411856 markings/sec, 80 secs
lola: 57070940 markings, 86703893 edges, 171250 markings/sec, 85 secs
lola: 57070940 markings, 86703893 edges, 0 markings/sec, 90 secs
lola: 57070940 markings, 86703893 edges, 0 markings/sec, 95 secs
lola: 58269558 markings, 88524878 edges, 239724 markings/sec, 100 secs
lola: 59563393 markings, 90490521 edges, 258767 markings/sec, 105 secs
lola: 59563393 markings, 90490521 edges, 0 markings/sec, 110 secs
lola: 59563393 markings, 90490521 edges, 0 markings/sec, 115 secs
lola: 59563393 markings, 90490521 edges, 0 markings/sec, 120 secs
lola: 59563393 markings, 90490521 edges, 0 markings/sec, 125 secs
lola: 59563393 markings, 90490521 edges, 0 markings/sec, 130 secs
lola: 59563393 markings, 90490521 edges, 0 markings/sec, 135 secs
lola: 59910718 markings, 91018181 edges, 69465 markings/sec, 140 secs
lola: 61818119 markings, 93915959 edges, 381480 markings/sec, 145 secs
lola: 61818119 markings, 93915959 edges, 0 markings/sec, 150 secs
lola: 61818119 markings, 93915959 edges, 0 markings/sec, 155 secs
lola: 61818119 markings, 93915959 edges, 0 markings/sec, 160 secs
lola: 63209499 markings, 96029768 edges, 278276 markings/sec, 165 secs
lola: 63327826 markings, 96209532 edges, 23665 markings/sec, 170 secs
lola: 63327826 markings, 96209532 edges, 0 markings/sec, 175 secs
lola: 63327826 markings, 96209532 edges, 0 markings/sec, 180 secs
lola: 64158525 markings, 97471564 edges, 166140 markings/sec, 185 secs
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-025026"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is RefineWMG-PT-025026, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938500090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-025026.tgz
mv RefineWMG-PT-025026 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;