Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694600394.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BugTracking-PT-q8m004, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694600394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Feb 26 07:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 07:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-00
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-01
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-02
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-03
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-04
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-05
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-06
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-07
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-08
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-09
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-10
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-11
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-12
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-13
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-14
FORMULA_NAME BugTracking-PT-q8m004-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678633610149

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:06:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 15:06:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:06:54] [INFO ] Load time of PNML (sax parser for PT used): 1207 ms
[2023-03-12 15:06:54] [INFO ] Transformed 754 places.
[2023-03-12 15:06:54] [INFO ] Transformed 27370 transitions.
[2023-03-12 15:06:54] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1520 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Deduced a syphon composed of 474 places in 155 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m004-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 144 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-12 15:06:55] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 15:06:55] [INFO ] Computed 8 place invariants in 79 ms
[2023-03-12 15:06:56] [INFO ] Implicit Places using invariants in 906 ms returned []
[2023-03-12 15:06:56] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:06:56] [INFO ] Invariant cache hit.
[2023-03-12 15:06:56] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:06:57] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 2253 ms to find 0 implicit places.
[2023-03-12 15:06:57] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:06:57] [INFO ] Invariant cache hit.
[2023-03-12 15:06:59] [INFO ] Dead Transitions using invariants and state equation in 2203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4606 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 24 out of 277 places after structural reductions.
[2023-03-12 15:07:00] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-12 15:07:00] [INFO ] Flatten gal took : 330 ms
FORMULA BugTracking-PT-q8m004-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 15:07:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q8m004-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 15:07:00] [INFO ] Flatten gal took : 182 ms
[2023-03-12 15:07:01] [INFO ] Input system was already deterministic with 3871 transitions.
Support contains 17 out of 277 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 90641 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90641 steps, saw 51586 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-12 15:07:05] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:07:05] [INFO ] Invariant cache hit.
[2023-03-12 15:07:05] [INFO ] [Real]Absence check using 8 positive place invariants in 53 ms returned sat
[2023-03-12 15:07:10] [INFO ] After 4959ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-12 15:07:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:07:14] [INFO ] After 4062ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-12 15:07:14] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:07:15] [INFO ] After 1146ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-12 15:07:16] [INFO ] Deduced a trap composed of 17 places in 470 ms of which 6 ms to minimize.
[2023-03-12 15:07:16] [INFO ] Deduced a trap composed of 22 places in 506 ms of which 1 ms to minimize.
[2023-03-12 15:07:17] [INFO ] Deduced a trap composed of 17 places in 472 ms of which 2 ms to minimize.
[2023-03-12 15:07:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1707 ms
[2023-03-12 15:07:18] [INFO ] Deduced a trap composed of 51 places in 482 ms of which 13 ms to minimize.
[2023-03-12 15:07:18] [INFO ] Deduced a trap composed of 32 places in 529 ms of which 2 ms to minimize.
[2023-03-12 15:07:19] [INFO ] Deduced a trap composed of 33 places in 486 ms of which 4 ms to minimize.
[2023-03-12 15:07:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1773 ms
[2023-03-12 15:07:20] [INFO ] Deduced a trap composed of 11 places in 582 ms of which 1 ms to minimize.
[2023-03-12 15:07:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 730 ms
[2023-03-12 15:07:20] [INFO ] Deduced a trap composed of 74 places in 535 ms of which 1 ms to minimize.
[2023-03-12 15:07:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 745 ms
[2023-03-12 15:07:21] [INFO ] After 6613ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 345 ms.
[2023-03-12 15:07:21] [INFO ] After 11215ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 325 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10000 steps, including 171 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 100724 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100724 steps, saw 66693 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 15:07:25] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-12 15:07:25] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-12 15:07:25] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-12 15:07:25] [INFO ] After 642ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 15:07:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:07:26] [INFO ] After 427ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:07:26] [INFO ] After 1256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:07:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:07:27] [INFO ] After 785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:07:27] [INFO ] After 526ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 15:07:28] [INFO ] Deduced a trap composed of 46 places in 503 ms of which 2 ms to minimize.
[2023-03-12 15:07:28] [INFO ] Deduced a trap composed of 91 places in 433 ms of which 0 ms to minimize.
[2023-03-12 15:07:29] [INFO ] Deduced a trap composed of 86 places in 404 ms of which 1 ms to minimize.
[2023-03-12 15:07:29] [INFO ] Deduced a trap composed of 85 places in 485 ms of which 1 ms to minimize.
[2023-03-12 15:07:30] [INFO ] Deduced a trap composed of 71 places in 428 ms of which 0 ms to minimize.
[2023-03-12 15:07:30] [INFO ] Deduced a trap composed of 52 places in 380 ms of which 0 ms to minimize.
[2023-03-12 15:07:31] [INFO ] Deduced a trap composed of 94 places in 360 ms of which 1 ms to minimize.
[2023-03-12 15:07:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3624 ms
[2023-03-12 15:07:31] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 0 ms to minimize.
[2023-03-12 15:07:32] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 0 ms to minimize.
[2023-03-12 15:07:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 632 ms
[2023-03-12 15:07:32] [INFO ] After 4929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-12 15:07:32] [INFO ] After 5942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 87 ms.
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 61 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 59 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-12 15:07:32] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:07:32] [INFO ] Invariant cache hit.
[2023-03-12 15:07:33] [INFO ] Implicit Places using invariants in 854 ms returned []
[2023-03-12 15:07:33] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:07:33] [INFO ] Invariant cache hit.
[2023-03-12 15:07:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:07:35] [INFO ] Implicit Places using invariants and state equation in 2344 ms returned []
Implicit Place search using SMT with State Equation took 3208 ms to find 0 implicit places.
[2023-03-12 15:07:36] [INFO ] Redundant transitions in 250 ms returned []
[2023-03-12 15:07:36] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:07:36] [INFO ] Invariant cache hit.
[2023-03-12 15:07:37] [INFO ] Dead Transitions using invariants and state equation in 1295 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4859 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 269 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-12 15:07:37] [INFO ] Computed 9 place invariants in 35 ms
[2023-03-12 15:07:37] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 15:07:38] [INFO ] After 768ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 15:07:38] [INFO ] After 1104ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:07:38] [INFO ] After 1228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:07:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:07:39] [INFO ] After 762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:07:40] [INFO ] After 1084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 250 ms.
[2023-03-12 15:07:40] [INFO ] After 1415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
FORMULA BugTracking-PT-q8m004-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 15:07:40] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-12 15:07:40] [INFO ] Flatten gal took : 211 ms
FORMULA BugTracking-PT-q8m004-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 15:07:40] [INFO ] Flatten gal took : 226 ms
[2023-03-12 15:07:41] [INFO ] Input system was already deterministic with 3871 transitions.
Support contains 3 out of 277 places (down from 4) after GAL structural reductions.
Computed a total of 6 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 13 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:07:41] [INFO ] Flatten gal took : 145 ms
[2023-03-12 15:07:41] [INFO ] Flatten gal took : 180 ms
[2023-03-12 15:07:42] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 83 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:07:42] [INFO ] Flatten gal took : 142 ms
[2023-03-12 15:07:42] [INFO ] Flatten gal took : 160 ms
[2023-03-12 15:07:42] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132936 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132936 steps, saw 76299 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:07:45] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 15:07:46] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-12 15:07:46] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:07:46] [INFO ] After 666ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:07:46] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:07:47] [INFO ] After 356ms SMT Verify possible using 282 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:07:47] [INFO ] After 1083ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:07:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:07:47] [INFO ] After 814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:07:48] [INFO ] After 371ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:07:48] [INFO ] Deduced a trap composed of 12 places in 331 ms of which 1 ms to minimize.
[2023-03-12 15:07:49] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 0 ms to minimize.
[2023-03-12 15:07:49] [INFO ] Deduced a trap composed of 46 places in 360 ms of which 0 ms to minimize.
[2023-03-12 15:07:50] [INFO ] Deduced a trap composed of 35 places in 672 ms of which 0 ms to minimize.
[2023-03-12 15:07:50] [INFO ] Deduced a trap composed of 46 places in 489 ms of which 1 ms to minimize.
[2023-03-12 15:07:51] [INFO ] Deduced a trap composed of 26 places in 475 ms of which 0 ms to minimize.
[2023-03-12 15:07:52] [INFO ] Deduced a trap composed of 59 places in 480 ms of which 1 ms to minimize.
[2023-03-12 15:07:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3839 ms
[2023-03-12 15:07:52] [INFO ] After 4336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 184 ms.
[2023-03-12 15:07:52] [INFO ] After 5397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 576 ms.
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 182 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 1000002 steps, including 15356 resets, run finished after 6548 ms. (steps per millisecond=152 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4481 resets, run finished after 2148 ms. (steps per millisecond=465 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1022288 steps, run timeout after 24001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 1022288 steps, saw 669426 distinct states, run finished after 24002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:08:25] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-12 15:08:26] [INFO ] Computed 8 place invariants in 29 ms
[2023-03-12 15:08:26] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:08:27] [INFO ] After 870ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:08:27] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:08:27] [INFO ] After 444ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:08:27] [INFO ] After 1495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:08:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:08:28] [INFO ] After 811ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:08:28] [INFO ] After 281ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:08:29] [INFO ] Deduced a trap composed of 20 places in 977 ms of which 1 ms to minimize.
[2023-03-12 15:08:30] [INFO ] Deduced a trap composed of 12 places in 789 ms of which 2 ms to minimize.
[2023-03-12 15:08:31] [INFO ] Deduced a trap composed of 26 places in 817 ms of which 1 ms to minimize.
[2023-03-12 15:08:32] [INFO ] Deduced a trap composed of 35 places in 340 ms of which 1 ms to minimize.
[2023-03-12 15:08:32] [INFO ] Deduced a trap composed of 15 places in 335 ms of which 1 ms to minimize.
[2023-03-12 15:08:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3866 ms
[2023-03-12 15:08:32] [INFO ] After 4236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-12 15:08:32] [INFO ] After 5292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1111 ms.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 121 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 82 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-12 15:08:34] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:08:34] [INFO ] Invariant cache hit.
[2023-03-12 15:08:34] [INFO ] Implicit Places using invariants in 707 ms returned []
[2023-03-12 15:08:34] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:08:34] [INFO ] Invariant cache hit.
[2023-03-12 15:08:35] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:08:37] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 2867 ms to find 0 implicit places.
[2023-03-12 15:08:37] [INFO ] Redundant transitions in 202 ms returned []
[2023-03-12 15:08:37] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:08:37] [INFO ] Invariant cache hit.
[2023-03-12 15:08:38] [INFO ] Dead Transitions using invariants and state equation in 1605 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4802 ms. Remains : 270/270 places, 3872/3872 transitions.
Incomplete random walk after 100000 steps, including 1487 resets, run finished after 2623 ms. (steps per millisecond=38 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-12 15:08:41] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:08:41] [INFO ] Invariant cache hit.
[2023-03-12 15:08:41] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:08:42] [INFO ] After 1099ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 15:08:42] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:08:43] [INFO ] After 272ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-12 15:08:43] [INFO ] Deduced a trap composed of 98 places in 443 ms of which 15 ms to minimize.
[2023-03-12 15:08:44] [INFO ] Deduced a trap composed of 99 places in 435 ms of which 0 ms to minimize.
[2023-03-12 15:08:44] [INFO ] Deduced a trap composed of 107 places in 444 ms of which 0 ms to minimize.
[2023-03-12 15:08:45] [INFO ] Deduced a trap composed of 106 places in 591 ms of which 1 ms to minimize.
[2023-03-12 15:08:46] [INFO ] Deduced a trap composed of 107 places in 624 ms of which 1 ms to minimize.
[2023-03-12 15:08:46] [INFO ] Deduced a trap composed of 87 places in 616 ms of which 5 ms to minimize.
[2023-03-12 15:08:47] [INFO ] Deduced a trap composed of 72 places in 572 ms of which 1 ms to minimize.
[2023-03-12 15:08:48] [INFO ] Deduced a trap composed of 93 places in 564 ms of which 0 ms to minimize.
[2023-03-12 15:08:48] [INFO ] Deduced a trap composed of 97 places in 392 ms of which 1 ms to minimize.
[2023-03-12 15:08:49] [INFO ] Deduced a trap composed of 100 places in 460 ms of which 1 ms to minimize.
[2023-03-12 15:08:49] [INFO ] Deduced a trap composed of 100 places in 460 ms of which 0 ms to minimize.
[2023-03-12 15:08:50] [INFO ] Deduced a trap composed of 108 places in 589 ms of which 1 ms to minimize.
[2023-03-12 15:08:51] [INFO ] Deduced a trap composed of 104 places in 456 ms of which 0 ms to minimize.
[2023-03-12 15:08:51] [INFO ] Deduced a trap composed of 94 places in 725 ms of which 1 ms to minimize.
[2023-03-12 15:08:52] [INFO ] Deduced a trap composed of 99 places in 465 ms of which 1 ms to minimize.
[2023-03-12 15:08:53] [INFO ] Deduced a trap composed of 98 places in 451 ms of which 0 ms to minimize.
[2023-03-12 15:08:53] [INFO ] Deduced a trap composed of 99 places in 768 ms of which 2 ms to minimize.
[2023-03-12 15:08:54] [INFO ] Deduced a trap composed of 103 places in 703 ms of which 0 ms to minimize.
[2023-03-12 15:08:55] [INFO ] Deduced a trap composed of 99 places in 418 ms of which 0 ms to minimize.
[2023-03-12 15:08:55] [INFO ] Deduced a trap composed of 98 places in 582 ms of which 1 ms to minimize.
[2023-03-12 15:08:56] [INFO ] Deduced a trap composed of 105 places in 436 ms of which 2 ms to minimize.
[2023-03-12 15:08:57] [INFO ] Deduced a trap composed of 101 places in 622 ms of which 19 ms to minimize.
[2023-03-12 15:08:57] [INFO ] Deduced a trap composed of 103 places in 429 ms of which 9 ms to minimize.
[2023-03-12 15:08:59] [INFO ] Deduced a trap composed of 97 places in 1319 ms of which 1 ms to minimize.
[2023-03-12 15:08:59] [INFO ] Deduced a trap composed of 103 places in 394 ms of which 1 ms to minimize.
[2023-03-12 15:09:00] [INFO ] Deduced a trap composed of 100 places in 407 ms of which 0 ms to minimize.
[2023-03-12 15:09:00] [INFO ] Deduced a trap composed of 100 places in 390 ms of which 13 ms to minimize.
[2023-03-12 15:09:01] [INFO ] Deduced a trap composed of 99 places in 379 ms of which 1 ms to minimize.
[2023-03-12 15:09:01] [INFO ] Deduced a trap composed of 99 places in 357 ms of which 0 ms to minimize.
[2023-03-12 15:09:02] [INFO ] Deduced a trap composed of 104 places in 389 ms of which 1 ms to minimize.
[2023-03-12 15:09:02] [INFO ] Deduced a trap composed of 99 places in 382 ms of which 0 ms to minimize.
[2023-03-12 15:09:03] [INFO ] Deduced a trap composed of 103 places in 378 ms of which 1 ms to minimize.
[2023-03-12 15:09:03] [INFO ] Deduced a trap composed of 106 places in 403 ms of which 1 ms to minimize.
[2023-03-12 15:09:04] [INFO ] Deduced a trap composed of 98 places in 398 ms of which 0 ms to minimize.
[2023-03-12 15:09:04] [INFO ] Deduced a trap composed of 106 places in 411 ms of which 2 ms to minimize.
[2023-03-12 15:09:05] [INFO ] Deduced a trap composed of 105 places in 568 ms of which 1 ms to minimize.
[2023-03-12 15:09:06] [INFO ] Deduced a trap composed of 104 places in 569 ms of which 1 ms to minimize.
[2023-03-12 15:09:06] [INFO ] Deduced a trap composed of 99 places in 488 ms of which 0 ms to minimize.
[2023-03-12 15:09:07] [INFO ] Deduced a trap composed of 106 places in 397 ms of which 1 ms to minimize.
[2023-03-12 15:09:07] [INFO ] Deduced a trap composed of 103 places in 403 ms of which 0 ms to minimize.
[2023-03-12 15:09:08] [INFO ] Deduced a trap composed of 103 places in 547 ms of which 0 ms to minimize.
[2023-03-12 15:09:08] [INFO ] Deduced a trap composed of 103 places in 383 ms of which 0 ms to minimize.
[2023-03-12 15:09:09] [INFO ] Deduced a trap composed of 96 places in 550 ms of which 2 ms to minimize.
[2023-03-12 15:09:10] [INFO ] Deduced a trap composed of 99 places in 532 ms of which 0 ms to minimize.
[2023-03-12 15:09:10] [INFO ] Deduced a trap composed of 103 places in 523 ms of which 1 ms to minimize.
[2023-03-12 15:09:11] [INFO ] Deduced a trap composed of 102 places in 545 ms of which 0 ms to minimize.
[2023-03-12 15:09:11] [INFO ] Deduced a trap composed of 106 places in 383 ms of which 1 ms to minimize.
[2023-03-12 15:09:12] [INFO ] Deduced a trap composed of 106 places in 395 ms of which 0 ms to minimize.
[2023-03-12 15:09:12] [INFO ] Deduced a trap composed of 102 places in 545 ms of which 1 ms to minimize.
[2023-03-12 15:09:13] [INFO ] Deduced a trap composed of 106 places in 374 ms of which 1 ms to minimize.
[2023-03-12 15:09:13] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 30441 ms
[2023-03-12 15:09:13] [INFO ] After 31023ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:09:13] [INFO ] After 32225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:09:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:09:15] [INFO ] After 1269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:09:15] [INFO ] After 348ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 15:09:16] [INFO ] Deduced a trap composed of 8 places in 505 ms of which 1 ms to minimize.
[2023-03-12 15:09:16] [INFO ] Deduced a trap composed of 32 places in 463 ms of which 0 ms to minimize.
[2023-03-12 15:09:17] [INFO ] Deduced a trap composed of 41 places in 532 ms of which 0 ms to minimize.
[2023-03-12 15:09:17] [INFO ] Deduced a trap composed of 51 places in 488 ms of which 1 ms to minimize.
[2023-03-12 15:09:18] [INFO ] Deduced a trap composed of 15 places in 474 ms of which 0 ms to minimize.
[2023-03-12 15:09:19] [INFO ] Deduced a trap composed of 15 places in 421 ms of which 1 ms to minimize.
[2023-03-12 15:09:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3466 ms
[2023-03-12 15:09:19] [INFO ] Deduced a trap composed of 70 places in 461 ms of which 0 ms to minimize.
[2023-03-12 15:09:20] [INFO ] Deduced a trap composed of 70 places in 493 ms of which 1 ms to minimize.
[2023-03-12 15:09:20] [INFO ] Deduced a trap composed of 54 places in 479 ms of which 0 ms to minimize.
[2023-03-12 15:09:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1859 ms
[2023-03-12 15:09:21] [INFO ] After 5863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-12 15:09:21] [INFO ] After 7386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 1000000 steps, including 14864 resets, run finished after 6186 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4421 resets, run finished after 2123 ms. (steps per millisecond=471 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 937128 steps, run timeout after 24001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 937128 steps, saw 613398 distinct states, run finished after 24002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:09:53] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:09:53] [INFO ] Invariant cache hit.
[2023-03-12 15:09:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:09:54] [INFO ] After 795ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:09:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:09:54] [INFO ] After 465ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:09:54] [INFO ] After 1434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:09:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:09:55] [INFO ] After 820ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:09:56] [INFO ] After 302ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:09:56] [INFO ] Deduced a trap composed of 92 places in 512 ms of which 0 ms to minimize.
[2023-03-12 15:09:57] [INFO ] Deduced a trap composed of 91 places in 716 ms of which 0 ms to minimize.
[2023-03-12 15:09:58] [INFO ] Deduced a trap composed of 93 places in 384 ms of which 0 ms to minimize.
[2023-03-12 15:09:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1916 ms
[2023-03-12 15:09:58] [INFO ] After 2311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-12 15:09:58] [INFO ] After 3444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1278 ms.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 57 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 57 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-12 15:09:59] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:09:59] [INFO ] Invariant cache hit.
[2023-03-12 15:10:00] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-12 15:10:00] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:10:00] [INFO ] Invariant cache hit.
[2023-03-12 15:10:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:10:02] [INFO ] Implicit Places using invariants and state equation in 1927 ms returned []
Implicit Place search using SMT with State Equation took 2471 ms to find 0 implicit places.
[2023-03-12 15:10:02] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-12 15:10:02] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:10:02] [INFO ] Invariant cache hit.
[2023-03-12 15:10:03] [INFO ] Dead Transitions using invariants and state equation in 1297 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3957 ms. Remains : 270/270 places, 3872/3872 transitions.
Incomplete random walk after 100000 steps, including 1587 resets, run finished after 1169 ms. (steps per millisecond=85 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-12 15:10:04] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:10:04] [INFO ] Invariant cache hit.
[2023-03-12 15:10:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:10:05] [INFO ] After 598ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 15:10:05] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:10:05] [INFO ] After 228ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-12 15:10:06] [INFO ] Deduced a trap composed of 98 places in 490 ms of which 1 ms to minimize.
[2023-03-12 15:10:06] [INFO ] Deduced a trap composed of 99 places in 435 ms of which 1 ms to minimize.
[2023-03-12 15:10:07] [INFO ] Deduced a trap composed of 107 places in 441 ms of which 1 ms to minimize.
[2023-03-12 15:10:08] [INFO ] Deduced a trap composed of 106 places in 409 ms of which 1 ms to minimize.
[2023-03-12 15:10:08] [INFO ] Deduced a trap composed of 107 places in 451 ms of which 1 ms to minimize.
[2023-03-12 15:10:09] [INFO ] Deduced a trap composed of 87 places in 458 ms of which 1 ms to minimize.
[2023-03-12 15:10:09] [INFO ] Deduced a trap composed of 72 places in 460 ms of which 1 ms to minimize.
[2023-03-12 15:10:10] [INFO ] Deduced a trap composed of 93 places in 452 ms of which 1 ms to minimize.
[2023-03-12 15:10:10] [INFO ] Deduced a trap composed of 97 places in 475 ms of which 0 ms to minimize.
[2023-03-12 15:10:11] [INFO ] Deduced a trap composed of 100 places in 508 ms of which 0 ms to minimize.
[2023-03-12 15:10:12] [INFO ] Deduced a trap composed of 100 places in 457 ms of which 0 ms to minimize.
[2023-03-12 15:10:12] [INFO ] Deduced a trap composed of 108 places in 437 ms of which 1 ms to minimize.
[2023-03-12 15:10:13] [INFO ] Deduced a trap composed of 104 places in 417 ms of which 1 ms to minimize.
[2023-03-12 15:10:13] [INFO ] Deduced a trap composed of 94 places in 609 ms of which 1 ms to minimize.
[2023-03-12 15:10:14] [INFO ] Deduced a trap composed of 99 places in 578 ms of which 1 ms to minimize.
[2023-03-12 15:10:15] [INFO ] Deduced a trap composed of 98 places in 425 ms of which 0 ms to minimize.
[2023-03-12 15:10:15] [INFO ] Deduced a trap composed of 99 places in 446 ms of which 1 ms to minimize.
[2023-03-12 15:10:16] [INFO ] Deduced a trap composed of 103 places in 529 ms of which 1 ms to minimize.
[2023-03-12 15:10:16] [INFO ] Deduced a trap composed of 99 places in 407 ms of which 0 ms to minimize.
[2023-03-12 15:10:17] [INFO ] Deduced a trap composed of 98 places in 822 ms of which 0 ms to minimize.
[2023-03-12 15:10:18] [INFO ] Deduced a trap composed of 105 places in 398 ms of which 1 ms to minimize.
[2023-03-12 15:10:18] [INFO ] Deduced a trap composed of 101 places in 337 ms of which 1 ms to minimize.
[2023-03-12 15:10:19] [INFO ] Deduced a trap composed of 103 places in 368 ms of which 1 ms to minimize.
[2023-03-12 15:10:19] [INFO ] Deduced a trap composed of 97 places in 333 ms of which 1 ms to minimize.
[2023-03-12 15:10:19] [INFO ] Deduced a trap composed of 103 places in 332 ms of which 1 ms to minimize.
[2023-03-12 15:10:20] [INFO ] Deduced a trap composed of 100 places in 469 ms of which 1 ms to minimize.
[2023-03-12 15:10:20] [INFO ] Deduced a trap composed of 100 places in 370 ms of which 0 ms to minimize.
[2023-03-12 15:10:21] [INFO ] Deduced a trap composed of 99 places in 421 ms of which 1 ms to minimize.
[2023-03-12 15:10:21] [INFO ] Deduced a trap composed of 99 places in 388 ms of which 1 ms to minimize.
[2023-03-12 15:10:22] [INFO ] Deduced a trap composed of 104 places in 344 ms of which 0 ms to minimize.
[2023-03-12 15:10:22] [INFO ] Deduced a trap composed of 99 places in 341 ms of which 0 ms to minimize.
[2023-03-12 15:10:23] [INFO ] Deduced a trap composed of 103 places in 301 ms of which 1 ms to minimize.
[2023-03-12 15:10:23] [INFO ] Deduced a trap composed of 106 places in 292 ms of which 0 ms to minimize.
[2023-03-12 15:10:23] [INFO ] Deduced a trap composed of 98 places in 400 ms of which 0 ms to minimize.
[2023-03-12 15:10:24] [INFO ] Deduced a trap composed of 106 places in 367 ms of which 1 ms to minimize.
[2023-03-12 15:10:24] [INFO ] Deduced a trap composed of 105 places in 391 ms of which 1 ms to minimize.
[2023-03-12 15:10:25] [INFO ] Deduced a trap composed of 104 places in 453 ms of which 1 ms to minimize.
[2023-03-12 15:10:26] [INFO ] Deduced a trap composed of 99 places in 383 ms of which 0 ms to minimize.
[2023-03-12 15:10:26] [INFO ] Deduced a trap composed of 106 places in 392 ms of which 0 ms to minimize.
[2023-03-12 15:10:26] [INFO ] Deduced a trap composed of 103 places in 342 ms of which 0 ms to minimize.
[2023-03-12 15:10:27] [INFO ] Deduced a trap composed of 103 places in 382 ms of which 2 ms to minimize.
[2023-03-12 15:10:27] [INFO ] Deduced a trap composed of 103 places in 353 ms of which 0 ms to minimize.
[2023-03-12 15:10:28] [INFO ] Deduced a trap composed of 96 places in 374 ms of which 1 ms to minimize.
[2023-03-12 15:10:28] [INFO ] Deduced a trap composed of 99 places in 332 ms of which 1 ms to minimize.
[2023-03-12 15:10:29] [INFO ] Deduced a trap composed of 103 places in 391 ms of which 2 ms to minimize.
[2023-03-12 15:10:29] [INFO ] Deduced a trap composed of 102 places in 360 ms of which 1 ms to minimize.
[2023-03-12 15:10:30] [INFO ] Deduced a trap composed of 106 places in 355 ms of which 0 ms to minimize.
[2023-03-12 15:10:30] [INFO ] Deduced a trap composed of 106 places in 268 ms of which 1 ms to minimize.
[2023-03-12 15:10:30] [INFO ] Deduced a trap composed of 102 places in 273 ms of which 1 ms to minimize.
[2023-03-12 15:10:31] [INFO ] Deduced a trap composed of 106 places in 312 ms of which 0 ms to minimize.
[2023-03-12 15:10:31] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 25389 ms
[2023-03-12 15:10:31] [INFO ] After 25836ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:10:31] [INFO ] After 26505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 15:10:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:10:32] [INFO ] After 650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 15:10:32] [INFO ] After 337ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 15:10:33] [INFO ] Deduced a trap composed of 8 places in 471 ms of which 0 ms to minimize.
[2023-03-12 15:10:33] [INFO ] Deduced a trap composed of 32 places in 473 ms of which 1 ms to minimize.
[2023-03-12 15:10:34] [INFO ] Deduced a trap composed of 41 places in 487 ms of which 0 ms to minimize.
[2023-03-12 15:10:34] [INFO ] Deduced a trap composed of 51 places in 448 ms of which 1 ms to minimize.
[2023-03-12 15:10:35] [INFO ] Deduced a trap composed of 15 places in 602 ms of which 1 ms to minimize.
[2023-03-12 15:10:35] [INFO ] Deduced a trap composed of 15 places in 474 ms of which 0 ms to minimize.
[2023-03-12 15:10:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3463 ms
[2023-03-12 15:10:36] [INFO ] Deduced a trap composed of 70 places in 356 ms of which 0 ms to minimize.
[2023-03-12 15:10:36] [INFO ] Deduced a trap composed of 70 places in 349 ms of which 0 ms to minimize.
[2023-03-12 15:10:37] [INFO ] Deduced a trap composed of 54 places in 296 ms of which 1 ms to minimize.
[2023-03-12 15:10:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1314 ms
[2023-03-12 15:10:37] [INFO ] After 5232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-12 15:10:37] [INFO ] After 5965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Incomplete random walk after 10000 steps, including 154 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103367 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103367 steps, saw 68279 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:10:40] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:10:40] [INFO ] Invariant cache hit.
[2023-03-12 15:10:40] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:10:41] [INFO ] After 670ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:10:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:10:41] [INFO ] After 474ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:10:41] [INFO ] After 1233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:10:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:10:42] [INFO ] After 710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:10:42] [INFO ] After 267ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:10:43] [INFO ] Deduced a trap composed of 41 places in 355 ms of which 0 ms to minimize.
[2023-03-12 15:10:43] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 0 ms to minimize.
[2023-03-12 15:10:43] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 1 ms to minimize.
[2023-03-12 15:10:44] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 0 ms to minimize.
[2023-03-12 15:10:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1511 ms
[2023-03-12 15:10:44] [INFO ] After 1835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-12 15:10:44] [INFO ] After 2672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 3871
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 269 transition count 3871
Applied a total of 2 rules in 113 ms. Remains 269 /270 variables (removed 1) and now considering 3871/3872 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 269/270 places, 3871/3872 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 143254 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143254 steps, saw 60134 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:10:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:10:47] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 15:10:47] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2023-03-12 15:10:48] [INFO ] After 685ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:10:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:10:48] [INFO ] After 521ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:10:48] [INFO ] After 1273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:10:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:10:49] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:10:50] [INFO ] After 280ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:10:50] [INFO ] Deduced a trap composed of 44 places in 264 ms of which 1 ms to minimize.
[2023-03-12 15:10:50] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2023-03-12 15:10:50] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 0 ms to minimize.
[2023-03-12 15:10:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 963 ms
[2023-03-12 15:10:51] [INFO ] After 1309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-12 15:10:51] [INFO ] After 2144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:10:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:10:51] [INFO ] Invariant cache hit.
[2023-03-12 15:10:51] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-12 15:10:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:10:51] [INFO ] Invariant cache hit.
[2023-03-12 15:10:52] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:10:53] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2536 ms to find 0 implicit places.
[2023-03-12 15:10:53] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-12 15:10:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:10:53] [INFO ] Invariant cache hit.
[2023-03-12 15:10:55] [INFO ] Dead Transitions using invariants and state equation in 1311 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4043 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 243 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 15:10:55] [INFO ] Computed 9 place invariants in 25 ms
[2023-03-12 15:10:55] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:10:56] [INFO ] After 655ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:10:56] [INFO ] After 821ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:10:56] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:10:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:10:57] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:10:57] [INFO ] After 834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-12 15:10:57] [INFO ] After 976ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 139 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 114997 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114997 steps, saw 75785 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:11:00] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-12 15:11:00] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 15:11:00] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:11:01] [INFO ] After 640ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:11:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:11:01] [INFO ] After 114ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:11:01] [INFO ] After 863ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:11:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:11:02] [INFO ] After 758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:11:02] [INFO ] After 227ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:11:03] [INFO ] Deduced a trap composed of 10 places in 478 ms of which 0 ms to minimize.
[2023-03-12 15:11:03] [INFO ] Deduced a trap composed of 64 places in 520 ms of which 1 ms to minimize.
[2023-03-12 15:11:04] [INFO ] Deduced a trap composed of 47 places in 479 ms of which 1 ms to minimize.
[2023-03-12 15:11:04] [INFO ] Deduced a trap composed of 65 places in 377 ms of which 0 ms to minimize.
[2023-03-12 15:11:05] [INFO ] Deduced a trap composed of 62 places in 369 ms of which 1 ms to minimize.
[2023-03-12 15:11:05] [INFO ] Deduced a trap composed of 63 places in 374 ms of which 0 ms to minimize.
[2023-03-12 15:11:06] [INFO ] Deduced a trap composed of 54 places in 390 ms of which 0 ms to minimize.
[2023-03-12 15:11:06] [INFO ] Deduced a trap composed of 62 places in 473 ms of which 0 ms to minimize.
[2023-03-12 15:11:07] [INFO ] Deduced a trap composed of 59 places in 503 ms of which 0 ms to minimize.
[2023-03-12 15:11:08] [INFO ] Deduced a trap composed of 58 places in 474 ms of which 1 ms to minimize.
[2023-03-12 15:11:08] [INFO ] Deduced a trap composed of 64 places in 501 ms of which 0 ms to minimize.
[2023-03-12 15:11:09] [INFO ] Deduced a trap composed of 65 places in 483 ms of which 1 ms to minimize.
[2023-03-12 15:11:09] [INFO ] Deduced a trap composed of 67 places in 460 ms of which 1 ms to minimize.
[2023-03-12 15:11:10] [INFO ] Deduced a trap composed of 42 places in 447 ms of which 1 ms to minimize.
[2023-03-12 15:11:10] [INFO ] Deduced a trap composed of 61 places in 440 ms of which 1 ms to minimize.
[2023-03-12 15:11:11] [INFO ] Deduced a trap composed of 43 places in 462 ms of which 0 ms to minimize.
[2023-03-12 15:11:11] [INFO ] Deduced a trap composed of 99 places in 468 ms of which 0 ms to minimize.
[2023-03-12 15:11:12] [INFO ] Deduced a trap composed of 100 places in 454 ms of which 1 ms to minimize.
[2023-03-12 15:11:13] [INFO ] Deduced a trap composed of 59 places in 451 ms of which 1 ms to minimize.
[2023-03-12 15:11:13] [INFO ] Deduced a trap composed of 69 places in 503 ms of which 1 ms to minimize.
[2023-03-12 15:11:14] [INFO ] Deduced a trap composed of 57 places in 472 ms of which 1 ms to minimize.
[2023-03-12 15:11:15] [INFO ] Deduced a trap composed of 89 places in 522 ms of which 0 ms to minimize.
[2023-03-12 15:11:15] [INFO ] Deduced a trap composed of 93 places in 498 ms of which 1 ms to minimize.
[2023-03-12 15:11:16] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 13779 ms
[2023-03-12 15:11:16] [INFO ] After 14109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-12 15:11:16] [INFO ] After 15078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 3871
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 269 transition count 3871
Applied a total of 2 rules in 157 ms. Remains 269 /270 variables (removed 1) and now considering 3871/3872 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 269/270 places, 3871/3872 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 136720 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136720 steps, saw 55755 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:11:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:11:19] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 15:11:19] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:11:20] [INFO ] After 663ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:11:20] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:11:20] [INFO ] After 144ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:11:20] [INFO ] After 880ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:11:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:11:21] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:11:21] [INFO ] After 259ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:11:22] [INFO ] Deduced a trap composed of 14 places in 541 ms of which 0 ms to minimize.
[2023-03-12 15:11:22] [INFO ] Deduced a trap composed of 88 places in 545 ms of which 0 ms to minimize.
[2023-03-12 15:11:23] [INFO ] Deduced a trap composed of 89 places in 483 ms of which 0 ms to minimize.
[2023-03-12 15:11:24] [INFO ] Deduced a trap composed of 91 places in 493 ms of which 0 ms to minimize.
[2023-03-12 15:11:24] [INFO ] Deduced a trap composed of 83 places in 534 ms of which 0 ms to minimize.
[2023-03-12 15:11:25] [INFO ] Deduced a trap composed of 82 places in 522 ms of which 1 ms to minimize.
[2023-03-12 15:11:25] [INFO ] Deduced a trap composed of 97 places in 540 ms of which 0 ms to minimize.
[2023-03-12 15:11:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4311 ms
[2023-03-12 15:11:26] [INFO ] After 4655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-12 15:11:26] [INFO ] After 5553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 82 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:11:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:11:26] [INFO ] Invariant cache hit.
[2023-03-12 15:11:26] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-12 15:11:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:11:26] [INFO ] Invariant cache hit.
[2023-03-12 15:11:27] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:11:29] [INFO ] Implicit Places using invariants and state equation in 2143 ms returned []
Implicit Place search using SMT with State Equation took 2605 ms to find 0 implicit places.
[2023-03-12 15:11:29] [INFO ] Redundant transitions in 116 ms returned []
[2023-03-12 15:11:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:11:29] [INFO ] Invariant cache hit.
[2023-03-12 15:11:30] [INFO ] Dead Transitions using invariants and state equation in 1342 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4175 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 240 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 15:11:30] [INFO ] Computed 9 place invariants in 27 ms
[2023-03-12 15:11:30] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 15:11:31] [INFO ] After 555ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:11:31] [INFO ] After 656ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-12 15:11:31] [INFO ] After 793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 177 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-12 15:11:31] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-12 15:11:31] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 15:11:32] [INFO ] After 716ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:11:32] [INFO ] After 880ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:11:32] [INFO ] After 1000ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:11:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 15:11:33] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:11:33] [INFO ] After 777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-12 15:11:33] [INFO ] After 910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:11:33] [INFO ] Flatten gal took : 152 ms
[2023-03-12 15:11:34] [INFO ] Flatten gal took : 159 ms
[2023-03-12 15:11:34] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-12 15:11:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 3871 transitions and 19025 arcs took 30 ms.
Total runtime 280824 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/1241/ctl_0_ --ctl=/tmp/1241/ctl_1_ --mu-par --mu-opt
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-02
Could not compute solution for formula : BugTracking-PT-q8m004-CTLFireability-11

BK_STOP 1678634610822

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name BugTracking-PT-q8m004-CTLFireability-02
ctl formula formula --ctl=/tmp/1241/ctl_0_
ctl formula name BugTracking-PT-q8m004-CTLFireability-11
ctl formula formula --ctl=/tmp/1241/ctl_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 277 places, 3871 transitions and 19025 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.070 real 0.050 user 0.020 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 3871->3714 groups
pnml2lts-sym: Regrouping took 3.640 real 3.630 user 0.000 sys
pnml2lts-sym: state vector length is 277; there are 3714 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done

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="BugTracking-PT-q8m004"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q8m004, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694600394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m004.tgz
mv BugTracking-PT-q8m004 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;