About the Execution of ITS-Tools for FlexibleBarrier-PT-12b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 487.128 | 38767.00 | 71853.00 | 352.30 | TTFTTFFFTTFFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575700075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575700075
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 6.7K Apr 29 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 536K May 10 09:33 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-12b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652626280115
Running Version 202205111006
[2022-05-15 14:51:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 14:51:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:51:22] [INFO ] Load time of PNML (sax parser for PT used): 343 ms
[2022-05-15 14:51:22] [INFO ] Transformed 1988 places.
[2022-05-15 14:51:22] [INFO ] Transformed 2289 transitions.
[2022-05-15 14:51:22] [INFO ] Found NUPN structural information;
[2022-05-15 14:51:22] [INFO ] Parsed PT model containing 1988 places and 2289 transitions in 537 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 1988 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Discarding 783 places :
Symmetric choice reduction at 0 with 783 rule applications. Total rules 783 place count 1205 transition count 1506
Iterating global reduction 0 with 783 rules applied. Total rules applied 1566 place count 1205 transition count 1506
Discarding 362 places :
Symmetric choice reduction at 0 with 362 rule applications. Total rules 1928 place count 843 transition count 1144
Iterating global reduction 0 with 362 rules applied. Total rules applied 2290 place count 843 transition count 1144
Discarding 231 places :
Symmetric choice reduction at 0 with 231 rule applications. Total rules 2521 place count 612 transition count 913
Iterating global reduction 0 with 231 rules applied. Total rules applied 2752 place count 612 transition count 913
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 0 with 110 rules applied. Total rules applied 2862 place count 612 transition count 803
Applied a total of 2862 rules in 462 ms. Remains 612 /1988 variables (removed 1376) and now considering 803/2289 (removed 1486) transitions.
// Phase 1: matrix 803 rows 612 cols
[2022-05-15 14:51:23] [INFO ] Computed 14 place invariants in 43 ms
[2022-05-15 14:51:24] [INFO ] Implicit Places using invariants in 794 ms returned []
// Phase 1: matrix 803 rows 612 cols
[2022-05-15 14:51:24] [INFO ] Computed 14 place invariants in 12 ms
[2022-05-15 14:51:24] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
// Phase 1: matrix 803 rows 612 cols
[2022-05-15 14:51:24] [INFO ] Computed 14 place invariants in 17 ms
[2022-05-15 14:51:25] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/1988 places, 803/2289 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/1988 places, 803/2289 transitions.
Support contains 19 out of 612 places after structural reductions.
[2022-05-15 14:51:26] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-15 14:51:26] [INFO ] Flatten gal took : 185 ms
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 14:51:26] [INFO ] Flatten gal took : 103 ms
[2022-05-15 14:51:26] [INFO ] Input system was already deterministic with 803 transitions.
Support contains 14 out of 612 places (down from 19) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 873 ms. (steps per millisecond=11 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 803 rows 612 cols
[2022-05-15 14:51:27] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-15 14:51:28] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-15 14:51:28] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 14:51:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2022-05-15 14:51:29] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-05-15 14:51:29] [INFO ] Deduced a trap composed of 159 places in 346 ms of which 7 ms to minimize.
[2022-05-15 14:51:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 423 ms
[2022-05-15 14:51:30] [INFO ] After 1528ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 268 ms.
[2022-05-15 14:51:30] [INFO ] After 2185ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 104 ms.
Support contains 8 out of 612 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 612/612 places, 803/803 transitions.
Graph (trivial) has 565 edges and 612 vertex of which 73 / 612 are part of one of the 12 SCC in 8 ms
Free SCC test removed 61 places
Drop transitions removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 551 transition count 669
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 491 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 490 transition count 668
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 123 place count 490 transition count 642
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 175 place count 464 transition count 642
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 204 place count 435 transition count 613
Iterating global reduction 3 with 29 rules applied. Total rules applied 233 place count 435 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 435 transition count 612
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 239 place count 430 transition count 607
Iterating global reduction 4 with 5 rules applied. Total rules applied 244 place count 430 transition count 607
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 247 place count 430 transition count 604
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 395 place count 356 transition count 530
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 418 place count 356 transition count 507
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 433 place count 341 transition count 492
Iterating global reduction 6 with 15 rules applied. Total rules applied 448 place count 341 transition count 492
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 451 place count 341 transition count 489
Free-agglomeration rule applied 270 times.
Iterating global reduction 7 with 270 rules applied. Total rules applied 721 place count 341 transition count 219
Reduce places removed 270 places and 0 transitions.
Drop transitions removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Graph (complete) has 193 edges and 71 vertex of which 41 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.4 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 391 rules applied. Total rules applied 1112 place count 41 transition count 99
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 8 with 42 rules applied. Total rules applied 1154 place count 41 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1155 place count 41 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1156 place count 40 transition count 56
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 30 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 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 9 with 3 rules applied. Total rules applied 1159 place count 33 transition count 55
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1172 place count 32 transition count 43
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 5 Pre rules applied. Total rules applied 1172 place count 32 transition count 38
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1182 place count 27 transition count 38
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 1186 place count 27 transition count 34
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1194 place count 23 transition count 30
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 12 with 2 rules applied. Total rules applied 1196 place count 22 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1197 place count 22 transition count 28
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1201 place count 22 transition count 24
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 11 rules applied. Total rules applied 1212 place count 15 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1213 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1215 place count 14 transition count 18
Applied a total of 1215 rules in 532 ms. Remains 14 /612 variables (removed 598) and now considering 18/803 (removed 785) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/612 places, 18/803 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=10 )
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(p1)))'
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 803/803 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 599 transition count 790
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 599 transition count 790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 599 transition count 789
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 590 transition count 780
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 590 transition count 780
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 52 place count 590 transition count 773
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 588 transition count 771
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 588 transition count 771
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 588 transition count 769
Applied a total of 58 rules in 102 ms. Remains 588 /612 variables (removed 24) and now considering 769/803 (removed 34) transitions.
// Phase 1: matrix 769 rows 588 cols
[2022-05-15 14:51:31] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:51:31] [INFO ] Implicit Places using invariants in 545 ms returned []
// Phase 1: matrix 769 rows 588 cols
[2022-05-15 14:51:31] [INFO ] Computed 14 place invariants in 10 ms
[2022-05-15 14:51:33] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1629 ms to find 0 implicit places.
// Phase 1: matrix 769 rows 588 cols
[2022-05-15 14:51:33] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-15 14:51:33] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 769/803 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/612 places, 769/803 transitions.
Stuttering acceptance computed with spot in 441 ms :[p1, p1, true]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s180 1), p1:(EQ s425 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1358 ms.
Product exploration explored 100000 steps with 50000 reset in 1007 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-12b-LTLCardinality-01 finished in 5493 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X(G(X(p0))))&&p0))))'
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 803/803 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 599 transition count 790
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 599 transition count 790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 599 transition count 789
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 591 transition count 781
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 591 transition count 781
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 591 transition count 775
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 589 transition count 773
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 589 transition count 773
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 589 transition count 771
Applied a total of 55 rules in 65 ms. Remains 589 /612 variables (removed 23) and now considering 771/803 (removed 32) transitions.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:51:36] [INFO ] Computed 14 place invariants in 11 ms
[2022-05-15 14:51:37] [INFO ] Implicit Places using invariants in 346 ms returned []
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:51:37] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-15 14:51:37] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:51:37] [INFO ] Computed 14 place invariants in 10 ms
[2022-05-15 14:51:38] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 589/612 places, 771/803 transitions.
Finished structural reductions, in 1 iterations. Remains : 589/612 places, 771/803 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-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:(OR (EQ s53 0) (EQ s542 1))], 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]]
Product exploration explored 100000 steps with 1130 reset in 339 ms.
Product exploration explored 100000 steps with 1119 reset in 739 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468146 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 468146 steps, saw 137146 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:51:43] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:51:43] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:51:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-15 14:51:43] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 14:51:43] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-15 14:51:43] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 589 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 589/589 places, 771/771 transitions.
Graph (trivial) has 549 edges and 589 vertex of which 73 / 589 are part of one of the 12 SCC in 2 ms
Free SCC test removed 61 places
Drop transitions removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 528 transition count 640
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 471 transition count 640
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 115 place count 471 transition count 614
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 167 place count 445 transition count 614
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 190 place count 422 transition count 591
Iterating global reduction 2 with 23 rules applied. Total rules applied 213 place count 422 transition count 591
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 421 transition count 590
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 421 transition count 590
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 367 place count 345 transition count 514
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 391 place count 345 transition count 490
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 403 place count 333 transition count 478
Iterating global reduction 3 with 12 rules applied. Total rules applied 415 place count 333 transition count 478
Free-agglomeration rule applied 268 times.
Iterating global reduction 3 with 268 rules applied. Total rules applied 683 place count 333 transition count 210
Reduce places removed 268 places and 0 transitions.
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Graph (complete) has 178 edges and 65 vertex of which 20 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 390 rules applied. Total rules applied 1073 place count 20 transition count 89
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1136 place count 20 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1137 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 15 edges and 18 vertex of which 6 / 18 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 1139 place count 15 transition count 25
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1145 place count 15 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 1145 place count 15 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1151 place count 12 transition count 16
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1154 place count 12 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1160 place count 9 transition count 10
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1163 place count 9 transition count 7
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1171 place count 4 transition count 4
Applied a total of 1171 rules in 138 ms. Remains 4 /589 variables (removed 585) and now considering 4/771 (removed 767) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/589 places, 4/771 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 771/771 transitions.
Applied a total of 0 rules in 10 ms. Remains 589 /589 variables (removed 0) and now considering 771/771 (removed 0) transitions.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:51:44] [INFO ] Computed 14 place invariants in 10 ms
[2022-05-15 14:51:44] [INFO ] Implicit Places using invariants in 469 ms returned []
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:51:44] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:51:45] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1348 ms to find 0 implicit places.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:51:45] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:51:46] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 589/589 places, 771/771 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 581377 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 581377 steps, saw 154730 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 771 rows 589 cols
[2022-05-15 14:51:49] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:51:50] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:51:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2022-05-15 14:51:50] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 14:51:50] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-15 14:51:50] [INFO ] After 825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 589 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 589/589 places, 771/771 transitions.
Graph (trivial) has 549 edges and 589 vertex of which 73 / 589 are part of one of the 12 SCC in 2 ms
Free SCC test removed 61 places
Drop transitions removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 528 transition count 640
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 471 transition count 640
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 115 place count 471 transition count 614
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 167 place count 445 transition count 614
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 190 place count 422 transition count 591
Iterating global reduction 2 with 23 rules applied. Total rules applied 213 place count 422 transition count 591
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 421 transition count 590
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 421 transition count 590
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 367 place count 345 transition count 514
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 391 place count 345 transition count 490
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 403 place count 333 transition count 478
Iterating global reduction 3 with 12 rules applied. Total rules applied 415 place count 333 transition count 478
Free-agglomeration rule applied 268 times.
Iterating global reduction 3 with 268 rules applied. Total rules applied 683 place count 333 transition count 210
Reduce places removed 268 places and 0 transitions.
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Graph (complete) has 178 edges and 65 vertex of which 20 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 390 rules applied. Total rules applied 1073 place count 20 transition count 89
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1136 place count 20 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1137 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 15 edges and 18 vertex of which 6 / 18 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 1139 place count 15 transition count 25
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1145 place count 15 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 1145 place count 15 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1151 place count 12 transition count 16
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1154 place count 12 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1160 place count 9 transition count 10
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1163 place count 9 transition count 7
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1171 place count 4 transition count 4
Applied a total of 1171 rules in 119 ms. Remains 4 /589 variables (removed 585) and now considering 4/771 (removed 767) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/589 places, 4/771 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 66934 steps with 755 reset in 171 ms.
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLCardinality-02 finished in 14959 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F(p1))))'
Support contains 3 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 803/803 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 598 transition count 789
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 598 transition count 789
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 598 transition count 788
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 589 transition count 779
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 589 transition count 779
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 54 place count 589 transition count 772
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 587 transition count 770
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 587 transition count 770
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 587 transition count 768
Applied a total of 60 rules in 72 ms. Remains 587 /612 variables (removed 25) and now considering 768/803 (removed 35) transitions.
// Phase 1: matrix 768 rows 587 cols
[2022-05-15 14:51:51] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:51:52] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 768 rows 587 cols
[2022-05-15 14:51:52] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:51:53] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
// Phase 1: matrix 768 rows 587 cols
[2022-05-15 14:51:53] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:51:53] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 587/612 places, 768/803 transitions.
Finished structural reductions, in 1 iterations. Remains : 587/612 places, 768/803 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s535 1), p0:(OR (EQ s81 0) (EQ s476 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 480 ms.
Product exploration explored 100000 steps with 33333 reset in 485 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-12b-LTLCardinality-03 finished in 3252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(F((G(p0)&&(G(p1)||p1))))))))'
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 803/803 transitions.
Graph (trivial) has 569 edges and 612 vertex of which 73 / 612 are part of one of the 12 SCC in 2 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 550 transition count 679
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 489 transition count 679
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 123 place count 489 transition count 652
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 177 place count 462 transition count 652
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 209 place count 430 transition count 620
Iterating global reduction 2 with 32 rules applied. Total rules applied 241 place count 430 transition count 620
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 248 place count 423 transition count 613
Iterating global reduction 2 with 7 rules applied. Total rules applied 255 place count 423 transition count 613
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 261 place count 423 transition count 607
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 405 place count 351 transition count 535
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 408 place count 348 transition count 532
Iterating global reduction 3 with 3 rules applied. Total rules applied 411 place count 348 transition count 532
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 414 place count 348 transition count 529
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 426 place count 348 transition count 517
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 428 place count 348 transition count 517
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 430 place count 346 transition count 515
Applied a total of 430 rules in 251 ms. Remains 346 /612 variables (removed 266) and now considering 515/803 (removed 288) transitions.
[2022-05-15 14:51:55] [INFO ] Flow matrix only has 493 transitions (discarded 22 similar events)
// Phase 1: matrix 493 rows 346 cols
[2022-05-15 14:51:55] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:51:55] [INFO ] Implicit Places using invariants in 252 ms returned []
[2022-05-15 14:51:55] [INFO ] Flow matrix only has 493 transitions (discarded 22 similar events)
// Phase 1: matrix 493 rows 346 cols
[2022-05-15 14:51:55] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:51:55] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2022-05-15 14:51:55] [INFO ] Redundant transitions in 40 ms returned []
[2022-05-15 14:51:55] [INFO ] Flow matrix only has 493 transitions (discarded 22 similar events)
// Phase 1: matrix 493 rows 346 cols
[2022-05-15 14:51:56] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-15 14:51:56] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 346/612 places, 515/803 transitions.
Finished structural reductions, in 1 iterations. Remains : 346/612 places, 515/803 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s128 0) (EQ s142 1)), p0:(AND (EQ s213 0) (EQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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-12b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLCardinality-10 finished in 1504 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 803/803 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 599 transition count 790
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 599 transition count 790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 599 transition count 789
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 590 transition count 780
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 590 transition count 780
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 52 place count 590 transition count 773
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 588 transition count 771
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 588 transition count 771
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 588 transition count 769
Applied a total of 58 rules in 130 ms. Remains 588 /612 variables (removed 24) and now considering 769/803 (removed 34) transitions.
// Phase 1: matrix 769 rows 588 cols
[2022-05-15 14:51:56] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:51:56] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 769 rows 588 cols
[2022-05-15 14:51:56] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:51:57] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
// Phase 1: matrix 769 rows 588 cols
[2022-05-15 14:51:57] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-15 14:51:58] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 769/803 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/612 places, 769/803 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLCardinality-13 automaton TGBA Formula[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:(OR (EQ s214 0) (EQ s489 1))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 54157 steps with 607 reset in 176 ms.
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLCardinality-13 finished in 2333 ms.
All properties solved by simple procedures.
Total runtime 36841 ms.
BK_STOP 1652626318882
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-12b, 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 r096-smll-165260575700075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b 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 ;