About the Execution of LTSMin+red for FlexibleBarrier-PT-22a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
280.615 | 7180.00 | 13516.00 | 327.70 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r169-tall-167838856100587.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FlexibleBarrier-PT-22a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856100587
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.6K Feb 25 13:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 13:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 25 13:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 384K Mar 5 18:22 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 FlexibleBarrier-PT-22a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-22a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678578542445
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-22a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 23:49:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 23:49:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:49:04] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-11 23:49:04] [INFO ] Transformed 267 places.
[2023-03-11 23:49:04] [INFO ] Transformed 1258 transitions.
[2023-03-11 23:49:04] [INFO ] Found NUPN structural information;
[2023-03-11 23:49:04] [INFO ] Parsed PT model containing 267 places and 1258 transitions and 6375 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 442 transitions
Reduce redundant transitions removed 442 transitions.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 816/816 transitions.
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 267 transition count 794
Applied a total of 22 rules in 46 ms. Remains 267 /267 variables (removed 0) and now considering 794/816 (removed 22) transitions.
// Phase 1: matrix 794 rows 267 cols
[2023-03-11 23:49:04] [INFO ] Computed 24 place invariants in 20 ms
[2023-03-11 23:49:04] [INFO ] Implicit Places using invariants in 301 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 333 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/267 places, 794/816 transitions.
Applied a total of 0 rules in 8 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 388 ms. Remains : 266/267 places, 794/816 transitions.
Support contains 33 out of 266 places after structural reductions.
[2023-03-11 23:49:05] [INFO ] Flatten gal took : 71 ms
[2023-03-11 23:49:05] [INFO ] Flatten gal took : 46 ms
[2023-03-11 23:49:05] [INFO ] Input system was already deterministic with 794 transitions.
Finished random walk after 2263 steps, including 0 resets, run visited all 21 properties in 139 ms. (steps per millisecond=16 )
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 794/794 transitions.
Graph (trivial) has 319 edges and 266 vertex of which 162 / 266 are part of one of the 23 SCC in 3 ms
Free SCC test removed 139 places
Ensure Unique test removed 367 transitions
Reduce isomorphic transitions removed 367 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 127 transition count 404
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 104 transition count 404
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 47 place count 104 transition count 382
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 91 place count 82 transition count 382
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 139 place count 58 transition count 358
Drop transitions removed 269 transitions
Redundant transition composition rules discarded 269 transitions
Iterating global reduction 2 with 269 rules applied. Total rules applied 408 place count 58 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 409 place count 58 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 410 place count 57 transition count 88
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 415 place count 57 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 417 place count 55 transition count 86
Iterating global reduction 4 with 2 rules applied. Total rules applied 419 place count 55 transition count 86
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 422 place count 55 transition count 83
Applied a total of 422 rules in 59 ms. Remains 55 /266 variables (removed 211) and now considering 83/794 (removed 711) transitions.
[2023-03-11 23:49:05] [INFO ] Flow matrix only has 58 transitions (discarded 25 similar events)
// Phase 1: matrix 58 rows 55 cols
[2023-03-11 23:49:05] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-11 23:49:05] [INFO ] Implicit Places using invariants in 58 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/266 places, 83/794 transitions.
Graph (trivial) has 72 edges and 54 vertex of which 38 / 54 are part of one of the 19 SCC in 1 ms
Free SCC test removed 19 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 17 transition count 26
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 17 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 17 transition count 25
Applied a total of 38 rules in 5 ms. Remains 17 /54 variables (removed 37) and now considering 25/83 (removed 58) transitions.
[2023-03-11 23:49:05] [INFO ] Flow matrix only has 18 transitions (discarded 7 similar events)
// Phase 1: matrix 18 rows 17 cols
[2023-03-11 23:49:05] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-11 23:49:05] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 23:49:05] [INFO ] Flow matrix only has 18 transitions (discarded 7 similar events)
[2023-03-11 23:49:05] [INFO ] Invariant cache hit.
[2023-03-11 23:49:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 23:49:06] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/266 places, 25/794 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 17/266 places, 25/794 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s4 0) (EQ s10 1)), p0:(AND (EQ s15 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLCardinality-00 finished in 379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 794/794 transitions.
Graph (trivial) has 325 edges and 266 vertex of which 170 / 266 are part of one of the 22 SCC in 1 ms
Free SCC test removed 148 places
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 118 transition count 392
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 96 transition count 392
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 45 place count 96 transition count 370
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 89 place count 74 transition count 370
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 133 place count 52 transition count 348
Drop transitions removed 271 transitions
Redundant transition composition rules discarded 271 transitions
Iterating global reduction 2 with 271 rules applied. Total rules applied 404 place count 52 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 405 place count 52 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 406 place count 51 transition count 76
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 409 place count 51 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 410 place count 50 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 411 place count 50 transition count 75
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 412 place count 50 transition count 74
Applied a total of 412 rules in 40 ms. Remains 50 /266 variables (removed 216) and now considering 74/794 (removed 720) transitions.
[2023-03-11 23:49:06] [INFO ] Flow matrix only has 51 transitions (discarded 23 similar events)
// Phase 1: matrix 51 rows 50 cols
[2023-03-11 23:49:06] [INFO ] Computed 23 place invariants in 0 ms
[2023-03-11 23:49:06] [INFO ] Implicit Places using invariants in 44 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/266 places, 74/794 transitions.
Graph (trivial) has 68 edges and 49 vertex of which 40 / 49 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 9 transition count 13
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 9 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 9 transition count 12
Applied a total of 42 rules in 2 ms. Remains 9 /49 variables (removed 40) and now considering 12/74 (removed 62) transitions.
[2023-03-11 23:49:06] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 9 cols
[2023-03-11 23:49:06] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 23:49:06] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 23:49:06] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2023-03-11 23:49:06] [INFO ] Invariant cache hit.
[2023-03-11 23:49:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 23:49:06] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/266 places, 12/794 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 9/266 places, 12/794 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s8 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 9 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLCardinality-01 finished in 208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 794/794 transitions.
Applied a total of 0 rules in 7 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
// Phase 1: matrix 794 rows 266 cols
[2023-03-11 23:49:06] [INFO ] Computed 23 place invariants in 12 ms
[2023-03-11 23:49:06] [INFO ] Implicit Places using invariants in 251 ms returned [265]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 254 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/266 places, 794/794 transitions.
Applied a total of 0 rules in 5 ms. Remains 265 /265 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 267 ms. Remains : 265/266 places, 794/794 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s149 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 757 steps with 0 reset in 13 ms.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLCardinality-02 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 794/794 transitions.
Applied a total of 0 rules in 6 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2023-03-11 23:49:06] [INFO ] Invariant cache hit.
[2023-03-11 23:49:06] [INFO ] Implicit Places using invariants in 222 ms returned [265]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 224 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/266 places, 794/794 transitions.
Applied a total of 0 rules in 3 ms. Remains 265 /265 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 265/266 places, 794/794 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (EQ s112 0) (EQ s263 1)), p0:(EQ s228 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLCardinality-03 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(p1&&F(p0)))))'
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 794/794 transitions.
Graph (trivial) has 325 edges and 266 vertex of which 170 / 266 are part of one of the 22 SCC in 1 ms
Free SCC test removed 148 places
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 156 edges and 116 vertex of which 105 / 116 are part of one of the 21 SCC in 1 ms
Free SCC test removed 84 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 32 transition count 411
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Graph (trivial) has 8 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 420 rules applied. Total rules applied 425 place count 8 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 426 place count 8 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 426 place count 8 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 428 place count 7 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 432 place count 5 transition count 11
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 435 place count 5 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 436 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 437 place count 4 transition count 7
Applied a total of 437 rules in 19 ms. Remains 4 /266 variables (removed 262) and now considering 7/794 (removed 787) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-11 23:49:07] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 23:49:07] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 23:49:07] [INFO ] Invariant cache hit.
[2023-03-11 23:49:07] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-11 23:49:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 23:49:07] [INFO ] Invariant cache hit.
[2023-03-11 23:49:07] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/266 places, 7/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 4/266 places, 7/794 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s2 0) (EQ s0 1)), p0:(AND (EQ s0 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLCardinality-06 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 794/794 transitions.
Graph (trivial) has 323 edges and 266 vertex of which 165 / 266 are part of one of the 22 SCC in 2 ms
Free SCC test removed 143 places
Ensure Unique test removed 373 transitions
Reduce isomorphic transitions removed 373 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 162 edges and 121 vertex of which 109 / 121 are part of one of the 22 SCC in 1 ms
Free SCC test removed 87 places
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 4 rules applied. Total rules applied 5 place count 34 transition count 418
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 390 transitions.
Iterating post reduction 1 with 411 rules applied. Total rules applied 416 place count 13 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 417 place count 12 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 418 place count 12 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 3 rules applied. Total rules applied 421 place count 12 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 423 place count 10 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 425 place count 9 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 426 place count 9 transition count 21
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 437 place count 9 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 438 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 439 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 439 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 443 place count 6 transition count 7
Applied a total of 443 rules in 20 ms. Remains 6 /266 variables (removed 260) and now considering 7/794 (removed 787) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-11 23:49:07] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 23:49:07] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-11 23:49:07] [INFO ] Invariant cache hit.
[2023-03-11 23:49:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-11 23:49:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 23:49:07] [INFO ] Invariant cache hit.
[2023-03-11 23:49:07] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/266 places, 7/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 6/266 places, 7/794 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (OR (EQ s2 0) (EQ s4 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLCardinality-08 finished in 149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1)))))'
Support contains 4 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 794/794 transitions.
Applied a total of 0 rules in 6 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
// Phase 1: matrix 794 rows 266 cols
[2023-03-11 23:49:07] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-11 23:49:07] [INFO ] Implicit Places using invariants in 244 ms returned [265]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 246 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/266 places, 794/794 transitions.
Applied a total of 0 rules in 3 ms. Remains 265 /265 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 255 ms. Remains : 265/266 places, 794/794 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s126 0) (EQ s149 1)), p1:(AND (EQ s59 0) (EQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLCardinality-09 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 794/794 transitions.
Graph (trivial) has 328 edges and 266 vertex of which 173 / 266 are part of one of the 23 SCC in 1 ms
Free SCC test removed 150 places
Ensure Unique test removed 402 transitions
Reduce isomorphic transitions removed 402 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 158 edges and 114 vertex of which 108 / 114 are part of one of the 22 SCC in 0 ms
Free SCC test removed 86 places
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 3 rules applied. Total rules applied 4 place count 28 transition count 390
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 405 place count 6 transition count 11
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 5 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 409 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 411 place count 4 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 412 place count 3 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 414 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 415 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 416 place count 2 transition count 3
Applied a total of 416 rules in 9 ms. Remains 2 /266 variables (removed 264) and now considering 3/794 (removed 791) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-11 23:49:08] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 23:49:08] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-11 23:49:08] [INFO ] Invariant cache hit.
[2023-03-11 23:49:08] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-11 23:49:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 23:49:08] [INFO ] Invariant cache hit.
[2023-03-11 23:49:08] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/266 places, 3/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 2/266 places, 3/794 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLCardinality-10 automaton TGBA Formula[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:(EQ s0 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 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLCardinality-10 finished in 158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 794/794 transitions.
Graph (trivial) has 323 edges and 266 vertex of which 171 / 266 are part of one of the 22 SCC in 1 ms
Free SCC test removed 149 places
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 401 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 151 edges and 115 vertex of which 98 / 115 are part of one of the 19 SCC in 0 ms
Free SCC test removed 79 places
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 4 rules applied. Total rules applied 5 place count 36 transition count 390
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 359 transitions
Reduce isomorphic transitions removed 359 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 380 rules applied. Total rules applied 385 place count 16 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 386 place count 15 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 386 place count 15 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 388 place count 14 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 392 place count 12 transition count 27
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 406 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 407 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 408 place count 11 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 408 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 414 place count 8 transition count 9
Applied a total of 414 rules in 7 ms. Remains 8 /266 variables (removed 258) and now considering 9/794 (removed 785) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-03-11 23:49:08] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 23:49:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 23:49:08] [INFO ] Invariant cache hit.
[2023-03-11 23:49:08] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-11 23:49:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 23:49:08] [INFO ] Invariant cache hit.
[2023-03-11 23:49:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/266 places, 9/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 8/266 places, 9/794 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s2 1)), p1:(AND (NEQ s0 0) (NEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLCardinality-11 finished in 168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 794/794 transitions.
Graph (trivial) has 322 edges and 266 vertex of which 173 / 266 are part of one of the 23 SCC in 1 ms
Free SCC test removed 150 places
Ensure Unique test removed 402 transitions
Reduce isomorphic transitions removed 402 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 152 edges and 114 vertex of which 98 / 114 are part of one of the 20 SCC in 1 ms
Free SCC test removed 78 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 36 transition count 388
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 386 rules applied. Total rules applied 392 place count 14 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 394 place count 12 transition count 24
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 395 place count 11 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 396 place count 11 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 398 place count 11 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 400 place count 10 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 401 place count 9 transition count 19
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 410 place count 9 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 3 rules applied. Total rules applied 413 place count 9 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 416 place count 6 transition count 7
Applied a total of 416 rules in 12 ms. Remains 6 /266 variables (removed 260) and now considering 7/794 (removed 787) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-11 23:49:08] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 23:49:08] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-11 23:49:08] [INFO ] Invariant cache hit.
[2023-03-11 23:49:08] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-11 23:49:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 23:49:08] [INFO ] Invariant cache hit.
[2023-03-11 23:49:08] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/266 places, 7/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 6/266 places, 7/794 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s2 1)), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLCardinality-14 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 794/794 transitions.
Graph (trivial) has 324 edges and 266 vertex of which 165 / 266 are part of one of the 22 SCC in 1 ms
Free SCC test removed 143 places
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 393 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 163 edges and 121 vertex of which 111 / 121 are part of one of the 22 SCC in 0 ms
Free SCC test removed 89 places
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 3 rules applied. Total rules applied 4 place count 32 transition count 399
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Graph (trivial) has 12 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 402 rules applied. Total rules applied 406 place count 10 transition count 19
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 408 place count 9 transition count 18
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 409 place count 8 transition count 16
Iterating global reduction 3 with 1 rules applied. Total rules applied 410 place count 8 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 412 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 414 place count 7 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 415 place count 6 transition count 13
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 421 place count 6 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 423 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 425 place count 4 transition count 5
Applied a total of 425 rules in 13 ms. Remains 4 /266 variables (removed 262) and now considering 5/794 (removed 789) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-11 23:49:08] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 23:49:08] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 23:49:08] [INFO ] Invariant cache hit.
[2023-03-11 23:49:08] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-11 23:49:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 23:49:08] [INFO ] Invariant cache hit.
[2023-03-11 23:49:08] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/266 places, 5/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 4/266 places, 5/794 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s2 0) (NEQ s0 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 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLCardinality-15 finished in 137 ms.
All properties solved by simple procedures.
Total runtime 4550 ms.
ITS solved all properties within timeout
BK_STOP 1678578549625
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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="FlexibleBarrier-PT-22a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-22a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856100587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-22a.tgz
mv FlexibleBarrier-PT-22a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;