Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599400516.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-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 ServersAndClients-PT-200160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599400516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 8.0K Apr 29 17:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 29 17:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 20M May 10 09:34 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 ServersAndClients-PT-200160-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-200160-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652975309569

Running Version 202205111006
[2022-05-19 15:48:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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]
[2022-05-19 15:48:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:48:32] [INFO ] Load time of PNML (sax parser for PT used): 1220 ms
[2022-05-19 15:48:32] [INFO ] Transformed 32961 places.
[2022-05-19 15:48:32] [INFO ] Transformed 64400 transitions.
[2022-05-19 15:48:32] [INFO ] Parsed PT model containing 32961 places and 64400 transitions in 1673 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ServersAndClients-PT-200160-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200160-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200160-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200160-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200160-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 460 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:48:34] [INFO ] Computed 561 place invariants in 1062 ms
[2022-05-19 15:48:38] [INFO ] Implicit Places using invariants in 5383 ms returned []
Implicit Place search using SMT only with invariants took 5417 ms to find 0 implicit places.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:48:39] [INFO ] Computed 561 place invariants in 613 ms
[2022-05-19 15:48:42] [INFO ] Dead Transitions using invariants and state equation in 3329 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32961/32961 places, 64400/64400 transitions.
Support contains 42 out of 32961 places after structural reductions.
[2022-05-19 15:48:45] [INFO ] Flatten gal took : 2098 ms
[2022-05-19 15:48:46] [INFO ] Flatten gal took : 1922 ms
[2022-05-19 15:48:50] [INFO ] Input system was already deterministic with 64400 transitions.
Support contains 41 out of 32961 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1457 ms. (steps per millisecond=6 ) properties (out of 29) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:48:53] [INFO ] Computed 561 place invariants in 574 ms
[2022-05-19 15:49:06] [INFO ] [Real]Absence check using 361 positive place invariants in 2742 ms returned sat
[2022-05-19 15:49:07] [INFO ] [Real]Absence check using 361 positive and 200 generalized place invariants in 650 ms returned sat
[2022-05-19 15:49:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 15:49:18] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31984 transitions
Trivial Post-agglo rules discarded 31984 transitions
Performed 31984 trivial Post agglomeration. Transition count delta: 31984
Iterating post reduction 0 with 31984 rules applied. Total rules applied 31984 place count 32961 transition count 32416
Reduce places removed 32129 places and 0 transitions.
Ensure Unique test removed 28800 transitions
Reduce isomorphic transitions removed 28800 transitions.
Iterating post reduction 1 with 60929 rules applied. Total rules applied 92913 place count 832 transition count 3616
Drop transitions removed 2984 transitions
Redundant transition composition rules discarded 2984 transitions
Iterating global reduction 2 with 2984 rules applied. Total rules applied 95897 place count 832 transition count 632
Discarding 185 places :
Implicit places reduction removed 185 places
Drop transitions removed 370 transitions
Trivial Post-agglo rules discarded 370 transitions
Performed 370 trivial Post agglomeration. Transition count delta: 370
Iterating post reduction 2 with 555 rules applied. Total rules applied 96452 place count 647 transition count 262
Reduce places removed 555 places and 0 transitions.
Drop transitions removed 185 transitions
Reduce isomorphic transitions removed 185 transitions.
Iterating post reduction 3 with 740 rules applied. Total rules applied 97192 place count 92 transition count 77
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 97207 place count 92 transition count 77
Applied a total of 97207 rules in 890 ms. Remains 92 /32961 variables (removed 32869) and now considering 77/64400 (removed 64323) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/32961 places, 77/64400 transitions.
Finished random walk after 332 steps, including 0 resets, run visited all 15 properties in 3 ms. (steps per millisecond=110 )
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U ((p1 U F(p2))||p1)))'
Support contains 4 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31639 transitions
Trivial Post-agglo rules discarded 31639 transitions
Performed 31639 trivial Post agglomeration. Transition count delta: 31639
Iterating post reduction 0 with 31639 rules applied. Total rules applied 31639 place count 32961 transition count 32761
Reduce places removed 31639 places and 0 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 31798 rules applied. Total rules applied 63437 place count 1322 transition count 32602
Reduce places removed 316 places and 0 transitions.
Ensure Unique test removed 31200 transitions
Reduce isomorphic transitions removed 31200 transitions.
Iterating post reduction 2 with 31516 rules applied. Total rules applied 94953 place count 1006 transition count 1402
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 3 with 398 rules applied. Total rules applied 95351 place count 1006 transition count 1004
Applied a total of 95351 rules in 1020 ms. Remains 1006 /32961 variables (removed 31955) and now considering 1004/64400 (removed 63396) transitions.
// Phase 1: matrix 1004 rows 1006 cols
[2022-05-19 15:49:21] [INFO ] Computed 404 place invariants in 4 ms
[2022-05-19 15:49:22] [INFO ] Implicit Places using invariants in 1132 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 1002, 1004]
Discarding 402 places :
Implicit Place search using SMT only with invariants took 1155 ms to find 402 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 604/32961 places, 1004/64400 transitions.
Graph (trivial) has 598 edges and 604 vertex of which 399 / 604 are part of one of the 1 SCC in 3 ms
Free SCC test removed 398 places
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 8 transition count 210
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 8 transition count 210
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 595 place count 8 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 597 place count 7 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 598 place count 6 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 599 place count 6 transition count 10
Applied a total of 599 rules in 13 ms. Remains 6 /604 variables (removed 598) and now considering 10/1004 (removed 994) transitions.
// Phase 1: matrix 10 rows 6 cols
[2022-05-19 15:49:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:49:22] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 10 rows 6 cols
[2022-05-19 15:49:22] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-19 15:49:22] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/32961 places, 10/64400 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/32961 places, 10/64400 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s2 1)), p2:(GEQ s5 1), p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-00 finished in 2827 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!F(p0)) U p1))'
Support contains 4 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 312 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:49:23] [INFO ] Computed 561 place invariants in 556 ms
[2022-05-19 15:49:26] [INFO ] Implicit Places using invariants in 3590 ms returned []
Implicit Place search using SMT only with invariants took 3608 ms to find 0 implicit places.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:49:27] [INFO ] Computed 561 place invariants in 537 ms
[2022-05-19 15:49:29] [INFO ] Dead Transitions using invariants and state equation in 2738 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 165 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (GEQ s29852 1) (GEQ s14726 1)), p1:(AND (GEQ s157 1) (GEQ s558 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6558 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 4 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-04 finished in 13561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(!(!p0 U p1))||X(p0))) U (G(p2)||p1)))'
Support contains 5 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 291 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:49:37] [INFO ] Computed 561 place invariants in 651 ms
[2022-05-19 15:49:39] [INFO ] Implicit Places using invariants in 2924 ms returned []
Implicit Place search using SMT only with invariants took 2936 ms to find 0 implicit places.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:49:40] [INFO ] Computed 561 place invariants in 598 ms
[2022-05-19 15:49:42] [INFO ] Dead Transitions using invariants and state equation in 2801 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 375 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (NOT p0), true, (AND p1 p0), (NOT p2), (AND p1 p0 (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 p2), acceptance={} source=4 dest: 10}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=9 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=10 dest: 8}]], initial=0, aps=[p1:(GEQ s13085 1), p2:(AND (GEQ s461 1) (GEQ s6630 1)), p0:(AND (GEQ s527 1) (GEQ s28740 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 40082 steps with 8913 reset in 3594 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-05 finished in 10161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0)) U p0)||X(F(X(G(X(p1)))))))'
Support contains 4 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31284 transitions
Trivial Post-agglo rules discarded 31284 transitions
Performed 31284 trivial Post agglomeration. Transition count delta: 31284
Iterating post reduction 0 with 31284 rules applied. Total rules applied 31284 place count 32961 transition count 33116
Reduce places removed 31284 places and 0 transitions.
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Iterating post reduction 1 with 31600 rules applied. Total rules applied 62884 place count 1677 transition count 32800
Reduce places removed 474 places and 0 transitions.
Ensure Unique test removed 31400 transitions
Reduce isomorphic transitions removed 31400 transitions.
Iterating post reduction 2 with 31874 rules applied. Total rules applied 94758 place count 1203 transition count 1400
Applied a total of 94758 rules in 726 ms. Remains 1203 /32961 variables (removed 31758) and now considering 1400/64400 (removed 63000) transitions.
// Phase 1: matrix 1400 rows 1203 cols
[2022-05-19 15:49:47] [INFO ] Computed 403 place invariants in 13 ms
[2022-05-19 15:49:47] [INFO ] Implicit Places using invariants in 642 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 645 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/32961 places, 1400/64400 transitions.
Graph (trivial) has 596 edges and 803 vertex of which 397 / 803 are part of one of the 1 SCC in 0 ms
Free SCC test removed 396 places
Ensure Unique test removed 593 transitions
Reduce isomorphic transitions removed 593 transitions.
Discarding 395 places :
Symmetric choice reduction at 0 with 395 rule applications. Total rules 396 place count 12 transition count 412
Iterating global reduction 0 with 395 rules applied. Total rules applied 791 place count 12 transition count 412
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 394 transitions.
Iterating post reduction 0 with 394 rules applied. Total rules applied 1185 place count 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1187 place count 10 transition count 16
Iterating global reduction 1 with 2 rules applied. Total rules applied 1189 place count 10 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1191 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1193 place count 7 transition count 13
Iterating global reduction 1 with 2 rules applied. Total rules applied 1195 place count 7 transition count 13
Applied a total of 1195 rules in 17 ms. Remains 7 /803 variables (removed 796) and now considering 13/1400 (removed 1387) transitions.
// Phase 1: matrix 13 rows 7 cols
[2022-05-19 15:49:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:49:47] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 13 rows 7 cols
[2022-05-19 15:49:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:49:47] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/32961 places, 13/64400 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/32961 places, 13/64400 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1)), p1:(OR (LT s0 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3663 reset in 134 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 9 in 3 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-06 finished in 1777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((G(F(G(p0)))||p1))) U p0))'
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 352 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:49:49] [INFO ] Computed 561 place invariants in 580 ms
[2022-05-19 15:49:51] [INFO ] Implicit Places using invariants in 2637 ms returned []
Implicit Place search using SMT only with invariants took 2640 ms to find 0 implicit places.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:49:51] [INFO ] Computed 561 place invariants in 682 ms
[2022-05-19 15:49:54] [INFO ] Dead Transitions using invariants and state equation in 2777 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s14429 1), p1:(LT s21863 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6379 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 7 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-07 finished in 12449 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)||p1))))'
Support contains 2 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31998 transitions
Trivial Post-agglo rules discarded 31998 transitions
Performed 31998 trivial Post agglomeration. Transition count delta: 31998
Iterating post reduction 0 with 31998 rules applied. Total rules applied 31998 place count 32961 transition count 32402
Reduce places removed 32156 places and 0 transitions.
Ensure Unique test removed 31400 transitions
Reduce isomorphic transitions removed 31400 transitions.
Iterating post reduction 1 with 63556 rules applied. Total rules applied 95554 place count 805 transition count 1002
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 2 with 398 rules applied. Total rules applied 95952 place count 805 transition count 604
Discarding 198 places :
Implicit places reduction removed 198 places
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 2 with 594 rules applied. Total rules applied 96546 place count 607 transition count 208
Reduce places removed 594 places and 0 transitions.
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 3 with 791 rules applied. Total rules applied 97337 place count 13 transition count 11
Applied a total of 97337 rules in 547 ms. Remains 13 /32961 variables (removed 32948) and now considering 11/64400 (removed 64389) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 15:50:01] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-19 15:50:01] [INFO ] Implicit Places using invariants in 27 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 28 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/32961 places, 11/64400 transitions.
Graph (trivial) has 7 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Applied a total of 1 rules in 1 ms. Remains 3 /7 variables (removed 4) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:50:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:50:01] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:50:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:50:01] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/32961 places, 5/64400 transitions.
Finished structural reductions, in 2 iterations. Remains : 3/32961 places, 5/64400 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s2 1), p1:(GEQ s1 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-08 finished in 811 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(p0 U X((G(p1) U !(G(p0)&&p2)))))))'
Support contains 6 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 318 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:50:02] [INFO ] Computed 561 place invariants in 549 ms
[2022-05-19 15:50:04] [INFO ] Implicit Places using invariants in 2744 ms returned []
Implicit Place search using SMT only with invariants took 2757 ms to find 0 implicit places.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:50:05] [INFO ] Computed 561 place invariants in 562 ms
[2022-05-19 15:50:08] [INFO ] Dead Transitions using invariants and state equation in 3709 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), p1]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={} source=6 dest: 6}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s583 1) (GEQ s17484 1)), p2:(AND (GEQ s467 1) (GEQ s31755 1)), p1:(AND (GEQ s401 1) (GEQ s5223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], 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 3 steps with 0 reset in 6 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-09 finished in 7227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((false U F(p2))||p1))))'
Support contains 6 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 432 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:50:09] [INFO ] Computed 561 place invariants in 553 ms
[2022-05-19 15:50:12] [INFO ] Implicit Places using invariants in 3134 ms returned []
Implicit Place search using SMT only with invariants took 3136 ms to find 0 implicit places.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:50:12] [INFO ] Computed 561 place invariants in 595 ms
[2022-05-19 15:50:15] [INFO ] Dead Transitions using invariants and state equation in 3371 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(GEQ s12559 1), p0:(GEQ s8486 1), p1:(OR (AND (GEQ s501 1) (GEQ s23112 1)) (AND (GEQ s659 1) (GEQ s13866 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-10 finished in 7209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 32961 transition count 32401
Reduce places removed 32158 places and 0 transitions.
Ensure Unique test removed 31600 transitions
Reduce isomorphic transitions removed 31600 transitions.
Iterating post reduction 1 with 63758 rules applied. Total rules applied 95757 place count 803 transition count 801
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 2 with 199 rules applied. Total rules applied 95956 place count 803 transition count 602
Discarding 199 places :
Implicit places reduction removed 199 places
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 2 with 597 rules applied. Total rules applied 96553 place count 604 transition count 204
Reduce places removed 597 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 795 rules applied. Total rules applied 97348 place count 7 transition count 6
Applied a total of 97348 rules in 586 ms. Remains 7 /32961 variables (removed 32954) and now considering 6/64400 (removed 64394) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-19 15:50:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 15:50:16] [INFO ] Implicit Places using invariants in 22 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 23 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/32961 places, 6/64400 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:50:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:50:16] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:50:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:50:16] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/32961 places, 3/64400 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/32961 places, 3/64400 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-11 finished in 745 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!((F(p1)&&p0) U p2))&&(X(p3)||G(F(!p1)))))'
Support contains 4 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 601 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:50:17] [INFO ] Computed 561 place invariants in 545 ms
[2022-05-19 15:50:20] [INFO ] Implicit Places using invariants in 2734 ms returned []
Implicit Place search using SMT only with invariants took 2735 ms to find 0 implicit places.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:50:20] [INFO ] Computed 561 place invariants in 561 ms
[2022-05-19 15:50:22] [INFO ] Dead Transitions using invariants and state equation in 2743 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR p2 (AND p1 (NOT p3))), p2, (AND p1 (NOT p3)), (AND p1 p2), p1, p1]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p1) p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 3}], [{ cond=p1, acceptance={0, 1} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s701 1) (GEQ s801 1)), p1:(GEQ s26835 1), p2:(GEQ s18254 1), p3:(OR (LT s701 1) (LT s801 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 90 reset in 6260 ms.
Product exploration explored 100000 steps with 367 reset in 6617 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p3)), (X p3), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 623 ms. Reduced automaton from 6 states, 15 edges and 4 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:50:38] [INFO ] Computed 561 place invariants in 517 ms
[2022-05-19 15:50:45] [INFO ] [Real]Absence check using 361 positive place invariants in 2586 ms returned sat
[2022-05-19 15:50:46] [INFO ] [Real]Absence check using 361 positive and 200 generalized place invariants in 491 ms returned sat
[2022-05-19 15:51:03] [INFO ] After 25026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Drop transitions removed 31999 transitions
Trivial Post-agglo rules discarded 31999 transitions
Performed 31999 trivial Post agglomeration. Transition count delta: 31999
Iterating post reduction 0 with 31999 rules applied. Total rules applied 31999 place count 32961 transition count 32401
Reduce places removed 32158 places and 0 transitions.
Ensure Unique test removed 31600 transitions
Reduce isomorphic transitions removed 31600 transitions.
Iterating post reduction 1 with 63758 rules applied. Total rules applied 95757 place count 803 transition count 801
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 2 with 199 rules applied. Total rules applied 95956 place count 803 transition count 602
Discarding 199 places :
Implicit places reduction removed 199 places
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 2 with 597 rules applied. Total rules applied 96553 place count 604 transition count 204
Reduce places removed 597 places and 0 transitions.
Drop transitions removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 3 with 796 rules applied. Total rules applied 97349 place count 7 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 97350 place count 6 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 97353 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 97355 place count 3 transition count 3
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 97356 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 97357 place count 2 transition count 2
Applied a total of 97357 rules in 506 ms. Remains 2 /32961 variables (removed 32959) and now considering 2/64400 (removed 64398) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/32961 places, 2/64400 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p3)), (X p3), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p3)), (F p1)]
Knowledge based reduction with 10 factoid took 507 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), p1, p1]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), p1, p1]
Support contains 3 out of 32961 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 334 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:51:05] [INFO ] Computed 561 place invariants in 631 ms
[2022-05-19 15:51:08] [INFO ] Implicit Places using invariants in 2798 ms returned []
Implicit Place search using SMT only with invariants took 2818 ms to find 0 implicit places.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:51:08] [INFO ] Computed 561 place invariants in 580 ms
[2022-05-19 15:51:10] [INFO ] Dead Transitions using invariants and state equation in 2662 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32961/32961 places, 64400/64400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p1)), true]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), p1, p1]
Finished random walk after 4828 steps, including 1 resets, run visited all 2 properties in 320 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p3 (NOT p1)), true]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X p1)), (X (X (NOT p1))), (F (NOT p3)), (F p1)]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), p1, p1]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), p1, p1]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), p1, p1]
Product exploration explored 100000 steps with 227 reset in 6544 ms.
Product exploration explored 100000 steps with 435 reset in 6762 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), p1, p1]
Support contains 3 out of 32961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Performed 31799 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31799 rules applied. Total rules applied 31799 place count 32961 transition count 64400
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 31956 place count 32804 transition count 33000
Deduced a syphon composed of 31799 places in 8 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 32113 place count 32804 transition count 33000
Deduced a syphon composed of 31799 places in 22 ms
Applied a total of 32113 rules in 24825 ms. Remains 32804 /32961 variables (removed 157) and now considering 33000/64400 (removed 31400) transitions.
[2022-05-19 15:51:51] [INFO ] Flow matrix only has 32801 transitions (discarded 199 similar events)
// Phase 1: matrix 32801 rows 32804 cols
[2022-05-19 15:52:02] [INFO ] Computed 404 place invariants in 11884 ms
[2022-05-19 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 15962 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32804/32961 places, 33000/64400 transitions.
Finished structural reductions, in 1 iterations. Remains : 32804/32961 places, 33000/64400 transitions.
Product exploration timeout after 62670 steps with 4629 reset in 10001 ms.
Product exploration timeout after 79150 steps with 3718 reset in 10381 ms.
Built C files in :
/tmp/ltsmin8835152528945683323
[2022-05-19 15:52:28] [INFO ] Built C files in 550ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8835152528945683323
Running compilation step : cd /tmp/ltsmin8835152528945683323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8835152528945683323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8835152528945683323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 535 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:52:32] [INFO ] Computed 561 place invariants in 534 ms
[2022-05-19 15:52:34] [INFO ] Implicit Places using invariants in 3259 ms returned []
Implicit Place search using SMT only with invariants took 3260 ms to find 0 implicit places.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:52:35] [INFO ] Computed 561 place invariants in 634 ms
[2022-05-19 15:52:38] [INFO ] Dead Transitions using invariants and state equation in 3807 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32961/32961 places, 64400/64400 transitions.
Built C files in :
/tmp/ltsmin9338401115731756013
[2022-05-19 15:52:39] [INFO ] Built C files in 365ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9338401115731756013
Running compilation step : cd /tmp/ltsmin9338401115731756013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9338401115731756013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9338401115731756013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 15:52:46] [INFO ] Flatten gal took : 1982 ms
[2022-05-19 15:52:48] [INFO ] Flatten gal took : 2182 ms
[2022-05-19 15:52:48] [INFO ] Time to serialize gal into /tmp/LTL1959141175926274852.gal : 406 ms
[2022-05-19 15:52:48] [INFO ] Time to serialize properties into /tmp/LTL6577913532164661939.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1959141175926274852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6577913532164661939.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1959141...266
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-19 15:53:05] [INFO ] Flatten gal took : 1608 ms
[2022-05-19 15:53:05] [INFO ] Applying decomposition
[2022-05-19 15:53:07] [INFO ] Flatten gal took : 1604 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8310365833249365689.txt' '-o' '/tmp/graph8310365833249365689.bin' '-w' '/tmp/graph8310365833249365689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8310365833249365689.bin' '-l' '-1' '-v' '-w' '/tmp/graph8310365833249365689.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:53:13] [INFO ] Decomposing Gal with order
[2022-05-19 15:53:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:53:35] [INFO ] Removed a total of 63327 redundant transitions.
[2022-05-19 15:53:37] [INFO ] Flatten gal took : 13311 ms
[2022-05-19 15:53:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 433 labels/synchronizations in 1301 ms.
[2022-05-19 15:53:40] [INFO ] Time to serialize gal into /tmp/LTL5382281177766468001.gal : 351 ms
[2022-05-19 15:53:40] [INFO ] Time to serialize properties into /tmp/LTL832645503976997692.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5382281177766468001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL832645503976997692.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5382281...244
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11526670669679639147
[2022-05-19 15:53:55] [INFO ] Built C files in 368ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11526670669679639147
Running compilation step : cd /tmp/ltsmin11526670669679639147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11526670669679639147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11526670669679639147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ServersAndClients-PT-200160-LTLFireability-13 finished in 222056 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((F(p0)&&p1)))&&G((F(p2) U p2))))'
Support contains 3 out of 32961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32961/32961 places, 64400/64400 transitions.
Applied a total of 0 rules in 367 ms. Remains 32961 /32961 variables (removed 0) and now considering 64400/64400 (removed 0) transitions.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:54:00] [INFO ] Computed 561 place invariants in 1073 ms
[2022-05-19 15:54:02] [INFO ] Implicit Places using invariants in 2997 ms returned []
Implicit Place search using SMT only with invariants took 2999 ms to find 0 implicit places.
// Phase 1: matrix 64400 rows 32961 cols
[2022-05-19 15:54:02] [INFO ] Computed 561 place invariants in 698 ms
[2022-05-19 15:54:04] [INFO ] Dead Transitions using invariants and state equation in 2498 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32961/32961 places, 64400/64400 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-200160-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s30668 1), p0:(LT s5192 1), p2:(GEQ s23331 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ServersAndClients-PT-200160-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200160-LTLFireability-14 finished in 6094 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!((F(p1)&&p0) U p2))&&(X(p3)||G(F(!p1)))))'
[2022-05-19 15:54:06] [INFO ] Flatten gal took : 1746 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8933007571641886895
[2022-05-19 15:54:07] [INFO ] Too many transitions (64400) to apply POR reductions. Disabling POR matrices.
[2022-05-19 15:54:08] [INFO ] Built C files in 359ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8933007571641886895
Running compilation step : cd /tmp/ltsmin8933007571641886895;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 15:54:09] [INFO ] Applying decomposition
[2022-05-19 15:54:12] [INFO ] Flatten gal took : 2847 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7587589968019857784.txt' '-o' '/tmp/graph7587589968019857784.bin' '-w' '/tmp/graph7587589968019857784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7587589968019857784.bin' '-l' '-1' '-v' '-w' '/tmp/graph7587589968019857784.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:54:17] [INFO ] Decomposing Gal with order
[2022-05-19 15:54:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:54:45] [INFO ] Removed a total of 63594 redundant transitions.
[2022-05-19 15:54:47] [INFO ] Flatten gal took : 14521 ms
[2022-05-19 15:54:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 482 labels/synchronizations in 2832 ms.
[2022-05-19 15:54:51] [INFO ] Time to serialize gal into /tmp/LTLFireability11541095871624695014.gal : 258 ms
[2022-05-19 15:54:51] [INFO ] Time to serialize properties into /tmp/LTLFireability13009771636576992214.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11541095871624695014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13009771636576992214.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !(((F(!((((F("(u104.sv129_c104>=1)"))&&("(u150.sys_req150>=1)"))&&("(u200.sv0>=1)"))U("(u166.sv86_c166>=1)"))))&&((X("((u150.sys_req15...211
Formula 0 simplified : !(F!(("(u150.sys_req150>=1)" & "(u200.sv0>=1)" & F"(u104.sv129_c104>=1)") U "(u166.sv86_c166>=1)") & (X"((u150.sys_req150<1)||(u200....191

BK_STOP 1652975830302

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -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=@none -Xss128m -Xms40m -Xmx8192m

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="ServersAndClients-PT-200160"
export BK_EXAMINATION="LTLFireability"
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 ServersAndClients-PT-200160, 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 r204-oct2-165281599400516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-200160.tgz
mv ServersAndClients-PT-200160 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;