About the Execution of 2018-Gold for JoinFreeModules-PT-1000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.100 | 1190270.00 | 1212850.00 | 3180.50 | ?TFFFTFTF?T?FFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r088-csrt-155246566100326.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is JoinFreeModules-PT-1000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-155246566100326
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 3.8K Feb 11 09:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 11 09:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 7 09:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 7 09:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 3 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 3 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jan 31 10:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 31 10:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 5.7M Mar 10 17:31 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 JoinFreeModules-PT-1000-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-1000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552876040535
info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-1000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-1000 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-1000 @ 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: 13002/65536 symbol table entries, 4014 collisions
lola: preprocessing...
lola: Size of bit vector: 160032
lola: finding significant places
lola: 5001 places, 8001 transitions, 4000 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9001 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-1000-LTLCardinality.task
lola: A ((F (X ((p2340 <= p3796))) U G (G ((p4089 <= p4641))))) : A ((X (F ((p540 <= p1078))) U F (X ((1 <= p3067))))) : A (G (G ((3 <= p3076)))) : A (G (F ((2 <= p1972)))) : A (X (G (G (F ((1 <= p4305)))))) : A ((((p3392 <= p1206) U (p2639 <= p1749)) U (1 <= p4448))) : A (G (G ((p2187 <= p1799)))) : A (X ((G ((p1269 <= p3124)) U F ((1 <= p2397))))) : A (X ((p4692 <= p3309))) : A (G (X (((1 <= p2882) U (p2359 <= p1144))))) : A (X (F (((p1771 <= p383) U (p844 <= p4511))))) : A (X (X (X (X ((3 <= p4893)))))) : A ((p1043 <= p790)) : A (G (X (G (X ((p2903 <= p2496)))))) : A (X (F ((1 <= p2854)))) : A ((3 <= p567))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1043 <= p790)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1043 <= p790)
lola: processed formula length: 15
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
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: ========================================
check_solution: Constraint R1 = 6.94657189959e-310 is above its upper bound -3
check_solution: Constraint R2 = 4.64268672413e-310 is above its equality of -1000
check_solution: Constraint R4 = 0 is above its equality of -2
check_solution: Constraint R5 = 0 is above its equality of -1
check_solution: Constraint R6 = 0 is above its equality of -1000
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R9 = 0 is above its equality of -2
check_solution: Constraint R10 = 0 is above its equality of -1
check_solution: Constraint R11 = 0 is above its equality of -1000
check_solution: Constraint R13 = 0 is above its equality of -2
Seriously low accuracy found ||*|| = 1000 (rel. error 1)
FORMULA JoinFreeModules-PT-1000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p567)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p567)
lola: processed formula length: 11
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
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
FORMULA JoinFreeModules-PT-1000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((1 <= p2397)) OR (G ((p1269 <= p3124)) AND F ((1 <= p2397))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((1 <= p2397)) OR (G ((p1269 <= p3124)) AND F ((1 <= p2397))))))
lola: processed formula length: 73
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
lola: ========================================
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: 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: 4003 markings, 4002 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p4692 <= p3309)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p4692 <= p3309)))
lola: processed formula length: 24
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
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: 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: 3002 markings, 3002 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((p2359 <= p1144)) AND ((1 <= p2882) OR (p2359 <= p1144))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p2359 <= p1144)) AND ((1 <= p2882) OR (p2359 <= p1144))))))
lola: processed formula length: 73
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 61250 markings, 86962 edges, 12250 markings/sec, 0 secs
lola: 121921 markings, 172918 edges, 12134 markings/sec, 5 secs
lola: 183967 markings, 261663 edges, 12409 markings/sec, 10 secs
lola: 245984 markings, 350574 edges, 12403 markings/sec, 15 secs
lola: 307000 markings, 438393 edges, 12203 markings/sec, 20 secs
lola: 368388 markings, 525595 edges, 12278 markings/sec, 25 secs
lola: 433756 markings, 619027 edges, 13074 markings/sec, 30 secs
lola: 498769 markings, 711077 edges, 13003 markings/sec, 35 secs
lola: 563851 markings, 804740 edges, 13016 markings/sec, 40 secs
lola: 631064 markings, 900005 edges, 13443 markings/sec, 45 secs
lola: 697301 markings, 995596 edges, 13247 markings/sec, 50 secs
lola: 767593 markings, 1096132 edges, 14058 markings/sec, 55 secs
lola: 838332 markings, 1196915 edges, 14148 markings/sec, 60 secs
lola: 910424 markings, 1298904 edges, 14418 markings/sec, 65 secs
lola: 981248 markings, 1400374 edges, 14165 markings/sec, 70 secs
lola: 1052148 markings, 1501986 edges, 14180 markings/sec, 75 secs
lola: 1121767 markings, 1601348 edges, 13924 markings/sec, 80 secs
lola: 1192409 markings, 1702507 edges, 14128 markings/sec, 85 secs
lola: 1264752 markings, 1805619 edges, 14469 markings/sec, 90 secs
lola: 1335734 markings, 1906484 edges, 14196 markings/sec, 95 secs
lola: 1406646 markings, 2007767 edges, 14182 markings/sec, 100 secs
lola: 1478624 markings, 2111267 edges, 14396 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p844 <= p4511))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p844 <= p4511))))
lola: processed formula length: 27
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
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: 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: 2002 markings, 2001 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((3 <= p4893))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X ((3 <= p4893))))))
lola: processed formula length: 32
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 72111 markings, 72777 edges, 14422 markings/sec, 0 secs
lola: 138263 markings, 140748 edges, 13230 markings/sec, 5 secs
lola: 202990 markings, 208450 edges, 12945 markings/sec, 10 secs
lola: 270623 markings, 280482 edges, 13527 markings/sec, 15 secs
lola: 339266 markings, 355019 edges, 13729 markings/sec, 20 secs
lola: 394320 markings, 415848 edges, 11011 markings/sec, 25 secs
lola: 448136 markings, 476339 edges, 10763 markings/sec, 30 secs
lola: 512880 markings, 550555 edges, 12949 markings/sec, 35 secs
lola: 576236 markings, 624752 edges, 12671 markings/sec, 40 secs
lola: 622382 markings, 680012 edges, 9229 markings/sec, 45 secs
lola: 671030 markings, 738946 edges, 9730 markings/sec, 50 secs
lola: 719600 markings, 799384 edges, 9714 markings/sec, 55 secs
lola: 765696 markings, 857209 edges, 9219 markings/sec, 60 secs
lola: 805660 markings, 908491 edges, 7993 markings/sec, 65 secs
lola: 847109 markings, 962549 edges, 8290 markings/sec, 70 secs
lola: 886084 markings, 1014355 edges, 7795 markings/sec, 75 secs
lola: 924087 markings, 1065506 edges, 7601 markings/sec, 80 secs
lola: 970051 markings, 1128817 edges, 9193 markings/sec, 85 secs
lola: 1004896 markings, 1177668 edges, 6969 markings/sec, 90 secs
lola: 1035271 markings, 1221016 edges, 6075 markings/sec, 95 secs
lola: 1072085 markings, 1274651 edges, 7363 markings/sec, 100 secs
lola: 1113561 markings, 1336278 edges, 8295 markings/sec, 105 secs
lola: 1145792 markings, 1384878 edges, 6446 markings/sec, 110 secs
lola: 1173958 markings, 1427963 edges, 5633 markings/sec, 115 secs
lola: 1209686 markings, 1483921 edges, 7146 markings/sec, 120 secs
lola: 1242810 markings, 1537338 edges, 6625 markings/sec, 125 secs
lola: 1270703 markings, 1583147 edges, 5579 markings/sec, 130 secs
lola: 1300336 markings, 1632465 edges, 5927 markings/sec, 135 secs
lola: 1333743 markings, 1689489 edges, 6681 markings/sec, 140 secs
lola: 1357495 markings, 1731174 edges, 4750 markings/sec, 145 secs
lola: 1382164 markings, 1775067 edges, 4934 markings/sec, 150 secs
lola: 1411958 markings, 1829044 edges, 5959 markings/sec, 155 secs
lola: 1437830 markings, 1876477 edges, 5174 markings/sec, 160 secs
lola: 1455782 markings, 1910363 edges, 3590 markings/sec, 165 secs
lola: 1476068 markings, 1949918 edges, 4057 markings/sec, 170 secs
lola: 1502942 markings, 2002442 edges, 5375 markings/sec, 175 secs
lola: 1533289 markings, 2064254 edges, 6069 markings/sec, 180 secs
lola: 1549995 markings, 2099422 edges, 3341 markings/sec, 185 secs
lola: 1567552 markings, 2136263 edges, 3511 markings/sec, 190 secs
lola: 1591265 markings, 2188043 edges, 4743 markings/sec, 195 secs
lola: 1615927 markings, 2242567 edges, 4932 markings/sec, 200 secs
lola: 1639579 markings, 2296810 edges, 4730 markings/sec, 205 secs
lola: 1654885 markings, 2332949 edges, 3061 markings/sec, 210 secs
lola: 1677147 markings, 2387532 edges, 4452 markings/sec, 215 secs
lola: 1701257 markings, 2448510 edges, 4822 markings/sec, 220 secs
lola: 1721220 markings, 2500595 edges, 3993 markings/sec, 225 secs
lola: 1737363 markings, 2544000 edges, 3229 markings/sec, 230 secs
lola: 1756083 markings, 2595493 edges, 3744 markings/sec, 235 secs
lola: 1778395 markings, 2660851 edges, 4462 markings/sec, 240 secs
lola: 1783779 markings, 2676895 edges, 1077 markings/sec, 245 secs
lola: 1784354 markings, 2678807 edges, 115 markings/sec, 250 secs
lola: 1785560 markings, 2682169 edges, 241 markings/sec, 255 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p2340 <= p3796))) U G ((p4089 <= p4641))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((p2340 <= p3796))) U G ((p4089 <= p4641))))
lola: processed formula length: 53
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 72863 markings, 102751 edges, 14573 markings/sec, 0 secs
lola: 144536 markings, 204312 edges, 14335 markings/sec, 5 secs
lola: 216182 markings, 306429 edges, 14329 markings/sec, 10 secs
lola: 287523 markings, 408794 edges, 14268 markings/sec, 15 secs
lola: 361444 markings, 515686 edges, 14784 markings/sec, 20 secs
lola: 438606 markings, 623881 edges, 15432 markings/sec, 25 secs
lola: 513815 markings, 732905 edges, 15042 markings/sec, 30 secs
lola: 590508 markings, 841523 edges, 15339 markings/sec, 35 secs
lola: 666317 markings, 950366 edges, 15162 markings/sec, 40 secs
lola: 742305 markings, 1059058 edges, 15198 markings/sec, 45 secs
lola: 817895 markings, 1166190 edges, 15118 markings/sec, 50 secs
lola: 892245 markings, 1273840 edges, 14870 markings/sec, 55 secs
lola: 969413 markings, 1381907 edges, 15434 markings/sec, 60 secs
lola: 1044189 markings, 1490299 edges, 14955 markings/sec, 65 secs
lola: 1120086 markings, 1598197 edges, 15179 markings/sec, 70 secs
lola: 1196203 markings, 1706896 edges, 15223 markings/sec, 75 secs
lola: 1271669 markings, 1815527 edges, 15093 markings/sec, 80 secs
lola: 1348426 markings, 1923849 edges, 15351 markings/sec, 85 secs
lola: 1423560 markings, 2032867 edges, 15027 markings/sec, 90 secs
lola: 1500129 markings, 2139919 edges, 15314 markings/sec, 95 secs
lola: 1574489 markings, 2247563 edges, 14872 markings/sec, 100 secs
lola: 1649505 markings, 2354722 edges, 15003 markings/sec, 105 secs
lola: 1723875 markings, 2459574 edges, 14874 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((p2903 <= p2496)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((p2903 <= p2496)))))
lola: processed formula length: 32
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: 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: 3002 markings, 3002 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p2854))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p2854))))
lola: processed formula length: 24
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
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: 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: 3002 markings, 3002 edges
FORMULA JoinFreeModules-PT-1000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p3067))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p3067))))
lola: processed formula length: 24
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
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: 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: 2002 markings, 2001 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p3076)))
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 ((3 <= p3076)))
lola: processed formula length: 20
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola:
FORMULA JoinFreeModules-PT-1000-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: ========================================
lola: subprocess 12 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2187 <= p1799)))
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 ((p2187 <= p1799)))
lola: processed formula length: 24
lola: 23 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 946 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p1972))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p1972))))
lola: processed formula length: 24
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
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 (--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: 214 markings, 214 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p4305))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p4305))))
lola: processed formula length: 24
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
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 (--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: 214 markings, 214 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2839 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p3392 <= p1206) U (p2639 <= p1749)) U (1 <= p4448)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p3392 <= p1206) U (p2639 <= p1749)) U (1 <= p4448)))
lola: processed formula length: 58
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
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 (--stubborn)
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: 1 markings, 0 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((p2359 <= p1144)) AND ((1 <= p2882) OR (p2359 <= p1144))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p2359 <= p1144)) AND ((1 <= p2882) OR (p2359 <= p1144))))))
lola: processed formula length: 73
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 76769 markings, 109630 edges, 15354 markings/sec, 0 secs
lola: 153285 markings, 218816 edges, 15303 markings/sec, 5 secs
lola: 229805 markings, 328009 edges, 15304 markings/sec, 10 secs
lola: 306399 markings, 437341 edges, 15319 markings/sec, 15 secs
lola: 382989 markings, 546654 edges, 15318 markings/sec, 20 secs
lola: 459556 markings, 655929 edges, 15313 markings/sec, 25 secs
lola: 535997 markings, 764983 edges, 15288 markings/sec, 30 secs
lola: 612163 markings, 873566 edges, 15233 markings/sec, 35 secs
lola: 688006 markings, 981570 edges, 15169 markings/sec, 40 secs
lola: 759440 markings, 1084111 edges, 14287 markings/sec, 45 secs
lola: 829100 markings, 1183549 edges, 13932 markings/sec, 50 secs
lola: 895934 markings, 1278422 edges, 13367 markings/sec, 55 secs
lola: 962258 markings, 1373882 edges, 13265 markings/sec, 60 secs
lola: 1029781 markings, 1469588 edges, 13505 markings/sec, 65 secs
lola: 1095096 markings, 1563661 edges, 13063 markings/sec, 70 secs
lola: 1168482 markings, 1667518 edges, 14677 markings/sec, 75 secs
lola: 1244906 markings, 1776809 edges, 15285 markings/sec, 80 secs
lola: 1323832 markings, 1889805 edges, 15785 markings/sec, 85 secs
lola: 1404385 markings, 2005015 edges, 16111 markings/sec, 90 secs
lola: 1485161 markings, 2120452 edges, 16155 markings/sec, 95 secs
lola: 1517716 markings, 2166215 edges, 6511 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA JoinFreeModules-PT-1000-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((3 <= p4893))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X ((3 <= p4893))))))
lola: processed formula length: 32
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 81101 markings, 81921 edges, 16220 markings/sec, 0 secs
lola: 155249 markings, 158409 edges, 14830 markings/sec, 5 secs
lola: 225583 markings, 232253 edges, 14067 markings/sec, 10 secs
lola: 302097 markings, 314343 edges, 15303 markings/sec, 15 secs
lola: 373188 markings, 392298 edges, 14218 markings/sec, 20 secs
lola: 433800 markings, 460135 edges, 12122 markings/sec, 25 secs
lola: 501013 markings, 537059 edges, 13443 markings/sec, 30 secs
lola: 573026 markings, 621231 edges, 14403 markings/sec, 35 secs
lola: 626548 markings, 685165 edges, 10704 markings/sec, 40 secs
lola: 679048 markings, 748799 edges, 10500 markings/sec, 45 secs
lola: 736860 markings, 820705 edges, 11562 markings/sec, 50 secs
lola: 786185 markings, 883646 edges, 9865 markings/sec, 55 secs
lola: 833670 markings, 944826 edges, 9497 markings/sec, 60 secs
lola: 877506 markings, 1002755 edges, 8767 markings/sec, 65 secs
lola: 916426 markings, 1055026 edges, 7784 markings/sec, 70 secs
lola: 970318 markings, 1129084 edges, 10778 markings/sec, 75 secs
lola: 1007151 markings, 1180906 edges, 7367 markings/sec, 80 secs
lola: 1040048 markings, 1228239 edges, 6579 markings/sec, 85 secs
lola: 1085087 markings, 1293422 edges, 9008 markings/sec, 90 secs
lola: 1123137 markings, 1350611 edges, 7610 markings/sec, 95 secs
lola: 1156676 markings, 1401326 edges, 6708 markings/sec, 100 secs
lola: 1188513 markings, 1450963 edges, 6367 markings/sec, 105 secs
lola: 1230530 markings, 1517433 edges, 8403 markings/sec, 110 secs
lola: 1260785 markings, 1566938 edges, 6051 markings/sec, 115 secs
lola: 1292892 markings, 1619728 edges, 6421 markings/sec, 120 secs
lola: 1328265 markings, 1679805 edges, 7075 markings/sec, 125 secs
lola: 1356208 markings, 1728325 edges, 5589 markings/sec, 130 secs
lola: 1384178 markings, 1778006 edges, 5594 markings/sec, 135 secs
lola: 1422354 markings, 1847857 edges, 7635 markings/sec, 140 secs
lola: 1442649 markings, 1885860 edges, 4059 markings/sec, 145 secs
lola: 1461040 markings, 1921007 edges, 3678 markings/sec, 150 secs
lola: 1485808 markings, 1968864 edges, 4954 markings/sec, 155 secs
lola: 1517252 markings, 2031857 edges, 6289 markings/sec, 160 secs
lola: 1541359 markings, 2080945 edges, 4821 markings/sec, 165 secs
lola: 1558550 markings, 2116759 edges, 3438 markings/sec, 170 secs
lola: 1580966 markings, 2165427 edges, 4483 markings/sec, 175 secs
lola: 1606390 markings, 2221459 edges, 5085 markings/sec, 180 secs
lola: 1634306 markings, 2284675 edges, 5583 markings/sec, 185 secs
lola: 1651525 markings, 2324922 edges, 3444 markings/sec, 190 secs
lola: 1673079 markings, 2377001 edges, 4311 markings/sec, 195 secs
lola: 1700246 markings, 2446214 edges, 5433 markings/sec, 200 secs
lola: 1722437 markings, 2503062 edges, 4438 markings/sec, 205 secs
lola: 1739561 markings, 2550462 edges, 3425 markings/sec, 210 secs
lola: 1761007 markings, 2610532 edges, 4289 markings/sec, 215 secs
lola: 1783764 markings, 2676879 edges, 4551 markings/sec, 220 secs
lola: 1785206 markings, 2680996 edges, 288 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA JoinFreeModules-PT-1000-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p2340 <= p3796))) U G ((p4089 <= p4641))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((p2340 <= p3796))) U G ((p4089 <= p4641))))
lola: processed formula length: 53
lola: 21 rewrites
lola: closed formula file JoinFreeModules-PT-1000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 80702 markings, 114263 edges, 16140 markings/sec, 0 secs
lola: 158948 markings, 224700 edges, 15649 markings/sec, 5 secs
lola: 237954 markings, 339561 edges, 15801 markings/sec, 10 secs
lola: 317607 markings, 452458 edges, 15931 markings/sec, 15 secs
lola: 394987 markings, 562329 edges, 15476 markings/sec, 20 secs
lola: 472702 markings, 674438 edges, 15543 markings/sec, 25 secs
lola: 550711 markings, 784004 edges, 15602 markings/sec, 30 secs
lola: 623977 markings, 889739 edges, 14653 markings/sec, 35 secs
lola: 690637 markings, 983927 edges, 13332 markings/sec, 40 secs
lola: 755704 markings, 1078436 edges, 13013 markings/sec, 45 secs
lola: 821067 markings, 1171739 edges, 13073 markings/sec, 50 secs
lola: 887980 markings, 1266376 edges, 13383 markings/sec, 55 secs
lola: 954658 markings, 1361051 edges, 13336 markings/sec, 60 secs
lola: 1027730 markings, 1465990 edges, 14614 markings/sec, 65 secs
lola: 1105062 markings, 1577202 edges, 15466 markings/sec, 70 secs
lola: 1184842 markings, 1691506 edges, 15956 markings/sec, 75 secs
lola: 1264929 markings, 1804698 edges, 16017 markings/sec, 80 secs
lola: 1343318 markings, 1917052 edges, 15678 markings/sec, 85 secs
lola: 1420303 markings, 2027167 edges, 15397 markings/sec, 90 secs
lola: 1501045 markings, 2141518 edges, 16148 markings/sec, 95 secs
lola: 1580995 markings, 2256328 edges, 15990 markings/sec, 100 secs
lola: 1659307 markings, 2369034 edges, 15662 markings/sec, 105 secs
lola: 1735614 markings, 2476690 edges, 15261 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA JoinFreeModules-PT-1000-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: unknown yes no no no yes no yes no unknown yes unknown no no no no
lola:
preliminary result: unknown yes no no no yes no yes no unknown yes unknown no no no no
lola: memory consumption: 83256 KB
lola: time consumption: 1190 seconds
BK_STOP 1552877230805
--------------------
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="JoinFreeModules-PT-1000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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-3954"
echo " Executing tool win2018"
echo " Input is JoinFreeModules-PT-1000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-csrt-155246566100326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-1000.tgz
mv JoinFreeModules-PT-1000 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;