Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162298996000132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 itstools
Input is Philosophers-PT-000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298996000132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 245K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 152K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1020K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 40K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 159K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 124K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Mar 27 07:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Mar 27 07:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 49K Mar 25 08:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 234K Mar 25 08:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 429K May 5 16:51 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 Philosophers-PT-000100-00
FORMULA_NAME Philosophers-PT-000100-01
FORMULA_NAME Philosophers-PT-000100-02
FORMULA_NAME Philosophers-PT-000100-03
FORMULA_NAME Philosophers-PT-000100-04
FORMULA_NAME Philosophers-PT-000100-05
FORMULA_NAME Philosophers-PT-000100-06
FORMULA_NAME Philosophers-PT-000100-07
FORMULA_NAME Philosophers-PT-000100-08
FORMULA_NAME Philosophers-PT-000100-09
FORMULA_NAME Philosophers-PT-000100-10
FORMULA_NAME Philosophers-PT-000100-11
FORMULA_NAME Philosophers-PT-000100-12
FORMULA_NAME Philosophers-PT-000100-13
FORMULA_NAME Philosophers-PT-000100-14
FORMULA_NAME Philosophers-PT-000100-15

=== Now, execution of the tool begins

BK_START 1622990137089

Running Version 0
[2021-06-06 14:35:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-06 14:35:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 14:35:38] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2021-06-06 14:35:38] [INFO ] Transformed 500 places.
[2021-06-06 14:35:38] [INFO ] Transformed 500 transitions.
[2021-06-06 14:35:38] [INFO ] Found NUPN structural information;
[2021-06-06 14:35:38] [INFO ] Parsed PT model containing 500 places and 500 transitions in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 95 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 14:35:38] [INFO ] Initial state test concluded for 6 properties.
FORMULA Philosophers-PT-000100-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 500 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:38] [INFO ] Computed 200 place invariants in 27 ms
[2021-06-06 14:35:39] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:39] [INFO ] Computed 200 place invariants in 17 ms
[2021-06-06 14:35:39] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:39] [INFO ] Computed 200 place invariants in 5 ms
[2021-06-06 14:35:39] [INFO ] Dead Transitions using invariants and state equation in 295 ms returned []
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
[2021-06-06 14:35:40] [INFO ] Flatten gal took : 68 ms
[2021-06-06 14:35:40] [INFO ] Flatten gal took : 35 ms
[2021-06-06 14:35:40] [INFO ] Input system was already deterministic with 500 transitions.
Incomplete random walk after 100000 steps, including 8 resets, run finished after 1011 ms. (steps per millisecond=98 ) properties (out of 19) seen :17
Running SMT prover for 2 properties.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:41] [INFO ] Computed 200 place invariants in 9 ms
[2021-06-06 14:35:41] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2021-06-06 14:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:41] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-06-06 14:35:41] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:41] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-06-06 14:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:42] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-06-06 14:35:42] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(G((p0&&F(p1))))&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:42] [INFO ] Computed 200 place invariants in 3 ms
[2021-06-06 14:35:42] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:42] [INFO ] Computed 200 place invariants in 3 ms
[2021-06-06 14:35:42] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:42] [INFO ] Computed 200 place invariants in 4 ms
[2021-06-06 14:35:42] [INFO ] Dead Transitions using invariants and state equation in 292 ms returned []
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000100-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315) (ADD s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s389 s391 s392 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412)), p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s95 s96 s97 s98 s99 s100)), p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s95 s96 s97 s98 s99 s100))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 18 reset in 1682 ms.
Product exploration explored 100000 steps with 24 reset in 1744 ms.
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 19 reset in 1558 ms.
Stuttering criterion allowed to conclude after 43792 steps with 10 reset in 708 ms.
FORMULA Philosophers-PT-000100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-01 finished in 7101 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 52 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:49] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:35:49] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:49] [INFO ] Computed 200 place invariants in 11 ms
[2021-06-06 14:35:49] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2021-06-06 14:35:49] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:49] [INFO ] Computed 200 place invariants in 4 ms
[2021-06-06 14:35:50] [INFO ] Dead Transitions using invariants and state equation in 253 ms returned []
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s95 s96 s97 s98 s99 s100) (ADD s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s389 s391 s392 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 689 reset in 2001 ms.
Stack based approach found an accepted trace after 3382 steps with 24 reset with depth 80 and stack size 80 in 75 ms.
FORMULA Philosophers-PT-000100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-03 finished in 3122 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U G((p1 U X(!p0)))))], workingDir=/home/mcc/execution]
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 14 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:52] [INFO ] Computed 200 place invariants in 3 ms
[2021-06-06 14:35:52] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:52] [INFO ] Computed 200 place invariants in 6 ms
[2021-06-06 14:35:52] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:52] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:35:53] [INFO ] Dead Transitions using invariants and state equation in 311 ms returned []
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 303 ms :[p0, p0, false, p0, p0, p0, p0, true]
Running random walk in product with property : Philosophers-PT-000100-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315) (ADD s381 s382 s383 s384 s385 s386 s387 s388 s390 s393 s394 s395 s396 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484 s485 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495 s496 s497 s498 s499)), p0:(LEQ 1 (ADD s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s389 s391 s392 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 1 reset in 1 ms.
FORMULA Philosophers-PT-000100-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-04 finished in 1260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 400 transition count 400
Applied a total of 200 rules in 74 ms. Remains 400 /500 variables (removed 100) and now considering 400/500 (removed 100) transitions.
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:35:53] [INFO ] Computed 200 place invariants in 2 ms
[2021-06-06 14:35:54] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:35:54] [INFO ] Computed 200 place invariants in 2 ms
[2021-06-06 14:35:54] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
[2021-06-06 14:35:54] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 400 rows 400 cols
[2021-06-06 14:35:54] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:35:54] [INFO ] Dead Transitions using invariants and state equation in 377 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/500 places, 400/500 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 1 (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-05 finished in 1435 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:55] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:35:55] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:55] [INFO ] Computed 200 place invariants in 4 ms
[2021-06-06 14:35:55] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:55] [INFO ] Computed 200 place invariants in 3 ms
[2021-06-06 14:35:56] [INFO ] Dead Transitions using invariants and state equation in 375 ms returned []
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s389 s391 s392 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412) (ADD s94 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s193 s194 s196 s197 s198 s199 s200 s201 s202 s203 s204))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000100-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-06 finished in 1332 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:56] [INFO ] Computed 200 place invariants in 3 ms
[2021-06-06 14:35:56] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:56] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:35:57] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2021-06-06 14:35:57] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:57] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:35:57] [INFO ] Dead Transitions using invariants and state equation in 270 ms returned []
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000100-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s389 s391 s392 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412)), p0:(AND (GT 1 (ADD s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s389 s391 s392 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412)) (LEQ 1 (ADD s381 s382 s383 s384 s385 s386 s387 s388 s390 s393 s394 s395 s396 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484 s485 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495 s496 s497 s498 s499)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 61313 steps with 2 reset in 365 ms.
FORMULA Philosophers-PT-000100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-07 finished in 1371 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 0 with 194 rules applied. Total rules applied 194 place count 403 transition count 403
Applied a total of 194 rules in 44 ms. Remains 403 /500 variables (removed 97) and now considering 403/500 (removed 97) transitions.
// Phase 1: matrix 403 rows 403 cols
[2021-06-06 14:35:57] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:35:58] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 403 rows 403 cols
[2021-06-06 14:35:58] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:35:58] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2021-06-06 14:35:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 403 rows 403 cols
[2021-06-06 14:35:58] [INFO ] Computed 200 place invariants in 3 ms
[2021-06-06 14:35:58] [INFO ] Dead Transitions using invariants and state equation in 188 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/500 places, 403/500 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s21 0) (NEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5610 steps with 0 reset in 34 ms.
FORMULA Philosophers-PT-000100-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-08 finished in 935 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:58] [INFO ] Computed 200 place invariants in 4 ms
[2021-06-06 14:35:58] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:58] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:35:59] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:35:59] [INFO ] Computed 200 place invariants in 2 ms
[2021-06-06 14:35:59] [INFO ] Dead Transitions using invariants and state equation in 244 ms returned []
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s200 0) (NEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 32095 steps with 72 reset in 241 ms.
FORMULA Philosophers-PT-000100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-11 finished in 1232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 0 with 194 rules applied. Total rules applied 194 place count 403 transition count 403
Applied a total of 194 rules in 50 ms. Remains 403 /500 variables (removed 97) and now considering 403/500 (removed 97) transitions.
// Phase 1: matrix 403 rows 403 cols
[2021-06-06 14:35:59] [INFO ] Computed 200 place invariants in 0 ms
[2021-06-06 14:36:00] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 403 rows 403 cols
[2021-06-06 14:36:00] [INFO ] Computed 200 place invariants in 0 ms
[2021-06-06 14:36:00] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2021-06-06 14:36:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 403 rows 403 cols
[2021-06-06 14:36:00] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:36:00] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/500 places, 403/500 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s382 0) (EQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000100-12 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Philosophers-PT-000100-12 finished in 931 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:36:00] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:36:01] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:36:01] [INFO ] Computed 200 place invariants in 8 ms
[2021-06-06 14:36:01] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:36:01] [INFO ] Computed 200 place invariants in 2 ms
[2021-06-06 14:36:01] [INFO ] Dead Transitions using invariants and state equation in 235 ms returned []
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : Philosophers-PT-000100-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s4 0) (EQ s429 1)), p0:(OR (EQ s228 0) (EQ s62 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1902 reset in 1461 ms.
Stack based approach found an accepted trace after 1827 steps with 25 reset with depth 406 and stack size 406 in 26 ms.
FORMULA Philosophers-PT-000100-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-13 finished in 2533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||(p1 U ((G(!p0)&&p2)||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:36:03] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:36:03] [INFO ] Implicit Places using invariants in 234 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:36:03] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:36:04] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2021-06-06 14:36:04] [INFO ] Computed 200 place invariants in 1 ms
[2021-06-06 14:36:04] [INFO ] Dead Transitions using invariants and state equation in 238 ms returned []
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), p0, (AND p0 (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), false, false]
Running random walk in product with property : Philosophers-PT-000100-15 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND p0 p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p2) p1) (AND p0 p1)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}]], initial=2, aps=[p0:(OR (EQ s144 0) (EQ s318 1)), p2:(AND (NEQ s329 0) (NEQ s427 1)), p1:(AND (NEQ s329 0) (NEQ s427 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-15 finished in 1174 ms.
All properties solved without resorting to model-checking.

BK_STOP 1622990165632

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Philosophers-PT-000100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 itstools"
echo " Input is Philosophers-PT-000100, 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 r140-tall-162298996000132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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