About the Execution of ITS-Tools for FlexibleBarrier-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 344.684 | 70143.00 | 100461.00 | 485.80 | FFTFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r102-smll-162075331000045.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331000045
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 125K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 19:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 19:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 241K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-08b-00
FORMULA_NAME FlexibleBarrier-PT-08b-01
FORMULA_NAME FlexibleBarrier-PT-08b-02
FORMULA_NAME FlexibleBarrier-PT-08b-03
FORMULA_NAME FlexibleBarrier-PT-08b-04
FORMULA_NAME FlexibleBarrier-PT-08b-05
FORMULA_NAME FlexibleBarrier-PT-08b-06
FORMULA_NAME FlexibleBarrier-PT-08b-07
FORMULA_NAME FlexibleBarrier-PT-08b-08
FORMULA_NAME FlexibleBarrier-PT-08b-09
FORMULA_NAME FlexibleBarrier-PT-08b-10
FORMULA_NAME FlexibleBarrier-PT-08b-11
FORMULA_NAME FlexibleBarrier-PT-08b-12
FORMULA_NAME FlexibleBarrier-PT-08b-13
FORMULA_NAME FlexibleBarrier-PT-08b-14
FORMULA_NAME FlexibleBarrier-PT-08b-15
=== Now, execution of the tool begins
BK_START 1621124450541
Running Version 0
[2021-05-16 00:20:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 00:20:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 00:20:53] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2021-05-16 00:20:53] [INFO ] Transformed 920 places.
[2021-05-16 00:20:53] [INFO ] Transformed 1057 transitions.
[2021-05-16 00:20:53] [INFO ] Found NUPN structural information;
[2021-05-16 00:20:53] [INFO ] Parsed PT model containing 920 places and 1057 transitions in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 00:20:53] [INFO ] Initial state test concluded for 3 properties.
Support contains 39 out of 920 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 331 places :
Symmetric choice reduction at 0 with 331 rule applications. Total rules 331 place count 589 transition count 726
Iterating global reduction 0 with 331 rules applied. Total rules applied 662 place count 589 transition count 726
Discarding 139 places :
Symmetric choice reduction at 0 with 139 rule applications. Total rules 801 place count 450 transition count 587
Iterating global reduction 0 with 139 rules applied. Total rules applied 940 place count 450 transition count 587
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 1020 place count 370 transition count 507
Iterating global reduction 0 with 80 rules applied. Total rules applied 1100 place count 370 transition count 507
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 1135 place count 370 transition count 472
Applied a total of 1135 rules in 250 ms. Remains 370 /920 variables (removed 550) and now considering 472/1057 (removed 585) transitions.
// Phase 1: matrix 472 rows 370 cols
[2021-05-16 00:20:54] [INFO ] Computed 10 place invariants in 34 ms
[2021-05-16 00:20:54] [INFO ] Implicit Places using invariants in 590 ms returned []
// Phase 1: matrix 472 rows 370 cols
[2021-05-16 00:20:54] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-16 00:20:55] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 370 cols
[2021-05-16 00:20:55] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-16 00:20:55] [INFO ] Dead Transitions using invariants and state equation in 496 ms returned []
Finished structural reductions, in 1 iterations. Remains : 370/920 places, 472/1057 transitions.
[2021-05-16 00:20:56] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 00:20:56] [INFO ] Flatten gal took : 146 ms
FORMULA FlexibleBarrier-PT-08b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 00:20:56] [INFO ] Flatten gal took : 67 ms
[2021-05-16 00:20:56] [INFO ] Input system was already deterministic with 472 transitions.
Incomplete random walk after 100000 steps, including 1546 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 28) seen :20
Running SMT prover for 8 properties.
// Phase 1: matrix 472 rows 370 cols
[2021-05-16 00:20:56] [INFO ] Computed 10 place invariants in 16 ms
[2021-05-16 00:20:57] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-16 00:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:20:57] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2021-05-16 00:20:57] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 6 ms to minimize.
[2021-05-16 00:20:57] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 1 ms to minimize.
[2021-05-16 00:20:57] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 2 ms to minimize.
[2021-05-16 00:20:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 637 ms
[2021-05-16 00:20:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:20:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-16 00:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:20:58] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2021-05-16 00:20:58] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 1 ms to minimize.
[2021-05-16 00:20:58] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2021-05-16 00:20:58] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
[2021-05-16 00:20:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 488 ms
[2021-05-16 00:20:58] [INFO ] Computed and/alt/rep : 465/824/465 causal constraints (skipped 6 transitions) in 58 ms.
[2021-05-16 00:21:03] [INFO ] Added : 464 causal constraints over 93 iterations in 5043 ms. Result :sat
[2021-05-16 00:21:03] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-16 00:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:04] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2021-05-16 00:21:04] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 1 ms to minimize.
[2021-05-16 00:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2021-05-16 00:21:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:21:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-16 00:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:04] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2021-05-16 00:21:04] [INFO ] Deduced a trap composed of 106 places in 191 ms of which 2 ms to minimize.
[2021-05-16 00:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2021-05-16 00:21:05] [INFO ] Computed and/alt/rep : 465/824/465 causal constraints (skipped 6 transitions) in 52 ms.
[2021-05-16 00:21:08] [INFO ] Added : 458 causal constraints over 92 iterations in 3940 ms. Result :sat
[2021-05-16 00:21:08] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-16 00:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:09] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2021-05-16 00:21:09] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
[2021-05-16 00:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2021-05-16 00:21:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:21:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-16 00:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:09] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2021-05-16 00:21:09] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 1 ms to minimize.
[2021-05-16 00:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2021-05-16 00:21:09] [INFO ] Computed and/alt/rep : 465/824/465 causal constraints (skipped 6 transitions) in 32 ms.
[2021-05-16 00:21:13] [INFO ] Added : 465 causal constraints over 93 iterations in 4035 ms. Result :sat
[2021-05-16 00:21:13] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-16 00:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:14] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-16 00:21:14] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2021-05-16 00:21:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2021-05-16 00:21:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:21:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 26 ms returned sat
[2021-05-16 00:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:14] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2021-05-16 00:21:14] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2021-05-16 00:21:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2021-05-16 00:21:14] [INFO ] Computed and/alt/rep : 465/824/465 causal constraints (skipped 6 transitions) in 32 ms.
[2021-05-16 00:21:19] [INFO ] Added : 465 causal constraints over 93 iterations in 4792 ms. Result :sat
[2021-05-16 00:21:19] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-16 00:21:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:19] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2021-05-16 00:21:19] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 1 ms to minimize.
[2021-05-16 00:21:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2021-05-16 00:21:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:21:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2021-05-16 00:21:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:20] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2021-05-16 00:21:20] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 2 ms to minimize.
[2021-05-16 00:21:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2021-05-16 00:21:20] [INFO ] Computed and/alt/rep : 465/824/465 causal constraints (skipped 6 transitions) in 38 ms.
[2021-05-16 00:21:24] [INFO ] Added : 465 causal constraints over 93 iterations in 4303 ms. Result :sat
[2021-05-16 00:21:24] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-16 00:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:25] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2021-05-16 00:21:25] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 1 ms to minimize.
[2021-05-16 00:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2021-05-16 00:21:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:21:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-16 00:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:25] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2021-05-16 00:21:25] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 0 ms to minimize.
[2021-05-16 00:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2021-05-16 00:21:25] [INFO ] Computed and/alt/rep : 465/824/465 causal constraints (skipped 6 transitions) in 39 ms.
[2021-05-16 00:21:31] [INFO ] Added : 463 causal constraints over 93 iterations in 5250 ms. Result :sat
[2021-05-16 00:21:31] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-16 00:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:31] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-16 00:21:31] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2021-05-16 00:21:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2021-05-16 00:21:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:21:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2021-05-16 00:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:31] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2021-05-16 00:21:31] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2021-05-16 00:21:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2021-05-16 00:21:31] [INFO ] Computed and/alt/rep : 465/824/465 causal constraints (skipped 6 transitions) in 49 ms.
[2021-05-16 00:21:37] [INFO ] Added : 455 causal constraints over 91 iterations in 5759 ms. Result :sat
[2021-05-16 00:21:37] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-16 00:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:37] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-16 00:21:38] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 1 ms to minimize.
[2021-05-16 00:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2021-05-16 00:21:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 00:21:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2021-05-16 00:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 00:21:38] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2021-05-16 00:21:38] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 0 ms to minimize.
[2021-05-16 00:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2021-05-16 00:21:38] [INFO ] Computed and/alt/rep : 465/824/465 causal constraints (skipped 6 transitions) in 28 ms.
[2021-05-16 00:21:42] [INFO ] Added : 465 causal constraints over 93 iterations in 3629 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 350 transition count 452
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 350 transition count 452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 350 transition count 450
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 335 transition count 435
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 335 transition count 435
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 79 place count 335 transition count 428
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 331 transition count 424
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 331 transition count 424
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 331 transition count 420
Applied a total of 91 rules in 57 ms. Remains 331 /370 variables (removed 39) and now considering 420/472 (removed 52) transitions.
// Phase 1: matrix 420 rows 331 cols
[2021-05-16 00:21:42] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:42] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 420 rows 331 cols
[2021-05-16 00:21:42] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-16 00:21:42] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
// Phase 1: matrix 420 rows 331 cols
[2021-05-16 00:21:42] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-16 00:21:43] [INFO ] Dead Transitions using invariants and state equation in 260 ms returned []
Finished structural reductions, in 1 iterations. Remains : 331/370 places, 420/472 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FlexibleBarrier-PT-08b-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(NEQ s178 1), p1:(NEQ s104 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 70297 steps with 1073 reset in 289 ms.
FORMULA FlexibleBarrier-PT-08b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-00 finished in 1449 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G((p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Graph (trivial) has 336 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 5 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 328 transition count 390
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 289 transition count 390
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 79 place count 289 transition count 368
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 123 place count 267 transition count 368
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 157 place count 233 transition count 334
Iterating global reduction 2 with 34 rules applied. Total rules applied 191 place count 233 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 192 place count 233 transition count 333
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 203 place count 222 transition count 322
Iterating global reduction 3 with 11 rules applied. Total rules applied 214 place count 222 transition count 322
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 224 place count 222 transition count 312
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 322 place count 173 transition count 263
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 323 place count 172 transition count 262
Iterating global reduction 4 with 1 rules applied. Total rules applied 324 place count 172 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 325 place count 172 transition count 261
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 333 place count 172 transition count 253
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 334 place count 172 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 335 place count 171 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 336 place count 170 transition count 251
Applied a total of 336 rules in 240 ms. Remains 170 /370 variables (removed 200) and now considering 251/472 (removed 221) transitions.
[2021-05-16 00:21:43] [INFO ] Flow matrix only has 237 transitions (discarded 14 similar events)
// Phase 1: matrix 237 rows 170 cols
[2021-05-16 00:21:43] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:44] [INFO ] Implicit Places using invariants in 182 ms returned []
[2021-05-16 00:21:44] [INFO ] Flow matrix only has 237 transitions (discarded 14 similar events)
// Phase 1: matrix 237 rows 170 cols
[2021-05-16 00:21:44] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:21:44] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2021-05-16 00:21:44] [INFO ] Redundant transitions in 24 ms returned []
[2021-05-16 00:21:44] [INFO ] Flow matrix only has 237 transitions (discarded 14 similar events)
// Phase 1: matrix 237 rows 170 cols
[2021-05-16 00:21:44] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 00:21:44] [INFO ] Dead Transitions using invariants and state equation in 228 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/370 places, 251/472 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-08b-01 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s6 0) (EQ s101 0) (EQ s123 0)) (EQ s15 1)), p2:(AND (EQ s6 1) (EQ s101 1) (EQ s123 1)), p1:(AND (EQ s97 1) (EQ s169 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-01 finished in 1235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((((p0 U p1) U p2) U (p1 U p3))||G(F(p4))))], workingDir=/home/mcc/execution]
Support contains 7 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Graph (trivial) has 289 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 328 transition count 389
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 288 transition count 389
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 81 place count 288 transition count 368
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 123 place count 267 transition count 368
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 156 place count 234 transition count 335
Iterating global reduction 2 with 33 rules applied. Total rules applied 189 place count 234 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 191 place count 234 transition count 333
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 201 place count 224 transition count 323
Iterating global reduction 3 with 10 rules applied. Total rules applied 211 place count 224 transition count 323
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 219 place count 224 transition count 315
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 319 place count 174 transition count 265
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 320 place count 173 transition count 264
Iterating global reduction 4 with 1 rules applied. Total rules applied 321 place count 173 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 322 place count 173 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 323 place count 172 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 324 place count 171 transition count 261
Applied a total of 324 rules in 141 ms. Remains 171 /370 variables (removed 199) and now considering 261/472 (removed 211) transitions.
[2021-05-16 00:21:45] [INFO ] Flow matrix only has 239 transitions (discarded 22 similar events)
// Phase 1: matrix 239 rows 171 cols
[2021-05-16 00:21:45] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:45] [INFO ] Implicit Places using invariants in 171 ms returned []
[2021-05-16 00:21:45] [INFO ] Flow matrix only has 239 transitions (discarded 22 similar events)
// Phase 1: matrix 239 rows 171 cols
[2021-05-16 00:21:45] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:21:45] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2021-05-16 00:21:45] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-16 00:21:45] [INFO ] Flow matrix only has 239 transitions (discarded 22 similar events)
// Phase 1: matrix 239 rows 171 cols
[2021-05-16 00:21:45] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:45] [INFO ] Dead Transitions using invariants and state equation in 252 ms returned []
Finished structural reductions, in 1 iterations. Remains : 171/370 places, 261/472 transitions.
Stuttering acceptance computed with spot in 459 ms :[(AND (NOT p3) (NOT p4)), (NOT p4), (NOT p4), (AND (NOT p1) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : FlexibleBarrier-PT-08b-03 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p2) (AND (NOT p3) p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0) (NOT p4)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p3) p1 (NOT p4)) (AND (NOT p3) p2 (NOT p4)) (AND (NOT p3) p0 (NOT p4))), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0 (NOT p4)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0 (NOT p4)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p4), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p4), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p4)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p4)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p2) p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p4)), acceptance={} source=4 dest: 6}, { cond=(OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p2) p0 (NOT p4))), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0) (NOT p4)), acceptance={0} source=5 dest: 1}, { cond=(OR (AND (NOT p3) p1 (NOT p4)) (AND (NOT p3) p2 (NOT p4)) (AND (NOT p3) p0 (NOT p4))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0 (NOT p4)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0 (NOT p4)), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p4)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p4)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p4)), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p2) p0 (NOT p4))), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(EQ s43 1), p1:(EQ s168 1), p2:(EQ s44 1), p0:(AND (EQ s30 1) (EQ s57 1) (EQ s133 1)), p4:(EQ s74 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-03 finished in 1422 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&(p1 U X((G(p2) U p3)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 352 transition count 454
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 352 transition count 454
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 352 transition count 452
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 338 transition count 438
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 338 transition count 438
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 73 place count 338 transition count 431
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 334 transition count 427
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 334 transition count 427
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 85 place count 334 transition count 423
Applied a total of 85 rules in 43 ms. Remains 334 /370 variables (removed 36) and now considering 423/472 (removed 49) transitions.
// Phase 1: matrix 423 rows 334 cols
[2021-05-16 00:21:46] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-16 00:21:46] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 423 rows 334 cols
[2021-05-16 00:21:46] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:46] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 334 cols
[2021-05-16 00:21:46] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:47] [INFO ] Dead Transitions using invariants and state equation in 394 ms returned []
Finished structural reductions, in 1 iterations. Remains : 334/370 places, 423/472 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p3) (NOT p0)), (NOT p0), (NOT p3), (NOT p3), true, (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-08b-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s287 0), p0:(EQ s148 1), p3:(EQ s287 1), p2:(OR (NEQ s148 1) (NEQ s272 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-04 finished in 1313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U (p1||(G(p3)&&p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 352 transition count 454
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 352 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 352 transition count 453
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 338 transition count 439
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 338 transition count 439
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 73 place count 338 transition count 431
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 335 transition count 428
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 335 transition count 428
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 335 transition count 425
Applied a total of 82 rules in 35 ms. Remains 335 /370 variables (removed 35) and now considering 425/472 (removed 47) transitions.
// Phase 1: matrix 425 rows 335 cols
[2021-05-16 00:21:47] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:47] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 425 rows 335 cols
[2021-05-16 00:21:47] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-16 00:21:48] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
// Phase 1: matrix 425 rows 335 cols
[2021-05-16 00:21:48] [INFO ] Computed 10 place invariants in 8 ms
[2021-05-16 00:21:48] [INFO ] Dead Transitions using invariants and state equation in 451 ms returned []
Finished structural reductions, in 1 iterations. Remains : 335/370 places, 425/472 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-08b-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 (AND p2 p3) p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) (NOT p3) p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) (NOT p3) p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p3 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s329 1), p2:(AND (EQ s136 1) (EQ s105 1) (EQ s247 1) (EQ s323 1)), p3:(EQ s178 1), p0:(AND (EQ s105 1) (EQ s247 1) (EQ s323 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-05 finished in 1541 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 350 transition count 452
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 350 transition count 452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 350 transition count 450
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 335 transition count 435
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 335 transition count 435
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 80 place count 335 transition count 427
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 331 transition count 423
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 331 transition count 423
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 331 transition count 419
Applied a total of 92 rules in 30 ms. Remains 331 /370 variables (removed 39) and now considering 419/472 (removed 53) transitions.
// Phase 1: matrix 419 rows 331 cols
[2021-05-16 00:21:49] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:49] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 419 rows 331 cols
[2021-05-16 00:21:49] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:49] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
// Phase 1: matrix 419 rows 331 cols
[2021-05-16 00:21:49] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-16 00:21:50] [INFO ] Dead Transitions using invariants and state equation in 388 ms returned []
Finished structural reductions, in 1 iterations. Remains : 331/370 places, 419/472 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s319 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-06 finished in 1261 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X((F(G(p0)) U p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 351 transition count 453
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 351 transition count 453
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 351 transition count 451
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 337 transition count 437
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 337 transition count 437
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 74 place count 337 transition count 431
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 333 transition count 427
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 333 transition count 427
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 333 transition count 423
Applied a total of 86 rules in 34 ms. Remains 333 /370 variables (removed 37) and now considering 423/472 (removed 49) transitions.
// Phase 1: matrix 423 rows 333 cols
[2021-05-16 00:21:50] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-16 00:21:50] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 423 rows 333 cols
[2021-05-16 00:21:50] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:51] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
// Phase 1: matrix 423 rows 333 cols
[2021-05-16 00:21:51] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:51] [INFO ] Dead Transitions using invariants and state equation in 355 ms returned []
Finished structural reductions, in 1 iterations. Remains : 333/370 places, 423/472 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s279 1), p1:(EQ s313 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-07 finished in 1280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 350 transition count 452
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 350 transition count 452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 350 transition count 450
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 335 transition count 435
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 335 transition count 435
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 79 place count 335 transition count 428
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 331 transition count 424
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 331 transition count 424
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 331 transition count 420
Applied a total of 91 rules in 38 ms. Remains 331 /370 variables (removed 39) and now considering 420/472 (removed 52) transitions.
// Phase 1: matrix 420 rows 331 cols
[2021-05-16 00:21:51] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:51] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 420 rows 331 cols
[2021-05-16 00:21:51] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:52] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
// Phase 1: matrix 420 rows 331 cols
[2021-05-16 00:21:52] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:52] [INFO ] Dead Transitions using invariants and state equation in 323 ms returned []
Finished structural reductions, in 1 iterations. Remains : 331/370 places, 420/472 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s304 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-08 finished in 1228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 349 transition count 451
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 349 transition count 451
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 349 transition count 449
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 333 transition count 433
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 333 transition count 433
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 84 place count 333 transition count 425
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 329 transition count 421
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 329 transition count 421
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 96 place count 329 transition count 417
Applied a total of 96 rules in 33 ms. Remains 329 /370 variables (removed 41) and now considering 417/472 (removed 55) transitions.
// Phase 1: matrix 417 rows 329 cols
[2021-05-16 00:21:52] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:53] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 417 rows 329 cols
[2021-05-16 00:21:53] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:53] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
// Phase 1: matrix 417 rows 329 cols
[2021-05-16 00:21:53] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:54] [INFO ] Dead Transitions using invariants and state equation in 474 ms returned []
Finished structural reductions, in 1 iterations. Remains : 329/370 places, 417/472 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s70 1) (EQ s323 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-09 finished in 1444 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U p1))], workingDir=/home/mcc/execution]
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Graph (trivial) has 340 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 328 transition count 391
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 290 transition count 391
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 77 place count 290 transition count 369
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 121 place count 268 transition count 369
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 155 place count 234 transition count 335
Iterating global reduction 2 with 34 rules applied. Total rules applied 189 place count 234 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 191 place count 234 transition count 333
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 202 place count 223 transition count 322
Iterating global reduction 3 with 11 rules applied. Total rules applied 213 place count 223 transition count 322
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 222 place count 223 transition count 313
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 322 place count 173 transition count 263
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 323 place count 172 transition count 262
Iterating global reduction 4 with 1 rules applied. Total rules applied 324 place count 172 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 325 place count 172 transition count 261
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 333 place count 172 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 334 place count 171 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 335 place count 170 transition count 251
Applied a total of 335 rules in 124 ms. Remains 170 /370 variables (removed 200) and now considering 251/472 (removed 221) transitions.
[2021-05-16 00:21:54] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
// Phase 1: matrix 236 rows 170 cols
[2021-05-16 00:21:54] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 00:21:54] [INFO ] Implicit Places using invariants in 246 ms returned []
[2021-05-16 00:21:54] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
// Phase 1: matrix 236 rows 170 cols
[2021-05-16 00:21:54] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 00:21:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:21:55] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2021-05-16 00:21:55] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-16 00:21:55] [INFO ] Flow matrix only has 236 transitions (discarded 15 similar events)
// Phase 1: matrix 236 rows 170 cols
[2021-05-16 00:21:55] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:55] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/370 places, 251/472 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s58 1), p0:(EQ s28 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-10 finished in 1121 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 350 transition count 452
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 350 transition count 452
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 350 transition count 451
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 334 transition count 435
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 334 transition count 435
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 334 transition count 427
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 330 transition count 423
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 330 transition count 423
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 330 transition count 419
Applied a total of 93 rules in 29 ms. Remains 330 /370 variables (removed 40) and now considering 419/472 (removed 53) transitions.
// Phase 1: matrix 419 rows 330 cols
[2021-05-16 00:21:55] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:55] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 419 rows 330 cols
[2021-05-16 00:21:55] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:56] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
// Phase 1: matrix 419 rows 330 cols
[2021-05-16 00:21:56] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 00:21:56] [INFO ] Dead Transitions using invariants and state equation in 446 ms returned []
Finished structural reductions, in 1 iterations. Remains : 330/370 places, 419/472 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s105 1) (EQ s244 1) (EQ s319 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-11 finished in 1214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Graph (trivial) has 341 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 328 transition count 389
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 288 transition count 389
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 81 place count 288 transition count 365
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 129 place count 264 transition count 365
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 165 place count 228 transition count 329
Iterating global reduction 2 with 36 rules applied. Total rules applied 201 place count 228 transition count 329
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 228 transition count 327
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 213 place count 218 transition count 317
Iterating global reduction 3 with 10 rules applied. Total rules applied 223 place count 218 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 233 place count 218 transition count 307
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 333 place count 168 transition count 257
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 334 place count 167 transition count 256
Iterating global reduction 4 with 1 rules applied. Total rules applied 335 place count 167 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 336 place count 167 transition count 255
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 344 place count 167 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 345 place count 166 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 346 place count 165 transition count 245
Applied a total of 346 rules in 99 ms. Remains 165 /370 variables (removed 205) and now considering 245/472 (removed 227) transitions.
[2021-05-16 00:21:56] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
// Phase 1: matrix 230 rows 165 cols
[2021-05-16 00:21:56] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-16 00:21:57] [INFO ] Implicit Places using invariants in 275 ms returned []
[2021-05-16 00:21:57] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
// Phase 1: matrix 230 rows 165 cols
[2021-05-16 00:21:57] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:21:57] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2021-05-16 00:21:57] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-16 00:21:57] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
// Phase 1: matrix 230 rows 165 cols
[2021-05-16 00:21:57] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-16 00:21:57] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
Finished structural reductions, in 1 iterations. Remains : 165/370 places, 245/472 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s32 1) (EQ s69 1) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-12 finished in 940 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Graph (trivial) has 341 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 328 transition count 389
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 288 transition count 389
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 81 place count 288 transition count 367
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 125 place count 266 transition count 367
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 160 place count 231 transition count 332
Iterating global reduction 2 with 35 rules applied. Total rules applied 195 place count 231 transition count 332
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 197 place count 231 transition count 330
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 208 place count 220 transition count 319
Iterating global reduction 3 with 11 rules applied. Total rules applied 219 place count 220 transition count 319
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 229 place count 220 transition count 309
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 329 place count 170 transition count 259
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 330 place count 169 transition count 258
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 169 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 332 place count 169 transition count 257
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 340 place count 169 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 341 place count 168 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 342 place count 167 transition count 247
Applied a total of 342 rules in 81 ms. Remains 167 /370 variables (removed 203) and now considering 247/472 (removed 225) transitions.
[2021-05-16 00:21:57] [INFO ] Flow matrix only has 233 transitions (discarded 14 similar events)
// Phase 1: matrix 233 rows 167 cols
[2021-05-16 00:21:57] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:58] [INFO ] Implicit Places using invariants in 336 ms returned []
[2021-05-16 00:21:58] [INFO ] Flow matrix only has 233 transitions (discarded 14 similar events)
// Phase 1: matrix 233 rows 167 cols
[2021-05-16 00:21:58] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:21:58] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2021-05-16 00:21:58] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-16 00:21:58] [INFO ] Flow matrix only has 233 transitions (discarded 14 similar events)
// Phase 1: matrix 233 rows 167 cols
[2021-05-16 00:21:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 00:21:58] [INFO ] Dead Transitions using invariants and state equation in 245 ms returned []
Finished structural reductions, in 1 iterations. Remains : 167/370 places, 247/472 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-08b-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s166 1)), p0:(EQ s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-14 finished in 1121 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 472/472 transitions.
Graph (trivial) has 342 edges and 370 vertex of which 49 / 370 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 328 transition count 391
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 290 transition count 390
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 289 transition count 390
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 79 place count 289 transition count 366
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 127 place count 265 transition count 366
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 163 place count 229 transition count 330
Iterating global reduction 3 with 36 rules applied. Total rules applied 199 place count 229 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 201 place count 229 transition count 328
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 212 place count 218 transition count 317
Iterating global reduction 4 with 11 rules applied. Total rules applied 223 place count 218 transition count 317
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 234 place count 218 transition count 306
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 334 place count 168 transition count 256
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 335 place count 167 transition count 255
Iterating global reduction 5 with 1 rules applied. Total rules applied 336 place count 167 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 337 place count 167 transition count 254
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 345 place count 167 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 346 place count 166 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 165 transition count 244
Applied a total of 347 rules in 123 ms. Remains 165 /370 variables (removed 205) and now considering 244/472 (removed 228) transitions.
[2021-05-16 00:21:58] [INFO ] Flow matrix only has 229 transitions (discarded 15 similar events)
// Phase 1: matrix 229 rows 165 cols
[2021-05-16 00:21:58] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:59] [INFO ] Implicit Places using invariants in 173 ms returned []
[2021-05-16 00:21:59] [INFO ] Flow matrix only has 229 transitions (discarded 15 similar events)
// Phase 1: matrix 229 rows 165 cols
[2021-05-16 00:21:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 00:21:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 00:21:59] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2021-05-16 00:21:59] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-16 00:21:59] [INFO ] Flow matrix only has 229 transitions (discarded 15 similar events)
// Phase 1: matrix 229 rows 165 cols
[2021-05-16 00:21:59] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 00:21:59] [INFO ] Dead Transitions using invariants and state equation in 202 ms returned []
Finished structural reductions, in 1 iterations. Remains : 165/370 places, 244/472 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s111 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-15 finished in 872 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621124520684
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-08b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-08b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r102-smll-162075331000045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-08b.tgz
mv FlexibleBarrier-PT-08b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;