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-162038397200421.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-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397200421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K 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.6K Mar 28 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 16:24 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 871K 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-12a-00
FORMULA_NAME DLCround-PT-12a-01
FORMULA_NAME DLCround-PT-12a-02
FORMULA_NAME DLCround-PT-12a-03
FORMULA_NAME DLCround-PT-12a-04
FORMULA_NAME DLCround-PT-12a-05
FORMULA_NAME DLCround-PT-12a-06
FORMULA_NAME DLCround-PT-12a-07
FORMULA_NAME DLCround-PT-12a-08
FORMULA_NAME DLCround-PT-12a-09
FORMULA_NAME DLCround-PT-12a-10
FORMULA_NAME DLCround-PT-12a-11
FORMULA_NAME DLCround-PT-12a-12
FORMULA_NAME DLCround-PT-12a-13
FORMULA_NAME DLCround-PT-12a-14
FORMULA_NAME DLCround-PT-12a-15

=== Now, execution of the tool begins

BK_START 1620525208287

Running Version 0
[2021-05-09 01:53:48] [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 01:53:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 01:53:48] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2021-05-09 01:53:48] [INFO ] Transformed 419 places.
[2021-05-09 01:53:48] [INFO ] Transformed 3407 transitions.
[2021-05-09 01:53:48] [INFO ] Found NUPN structural information;
[2021-05-09 01:53:48] [INFO ] Parsed PT model containing 419 places and 3407 transitions in 220 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 01:53:48] [INFO ] Initial state test concluded for 6 properties.
Ensure Unique test removed 315 transitions
Reduce redundant transitions removed 315 transitions.
FORMULA DLCround-PT-12a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 419 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 419/419 places, 3092/3092 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 392 transition count 2630
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 392 transition count 2630
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 392 transition count 2627
Drop transitions removed 808 transitions
Redundant transition composition rules discarded 808 transitions
Iterating global reduction 1 with 808 rules applied. Total rules applied 865 place count 392 transition count 1819
Applied a total of 865 rules in 140 ms. Remains 392 /419 variables (removed 27) and now considering 1819/3092 (removed 1273) transitions.
[2021-05-09 01:53:49] [INFO ] Flow matrix only has 220 transitions (discarded 1599 similar events)
// Phase 1: matrix 220 rows 392 cols
[2021-05-09 01:53:49] [INFO ] Computed 277 place invariants in 19 ms
[2021-05-09 01:53:50] [INFO ] Implicit Places using invariants in 1186 ms returned [132, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 150, 151, 152, 153, 154, 156, 157, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 181, 182, 183, 184, 185, 186, 187, 188, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 207, 208, 209, 210, 212, 213, 214, 215, 216, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 250, 252, 253, 255, 256, 257, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 272, 273, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 296, 298, 300, 301, 302, 303, 304, 305, 307, 308, 309, 310, 311, 312, 313, 314, 315, 317, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 363, 364, 365, 366, 367, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 386, 387, 388, 389, 390, 391]
Discarding 231 places :
Ensure Unique test removed 1344 transitions
Reduce isomorphic transitions removed 1344 transitions.
Implicit Place search using SMT only with invariants took 1219 ms to find 231 implicit places.
[2021-05-09 01:53:50] [INFO ] Flow matrix only has 220 transitions (discarded 255 similar events)
// Phase 1: matrix 220 rows 161 cols
[2021-05-09 01:53:50] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-09 01:53:50] [INFO ] Dead Transitions using invariants and state equation in 190 ms returned []
Starting structural reductions, iteration 1 : 161/419 places, 475/3092 transitions.
Drop transitions removed 189 transitions
Redundant transition composition rules discarded 189 transitions
Iterating global reduction 0 with 189 rules applied. Total rules applied 189 place count 161 transition count 286
Applied a total of 189 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 286/475 (removed 189) transitions.
[2021-05-09 01:53:50] [INFO ] Flow matrix only has 220 transitions (discarded 66 similar events)
// Phase 1: matrix 220 rows 161 cols
[2021-05-09 01:53:50] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-09 01:53:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2021-05-09 01:53:50] [INFO ] Flow matrix only has 220 transitions (discarded 66 similar events)
// Phase 1: matrix 220 rows 161 cols
[2021-05-09 01:53:50] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-09 01:53:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:53:50] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 161/419 places, 286/3092 transitions.
[2021-05-09 01:53:50] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 01:53:50] [INFO ] Flatten gal took : 44 ms
FORMULA DLCround-PT-12a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 01:53:50] [INFO ] Flatten gal took : 17 ms
[2021-05-09 01:53:50] [INFO ] Input system was already deterministic with 286 transitions.
Finished random walk after 1568 steps, including 0 resets, run visited all 23 properties in 18 ms. (steps per millisecond=87 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X((p1||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 286/286 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 135 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 129 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 129 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 129 transition count 273
Applied a total of 39 rules in 7 ms. Remains 129 /161 variables (removed 32) and now considering 273/286 (removed 13) transitions.
[2021-05-09 01:53:50] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
// Phase 1: matrix 213 rows 129 cols
[2021-05-09 01:53:50] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-09 01:53:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2021-05-09 01:53:50] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
// Phase 1: matrix 213 rows 129 cols
[2021-05-09 01:53:50] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 01:53:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:53:51] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
// Phase 1: matrix 213 rows 129 cols
[2021-05-09 01:53:51] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-09 01:53:51] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/161 places, 273/286 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DLCround-PT-12a-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s121 1) (EQ s128 1)), p1:(AND (EQ s51 1) (EQ s126 1)), p2:(AND (EQ s75 1) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-12a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-00 finished in 474 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&F(G((G(p1) U p2)))) U (p2 U p3)))], workingDir=/home/mcc/execution]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 286/286 transitions.
Graph (trivial) has 270 edges and 161 vertex of which 121 / 161 are part of one of the 17 SCC in 4 ms
Free SCC test removed 104 places
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 244 transitions.
Graph (complete) has 87 edges and 57 vertex of which 31 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.4 ms
Discarding 26 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 31 transition count 41
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 30 transition count 40
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 29 transition count 39
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 20 place count 16 transition count 26
Iterating global reduction 3 with 13 rules applied. Total rules applied 33 place count 16 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 16 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 15 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 15 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 15 transition count 24
Applied a total of 37 rules in 34 ms. Remains 15 /161 variables (removed 146) and now considering 24/286 (removed 262) transitions.
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 16 transitions (discarded 8 similar events)
// Phase 1: matrix 16 rows 15 cols
[2021-05-09 01:53:51] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 01:53:51] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 16 transitions (discarded 8 similar events)
// Phase 1: matrix 16 rows 15 cols
[2021-05-09 01:53:51] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 01:53:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:53:51] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-09 01:53:51] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 16 transitions (discarded 8 similar events)
// Phase 1: matrix 16 rows 15 cols
[2021-05-09 01:53:51] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 01:53:51] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/161 places, 24/286 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p3), true, (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DLCround-PT-12a-01 automaton TGBA [mat=[[{ cond=(AND (NOT p3) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s2 1) (EQ s12 1)), p0:(OR (EQ s4 0) (EQ s14 0)), p2:(AND (EQ s4 1) (EQ s14 1)), p1:(OR (NEQ s10 1) (NEQ s13 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-01 finished in 261 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 286/286 transitions.
Graph (trivial) has 276 edges and 161 vertex of which 125 / 161 are part of one of the 16 SCC in 1 ms
Free SCC test removed 109 places
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Graph (complete) has 74 edges and 52 vertex of which 25 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 27
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 23 transition count 26
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 21 place count 9 transition count 12
Iterating global reduction 2 with 14 rules applied. Total rules applied 35 place count 9 transition count 12
Applied a total of 35 rules in 5 ms. Remains 9 /161 variables (removed 152) and now considering 12/286 (removed 274) transitions.
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 01:53:51] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 01:53:51] [INFO ] Implicit Places using invariants in 16 ms returned []
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 01:53:51] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 01:53:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:53:51] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-09 01:53:51] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 01:53:51] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 01:53:51] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/161 places, 12/286 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-12a-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s5 1) (EQ s8 1)), p1:(AND (EQ s3 1) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-12a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-02 finished in 104 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 286/286 transitions.
Graph (trivial) has 276 edges and 161 vertex of which 125 / 161 are part of one of the 16 SCC in 0 ms
Free SCC test removed 109 places
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Graph (complete) has 74 edges and 52 vertex of which 25 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 27
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 23 transition count 26
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 21 place count 9 transition count 12
Iterating global reduction 2 with 14 rules applied. Total rules applied 35 place count 9 transition count 12
Applied a total of 35 rules in 3 ms. Remains 9 /161 variables (removed 152) and now considering 12/286 (removed 274) transitions.
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 01:53:51] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 01:53:51] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 01:53:51] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 01:53:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:53:51] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-09 01:53:51] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 01:53:51] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 01:53:51] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/161 places, 12/286 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : DLCround-PT-12a-03 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s8 1)), p0:(OR (EQ s4 0) (EQ s7 0))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-03 finished in 105 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&(G(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 286/286 transitions.
Graph (trivial) has 270 edges and 161 vertex of which 119 / 161 are part of one of the 15 SCC in 0 ms
Free SCC test removed 104 places
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Graph (complete) has 83 edges and 57 vertex of which 31 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 31 transition count 34
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 27 transition count 32
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 25 place count 14 transition count 19
Iterating global reduction 2 with 13 rules applied. Total rules applied 38 place count 14 transition count 19
Applied a total of 38 rules in 3 ms. Remains 14 /161 variables (removed 147) and now considering 19/286 (removed 267) transitions.
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 13 transitions (discarded 6 similar events)
// Phase 1: matrix 13 rows 14 cols
[2021-05-09 01:53:51] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 01:53:51] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 13 transitions (discarded 6 similar events)
// Phase 1: matrix 13 rows 14 cols
[2021-05-09 01:53:51] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 01:53:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:53:51] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-09 01:53:51] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 13 transitions (discarded 6 similar events)
// Phase 1: matrix 13 rows 14 cols
[2021-05-09 01:53:51] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 01:53:51] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/161 places, 19/286 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : DLCround-PT-12a-06 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s3 1) (NEQ s12 1)), p1:(OR (NEQ s7 1) (NEQ s13 1)), p2:(OR (NEQ s8 1) (NEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-06 finished in 121 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 286/286 transitions.
Graph (trivial) has 266 edges and 161 vertex of which 115 / 161 are part of one of the 16 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 234 transitions
Reduce isomorphic transitions removed 234 transitions.
Graph (complete) has 97 edges and 62 vertex of which 36 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 50
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 34 transition count 48
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 32 transition count 47
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 24 place count 19 transition count 34
Iterating global reduction 3 with 13 rules applied. Total rules applied 37 place count 19 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 19 transition count 34
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 18 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 18 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 18 transition count 32
Applied a total of 41 rules in 6 ms. Remains 18 /161 variables (removed 143) and now considering 32/286 (removed 254) transitions.
[2021-05-09 01:53:51] [INFO ] Flow matrix only has 22 transitions (discarded 10 similar events)
// Phase 1: matrix 22 rows 18 cols
[2021-05-09 01:53:51] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-09 01:53:52] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-09 01:53:52] [INFO ] Flow matrix only has 22 transitions (discarded 10 similar events)
// Phase 1: matrix 22 rows 18 cols
[2021-05-09 01:53:52] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 01:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:53:52] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-09 01:53:52] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 01:53:52] [INFO ] Flow matrix only has 22 transitions (discarded 10 similar events)
// Phase 1: matrix 22 rows 18 cols
[2021-05-09 01:53:52] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 01:53:52] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/161 places, 32/286 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DLCround-PT-12a-07 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s16 1) (OR (EQ s4 0) (EQ s15 0))), p0:(AND (EQ s13 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-07 finished in 114 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 286/286 transitions.
Graph (trivial) has 281 edges and 161 vertex of which 129 / 161 are part of one of the 18 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 261 transitions
Reduce isomorphic transitions removed 261 transitions.
Graph (complete) has 70 edges and 50 vertex of which 21 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 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 21 transition count 24
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 20 transition count 23
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 20 place count 5 transition count 8
Iterating global reduction 2 with 15 rules applied. Total rules applied 35 place count 5 transition count 8
Applied a total of 35 rules in 3 ms. Remains 5 /161 variables (removed 156) and now considering 8/286 (removed 278) transitions.
[2021-05-09 01:53:52] [INFO ] Flow matrix only has 5 transitions (discarded 3 similar events)
// Phase 1: matrix 5 rows 5 cols
[2021-05-09 01:53:52] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 01:53:52] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-09 01:53:52] [INFO ] Flow matrix only has 5 transitions (discarded 3 similar events)
// Phase 1: matrix 5 rows 5 cols
[2021-05-09 01:53:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 01:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:53:52] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-09 01:53:52] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 01:53:52] [INFO ] Flow matrix only has 5 transitions (discarded 3 similar events)
// Phase 1: matrix 5 rows 5 cols
[2021-05-09 01:53:52] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 01:53:52] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/161 places, 8/286 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : DLCround-PT-12a-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-12a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-08 finished in 84 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 286/286 transitions.
Graph (trivial) has 276 edges and 161 vertex of which 125 / 161 are part of one of the 17 SCC in 1 ms
Free SCC test removed 108 places
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Graph (complete) has 78 edges and 53 vertex of which 25 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 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 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 32
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 19 place count 9 transition count 17
Iterating global reduction 2 with 15 rules applied. Total rules applied 34 place count 9 transition count 17
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 9 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 9 transition count 16
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 8 transition count 15
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 8 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 8 transition count 14
Applied a total of 39 rules in 11 ms. Remains 8 /161 variables (removed 153) and now considering 14/286 (removed 272) transitions.
[2021-05-09 01:53:52] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 01:53:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 01:53:52] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 01:53:52] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 01:53:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 01:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:53:52] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-09 01:53:52] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 01:53:52] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 01:53:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 01:53:52] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/161 places, 14/286 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-12a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-10 finished in 73 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (F(p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 286/286 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 135 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 128 transition count 272
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 128 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 128 transition count 271
Applied a total of 41 rules in 4 ms. Remains 128 /161 variables (removed 33) and now considering 271/286 (removed 15) transitions.
[2021-05-09 01:53:52] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
// Phase 1: matrix 212 rows 128 cols
[2021-05-09 01:53:52] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 01:53:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 01:53:52] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
// Phase 1: matrix 212 rows 128 cols
[2021-05-09 01:53:52] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 01:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:53:52] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2021-05-09 01:53:52] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
// Phase 1: matrix 212 rows 128 cols
[2021-05-09 01:53:52] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 01:53:52] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/161 places, 271/286 transitions.
Stuttering acceptance computed with spot in 21850 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : DLCround-PT-12a-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s74 1) (EQ s127 1)), p0:(OR (EQ s43 0) (EQ s125 0)), p1:(AND (EQ s59 1) (EQ s126 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-11 finished in 22042 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 286/286 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 133 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 126 transition count 272
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 126 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 126 transition count 271
Applied a total of 43 rules in 4 ms. Remains 126 /161 variables (removed 35) and now considering 271/286 (removed 15) transitions.
[2021-05-09 01:54:14] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
// Phase 1: matrix 212 rows 126 cols
[2021-05-09 01:54:14] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-09 01:54:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2021-05-09 01:54:14] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
// Phase 1: matrix 212 rows 126 cols
[2021-05-09 01:54:14] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-09 01:54:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:54:14] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2021-05-09 01:54:14] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
// Phase 1: matrix 212 rows 126 cols
[2021-05-09 01:54:14] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 01:54:14] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/161 places, 271/286 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-12a-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s26 1) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-13 finished in 315 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 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 286/286 transitions.
Graph (trivial) has 276 edges and 161 vertex of which 125 / 161 are part of one of the 17 SCC in 1 ms
Free SCC test removed 108 places
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Graph (complete) has 78 edges and 53 vertex of which 25 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 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 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 32
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 19 place count 9 transition count 17
Iterating global reduction 2 with 15 rules applied. Total rules applied 34 place count 9 transition count 17
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 9 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 9 transition count 16
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 8 transition count 15
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 8 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 8 transition count 14
Applied a total of 39 rules in 4 ms. Remains 8 /161 variables (removed 153) and now considering 14/286 (removed 272) transitions.
[2021-05-09 01:54:14] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 01:54:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 01:54:14] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-09 01:54:14] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 01:54:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 01:54:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 01:54:14] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-09 01:54:14] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 01:54:14] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2021-05-09 01:54:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 01:54:14] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/161 places, 14/286 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-12a-15 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:(OR (NEQ s5 1) (NEQ s7 1))], 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 4 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-12a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-15 finished in 88 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620525255775

--------------------
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-12a"
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-12a, 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-162038397200421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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