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.r064-tall-162038397200405.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DLCround-PT-11a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397200405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 23 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 23 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 16:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 16:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 762K 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 DLCround-PT-11a-00
FORMULA_NAME DLCround-PT-11a-01
FORMULA_NAME DLCround-PT-11a-02
FORMULA_NAME DLCround-PT-11a-03
FORMULA_NAME DLCround-PT-11a-04
FORMULA_NAME DLCround-PT-11a-05
FORMULA_NAME DLCround-PT-11a-06
FORMULA_NAME DLCround-PT-11a-07
FORMULA_NAME DLCround-PT-11a-08
FORMULA_NAME DLCround-PT-11a-09
FORMULA_NAME DLCround-PT-11a-10
FORMULA_NAME DLCround-PT-11a-11
FORMULA_NAME DLCround-PT-11a-12
FORMULA_NAME DLCround-PT-11a-13
FORMULA_NAME DLCround-PT-11a-14
FORMULA_NAME DLCround-PT-11a-15

=== Now, execution of the tool begins

BK_START 1620521922168

Running Version 0
[2021-05-09 00:58:57] [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]
[2021-05-09 00:58:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 00:58:57] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2021-05-09 00:58:57] [INFO ] Transformed 377 places.
[2021-05-09 00:58:57] [INFO ] Transformed 2993 transitions.
[2021-05-09 00:58:57] [INFO ] Found NUPN structural information;
[2021-05-09 00:58:57] [INFO ] Parsed PT model containing 377 places and 2993 transitions in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 00:58:57] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 280 transitions
Reduce redundant transitions removed 280 transitions.
FORMULA DLCround-PT-11a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 377 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 377/377 places, 2713/2713 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 357 transition count 2397
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 357 transition count 2397
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 357 transition count 2394
Drop transitions removed 786 transitions
Redundant transition composition rules discarded 786 transitions
Iterating global reduction 1 with 786 rules applied. Total rules applied 829 place count 357 transition count 1608
Applied a total of 829 rules in 132 ms. Remains 357 /377 variables (removed 20) and now considering 1608/2713 (removed 1105) transitions.
[2021-05-09 00:58:57] [INFO ] Flow matrix only has 211 transitions (discarded 1397 similar events)
// Phase 1: matrix 211 rows 357 cols
[2021-05-09 00:58:57] [INFO ] Computed 244 place invariants in 24 ms
[2021-05-09 00:58:58] [INFO ] Implicit Places using invariants in 1073 ms returned [129, 130, 131, 132, 133, 134, 136, 137, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 152, 153, 154, 155, 157, 158, 159, 160, 161, 162, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 176, 177, 178, 179, 180, 181, 183, 184, 185, 186, 188, 189, 190, 191, 192, 193, 194, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 213, 214, 215, 217, 218, 219, 220, 221, 222, 224, 225, 227, 228, 230, 231, 232, 233, 234, 236, 237, 239, 240, 241, 242, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 255, 256, 257, 258, 259, 260, 261, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 277, 280, 281, 282, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 311, 312, 313, 315, 316, 317, 319, 320, 321, 322, 323, 324, 325, 327, 328, 329, 330, 331, 332, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 352, 353, 354, 355, 356]
Discarding 197 places :
Ensure Unique test removed 1134 transitions
Reduce isomorphic transitions removed 1134 transitions.
Implicit Place search using SMT only with invariants took 1104 ms to find 197 implicit places.
[2021-05-09 00:58:58] [INFO ] Flow matrix only has 211 transitions (discarded 263 similar events)
// Phase 1: matrix 211 rows 160 cols
[2021-05-09 00:58:58] [INFO ] Computed 47 place invariants in 2 ms
[2021-05-09 00:58:59] [INFO ] Dead Transitions using invariants and state equation in 177 ms returned []
Starting structural reductions, iteration 1 : 160/377 places, 474/2713 transitions.
Drop transitions removed 196 transitions
Redundant transition composition rules discarded 196 transitions
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 160 transition count 278
Applied a total of 196 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 278/474 (removed 196) transitions.
[2021-05-09 00:58:59] [INFO ] Flow matrix only has 211 transitions (discarded 67 similar events)
// Phase 1: matrix 211 rows 160 cols
[2021-05-09 00:58:59] [INFO ] Computed 47 place invariants in 2 ms
[2021-05-09 00:58:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2021-05-09 00:58:59] [INFO ] Flow matrix only has 211 transitions (discarded 67 similar events)
// Phase 1: matrix 211 rows 160 cols
[2021-05-09 00:58:59] [INFO ] Computed 47 place invariants in 1 ms
[2021-05-09 00:58:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:58:59] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 160/377 places, 278/2713 transitions.
[2021-05-09 00:58:59] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 00:58:59] [INFO ] Flatten gal took : 47 ms
FORMULA DLCround-PT-11a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 00:58:59] [INFO ] Flatten gal took : 17 ms
[2021-05-09 00:58:59] [INFO ] Input system was already deterministic with 278 transitions.
Finished random walk after 5067 steps, including 0 resets, run visited all 29 properties in 39 ms. (steps per millisecond=129 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 278/278 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 130 transition count 278
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 119 transition count 256
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 119 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 119 transition count 255
Applied a total of 53 rules in 7 ms. Remains 119 /160 variables (removed 41) and now considering 255/278 (removed 23) transitions.
[2021-05-09 00:58:59] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 119 cols
[2021-05-09 00:58:59] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-09 00:58:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2021-05-09 00:58:59] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 119 cols
[2021-05-09 00:58:59] [INFO ] Computed 17 place invariants in 4 ms
[2021-05-09 00:58:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:58:59] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2021-05-09 00:58:59] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 119 cols
[2021-05-09 00:58:59] [INFO ] Computed 17 place invariants in 9 ms
[2021-05-09 00:58:59] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 119/160 places, 255/278 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DLCround-PT-11a-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s69 0) (EQ s118 0)) (EQ s25 1)), p1:(NEQ s115 1)], nbAcceptance=1, 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-11a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-11a-00 finished in 498 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))&&(F(G(p2))||p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 278/278 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 131 transition count 278
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 120 transition count 256
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 120 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 120 transition count 255
Applied a total of 52 rules in 4 ms. Remains 120 /160 variables (removed 40) and now considering 255/278 (removed 23) transitions.
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 120 cols
[2021-05-09 00:59:00] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-09 00:59:00] [INFO ] Implicit Places using invariants in 24 ms returned []
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 120 cols
[2021-05-09 00:59:00] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 00:59:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:59:00] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 120 cols
[2021-05-09 00:59:00] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 00:59:00] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/160 places, 255/278 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : DLCround-PT-11a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s63 1) (EQ s118 1)), p1:(OR (NEQ s63 1) (NEQ s118 1)), p2:(AND (EQ s105 1) (EQ s119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-11a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-11a-01 finished in 373 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0||X(p0)) U p1)||G(p2)))], workingDir=/home/mcc/execution]
Support contains 8 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 278/278 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 133 transition count 278
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 123 transition count 258
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 123 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 123 transition count 257
Applied a total of 48 rules in 4 ms. Remains 123 /160 variables (removed 37) and now considering 257/278 (removed 21) transitions.
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 123 cols
[2021-05-09 00:59:00] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-09 00:59:00] [INFO ] Implicit Places using invariants in 24 ms returned []
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 123 cols
[2021-05-09 00:59:00] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 00:59:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:59:00] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 123 cols
[2021-05-09 00:59:00] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 00:59:00] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/160 places, 257/278 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : DLCround-PT-11a-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (EQ s29 1) (EQ s119 1) (EQ s101 1) (EQ s122 1)), p0:(AND (EQ s98 1) (EQ s121 1)), p2:(OR (NEQ s59 1) (NEQ s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 105 steps with 0 reset in 3 ms.
FORMULA DLCround-PT-11a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-11a-02 finished in 359 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 278/278 transitions.
Graph (trivial) has 275 edges and 160 vertex of which 126 / 160 are part of one of the 16 SCC in 3 ms
Free SCC test removed 110 places
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Graph (complete) has 67 edges and 50 vertex of which 20 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.3 ms
Discarding 30 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 16 place count 6 transition count 7
Iterating global reduction 0 with 14 rules applied. Total rules applied 30 place count 6 transition count 7
Applied a total of 30 rules in 13 ms. Remains 6 /160 variables (removed 154) and now considering 7/278 (removed 271) transitions.
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 00:59:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 00:59:00] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 00:59:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 00:59:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:59:00] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-09 00:59:00] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 00:59:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 00:59:00] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/160 places, 7/278 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-11a-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:(AND (NEQ s3 0) (NEQ s5 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-11a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-11a-03 finished in 107 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((F(p1)||p0))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 278/278 transitions.
Graph (trivial) has 261 edges and 160 vertex of which 117 / 160 are part of one of the 16 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 235 transitions
Reduce isomorphic transitions removed 235 transitions.
Graph (complete) has 89 edges and 59 vertex of which 30 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 42
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 29 transition count 41
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 28 transition count 40
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 20 place count 15 transition count 26
Iterating global reduction 3 with 13 rules applied. Total rules applied 33 place count 15 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 15 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 14 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 14 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 14 transition count 24
Applied a total of 37 rules in 8 ms. Remains 14 /160 variables (removed 146) and now considering 24/278 (removed 254) transitions.
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 16 transitions (discarded 8 similar events)
// Phase 1: matrix 16 rows 14 cols
[2021-05-09 00:59:00] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 00:59:00] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 16 transitions (discarded 8 similar events)
// Phase 1: matrix 16 rows 14 cols
[2021-05-09 00:59:00] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 00:59:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:59:00] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-09 00:59:00] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 00:59:00] [INFO ] Flow matrix only has 16 transitions (discarded 8 similar events)
// Phase 1: matrix 16 rows 14 cols
[2021-05-09 00:59:00] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 00:59:00] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/160 places, 24/278 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-11a-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s12 0)), p1:(AND (EQ s2 1) (EQ s13 1)), p2:(EQ s8 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-11a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-11a-05 finished in 116 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&(X(p1) U G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 278/278 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 132 transition count 278
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 121 transition count 256
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 121 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 121 transition count 255
Applied a total of 51 rules in 8 ms. Remains 121 /160 variables (removed 39) and now considering 255/278 (removed 23) transitions.
[2021-05-09 00:59:01] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 121 cols
[2021-05-09 00:59:01] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-09 00:59:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-09 00:59:01] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 121 cols
[2021-05-09 00:59:01] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 00:59:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:59:01] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2021-05-09 00:59:01] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
// Phase 1: matrix 199 rows 121 cols
[2021-05-09 00:59:01] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 00:59:01] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 121/160 places, 255/278 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) p1)]
Running random walk in product with property : DLCround-PT-11a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s26 1) (EQ s118 1)), p0:(AND (EQ s79 1) (EQ s120 1)), p1:(AND (EQ s59 1) (EQ s119 1))], 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-11a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-11a-07 finished in 414 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 278/278 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 131 transition count 278
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 41 place count 119 transition count 254
Iterating global reduction 1 with 12 rules applied. Total rules applied 53 place count 119 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 119 transition count 253
Applied a total of 54 rules in 4 ms. Remains 119 /160 variables (removed 41) and now considering 253/278 (removed 25) transitions.
[2021-05-09 00:59:01] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
// Phase 1: matrix 198 rows 119 cols
[2021-05-09 00:59:01] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-09 00:59:01] [INFO ] Implicit Places using invariants in 31 ms returned []
[2021-05-09 00:59:01] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
// Phase 1: matrix 198 rows 119 cols
[2021-05-09 00:59:01] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 00:59:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:59:01] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2021-05-09 00:59:01] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
// Phase 1: matrix 198 rows 119 cols
[2021-05-09 00:59:01] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-09 00:59:01] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 119/160 places, 253/278 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-11a-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s91 0) (EQ s117 0)), p0:(OR (EQ s24 0) (EQ s118 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 418 ms.
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Graph (complete) has 270 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Knowledge obtained : [p1, p0]
java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, -F, /tmp/curaut17144639360693391215.hoa, --complement], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.buildComplement(SpotRunner.java:532)
at fr.lip6.move.gal.application.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:367)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:174)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 119 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 119/119 places, 253/253 transitions.
Graph (trivial) has 239 edges and 119 vertex of which 106 / 119 are part of one of the 16 SCC in 1 ms
Free SCC test removed 90 places
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 41
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 16 transition count 28
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 16 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 29 rules in 4 ms. Remains 16 /119 variables (removed 103) and now considering 28/253 (removed 225) transitions.
[2021-05-09 00:59:17] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 00:59:17] [INFO ] Flow matrix only has 21 transitions (discarded 7 similar events)
// Phase 1: matrix 21 rows 16 cols
[2021-05-09 00:59:17] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 00:59:17] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/119 places, 28/253 transitions.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Product exploration explored 100000 steps with 50000 reset in 233 ms.
[2021-05-09 00:59:18] [INFO ] Flatten gal took : 10 ms
[2021-05-09 00:59:18] [INFO ] Flatten gal took : 9 ms
[2021-05-09 00:59:18] [INFO ] Time to serialize gal into /tmp/LTL12748192935281216352.gal : 20 ms
[2021-05-09 00:59:18] [INFO ] Time to serialize properties into /tmp/LTL14027059056049031213.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12748192935281216352.gal, -t, CGAL, -LTL, /tmp/LTL14027059056049031213.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12748192935281216352.gal -t CGAL -LTL /tmp/LTL14027059056049031213.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p33==0)||(p246==0))")||(G("((p117==0)||(p215==0))")))))
Formula 0 simplified : !X("((p33==0)||(p246==0))" | G"((p117==0)||(p215==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.118088,19572,1,0,6,15988,21,0,2716,1653,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DLCround-PT-11a-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DLCround-PT-11a-08 finished in 17265 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p1&&X(G(p2)))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 278/278 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 131 transition count 278
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 39 place count 121 transition count 258
Iterating global reduction 1 with 10 rules applied. Total rules applied 49 place count 121 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 121 transition count 257
Applied a total of 50 rules in 4 ms. Remains 121 /160 variables (removed 39) and now considering 257/278 (removed 21) transitions.
[2021-05-09 00:59:18] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 121 cols
[2021-05-09 00:59:18] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-09 00:59:18] [INFO ] Implicit Places using invariants in 29 ms returned []
[2021-05-09 00:59:18] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 121 cols
[2021-05-09 00:59:18] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-09 00:59:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:59:18] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2021-05-09 00:59:18] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 121 cols
[2021-05-09 00:59:18] [INFO ] Computed 18 place invariants in 7 ms
[2021-05-09 00:59:18] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 1 iterations. Remains : 121/160 places, 257/278 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DLCround-PT-11a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s89 1) (NEQ s119 1) (NEQ s114 1) (NEQ s120 1)), p1:(OR (EQ s114 0) (EQ s120 0)), p2:(AND (NEQ s89 0) (NEQ s119 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Graph (complete) has 274 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 121/121 places, 257/257 transitions.
Graph (trivial) has 250 edges and 121 vertex of which 114 / 121 are part of one of the 16 SCC in 0 ms
Free SCC test removed 98 places
Ensure Unique test removed 232 transitions
Reduce isomorphic transitions removed 232 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 10 transition count 12
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 10 transition count 12
Applied a total of 27 rules in 2 ms. Remains 10 /121 variables (removed 111) and now considering 12/257 (removed 245) transitions.
[2021-05-09 00:59:20] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 00:59:20] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 00:59:20] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 00:59:20] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/121 places, 12/257 transitions.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
[2021-05-09 00:59:20] [INFO ] Flatten gal took : 29 ms
[2021-05-09 00:59:20] [INFO ] Flatten gal took : 8 ms
[2021-05-09 00:59:20] [INFO ] Time to serialize gal into /tmp/LTL15662625846507763719.gal : 2 ms
[2021-05-09 00:59:20] [INFO ] Time to serialize properties into /tmp/LTL9323279186797927120.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15662625846507763719.gal, -t, CGAL, -LTL, /tmp/LTL9323279186797927120.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15662625846507763719.gal -t CGAL -LTL /tmp/LTL9323279186797927120.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((p114!=1)||(p334!=1))||(p144!=1))||(p371!=1))")||((X(G("((p114!=0)&&(p334!=0))")))&&("((p144==0)||(p371==0))"))))))
Formula 0 simplified : !XF("((((p114!=1)||(p334!=1))||(p144!=1))||(p371!=1))" | ("((p144==0)||(p371==0))" & XG"((p114!=0)&&(p334!=0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.098331,19960,1,0,6,16503,21,0,2761,1675,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DLCround-PT-11a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DLCround-PT-11a-09 finished in 2072 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 278/278 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 132 transition count 278
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 120 transition count 254
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 120 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 120 transition count 253
Applied a total of 53 rules in 4 ms. Remains 120 /160 variables (removed 40) and now considering 253/278 (removed 25) transitions.
[2021-05-09 00:59:20] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
// Phase 1: matrix 198 rows 120 cols
[2021-05-09 00:59:20] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-09 00:59:20] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 00:59:20] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
// Phase 1: matrix 198 rows 120 cols
[2021-05-09 00:59:20] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-09 00:59:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:59:20] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2021-05-09 00:59:20] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
// Phase 1: matrix 198 rows 120 cols
[2021-05-09 00:59:20] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 00:59:20] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/160 places, 253/278 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-11a-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (NEQ s34 1) (NEQ s119 1)), p0:(OR (NEQ s59 1) (NEQ s117 1) (NEQ s106 1) (NEQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Graph (complete) has 271 edges and 120 vertex of which 117 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 120 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 120/120 places, 253/253 transitions.
Graph (trivial) has 237 edges and 120 vertex of which 106 / 120 are part of one of the 16 SCC in 0 ms
Free SCC test removed 90 places
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 30 transition count 38
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 18 place count 18 transition count 26
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 18 transition count 26
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 30 rules in 2 ms. Remains 18 /120 variables (removed 102) and now considering 26/253 (removed 227) transitions.
[2021-05-09 00:59:22] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 00:59:22] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 18 cols
[2021-05-09 00:59:22] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 00:59:22] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/120 places, 26/253 transitions.
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
[2021-05-09 00:59:22] [INFO ] Flatten gal took : 8 ms
[2021-05-09 00:59:22] [INFO ] Flatten gal took : 9 ms
[2021-05-09 00:59:22] [INFO ] Time to serialize gal into /tmp/LTL18344605760296099404.gal : 2 ms
[2021-05-09 00:59:22] [INFO ] Time to serialize properties into /tmp/LTL14940251894872303669.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18344605760296099404.gal, -t, CGAL, -LTL, /tmp/LTL14940251894872303669.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18344605760296099404.gal -t CGAL -LTL /tmp/LTL14940251894872303669.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((p77!=1)||(p183!=1))||(p136!=1))||(p236!=1))")||(G("((p46!=1)||(p263!=1))"))))))
Formula 0 simplified : !XF("((((p77!=1)||(p183!=1))||(p136!=1))||(p236!=1))" | G"((p46!=1)||(p263!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.100617,19364,1,0,6,16112,30,0,2734,1656,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DLCround-PT-11a-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DLCround-PT-11a-10 finished in 1885 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((X(p1)||p0))||(F(G(p2)) U p1)))], workingDir=/home/mcc/execution]
Support contains 8 out of 160 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 160/160 places, 278/278 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 133 transition count 278
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 123 transition count 258
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 123 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 123 transition count 257
Applied a total of 48 rules in 4 ms. Remains 123 /160 variables (removed 37) and now considering 257/278 (removed 21) transitions.
[2021-05-09 00:59:22] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 123 cols
[2021-05-09 00:59:22] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 00:59:22] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 00:59:22] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 123 cols
[2021-05-09 00:59:22] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 00:59:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:59:22] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2021-05-09 00:59:22] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
// Phase 1: matrix 200 rows 123 cols
[2021-05-09 00:59:22] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 00:59:22] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/160 places, 257/278 transitions.
Stuttering acceptance computed with spot in 22 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-11a-11 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s28 1) (EQ s119 1) (EQ s114 1) (EQ s122 1)) (AND (EQ s8 1) (EQ s120 1))), p1:(AND (EQ s42 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-11a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-11a-11 finished in 210 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.computeTGBA(SpotRunner.java:114)
at fr.lip6.move.gal.application.SpotRunner.transformToTGBA(SpotRunner.java:70)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:156)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Application raised an uncaught exception null
java.lang.NullPointerException
at fr.lip6.move.gal.application.LTLPropertySolver.reduceForProperty(LTLPropertySolver.java:291)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:159)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620521978456

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

+ 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
+ [[ -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 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=/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="DLCround-PT-11a"
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 DLCround-PT-11a, 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 r064-tall-162038397200405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-11a.tgz
mv DLCround-PT-11a 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 ;