About the Execution of ITS-Tools for FireWire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2055.819 | 303609.00 | 440550.00 | 871.00 | FFFFFFTFFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898900244.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FireWire-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898900244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 101K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-10-LTLFireability-00
FORMULA_NAME FireWire-PT-10-LTLFireability-01
FORMULA_NAME FireWire-PT-10-LTLFireability-02
FORMULA_NAME FireWire-PT-10-LTLFireability-03
FORMULA_NAME FireWire-PT-10-LTLFireability-04
FORMULA_NAME FireWire-PT-10-LTLFireability-05
FORMULA_NAME FireWire-PT-10-LTLFireability-06
FORMULA_NAME FireWire-PT-10-LTLFireability-07
FORMULA_NAME FireWire-PT-10-LTLFireability-08
FORMULA_NAME FireWire-PT-10-LTLFireability-09
FORMULA_NAME FireWire-PT-10-LTLFireability-10
FORMULA_NAME FireWire-PT-10-LTLFireability-11
FORMULA_NAME FireWire-PT-10-LTLFireability-12
FORMULA_NAME FireWire-PT-10-LTLFireability-13
FORMULA_NAME FireWire-PT-10-LTLFireability-14
FORMULA_NAME FireWire-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717362404172
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 21:06:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:06:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:06:45] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 21:06:45] [INFO ] Transformed 131 places.
[2024-06-02 21:06:45] [INFO ] Transformed 409 transitions.
[2024-06-02 21:06:45] [INFO ] Found NUPN structural information;
[2024-06-02 21:06:45] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 353/353 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 128 transition count 347
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 128 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 128 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 128 transition count 339
Applied a total of 14 rules in 44 ms. Remains 128 /131 variables (removed 3) and now considering 339/353 (removed 14) transitions.
[2024-06-02 21:06:45] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
// Phase 1: matrix 313 rows 128 cols
[2024-06-02 21:06:45] [INFO ] Computed 8 invariants in 20 ms
[2024-06-02 21:06:45] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-02 21:06:45] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
[2024-06-02 21:06:45] [INFO ] Invariant cache hit.
[2024-06-02 21:06:46] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:06:46] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 497 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/131 places, 339/353 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 560 ms. Remains : 127/131 places, 339/353 transitions.
Support contains 31 out of 127 places after structural reductions.
[2024-06-02 21:06:46] [INFO ] Flatten gal took : 49 ms
[2024-06-02 21:06:46] [INFO ] Flatten gal took : 24 ms
[2024-06-02 21:06:46] [INFO ] Input system was already deterministic with 339 transitions.
Reduction of identical properties reduced properties to check from 28 to 26
RANDOM walk for 40000 steps (2192 resets) in 1854 ms. (21 steps per ms) remains 10/26 properties
BEST_FIRST walk for 40004 steps (839 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (17 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (565 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (589 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (607 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (11 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (542 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (83 resets) in 39 ms. (1000 steps per ms) remains 5/10 properties
[2024-06-02 21:06:47] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
// Phase 1: matrix 313 rows 127 cols
[2024-06-02 21:06:47] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:06:47] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 103/113 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/123 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 312/435 variables, 123/130 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 44/174 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/439 variables, 4/178 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/440 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/440 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 179 constraints, problems are : Problem set: 1 solved, 4 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 83/89 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/123 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-02 21:06:47] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 9 ms to minimize.
[2024-06-02 21:06:48] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 3 ms to minimize.
[2024-06-02 21:06:48] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 312/435 variables, 123/133 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 44/177 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 4/181 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 4/439 variables, 4/185 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/440 variables, 1/186 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/440 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 186 constraints, problems are : Problem set: 1 solved, 4 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 1089ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 1 properties in 1438 ms.
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 339/339 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 336
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 125 transition count 331
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 125 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 125 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 124 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 124 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 123 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 123 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 122 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 122 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 121 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 121 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 120 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 120 transition count 318
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 119 transition count 317
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 116 transition count 323
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 32 place count 116 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 116 transition count 314
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 116 transition count 315
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 41 place count 114 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 114 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 113 transition count 310
Applied a total of 44 rules in 108 ms. Remains 113 /127 variables (removed 14) and now considering 310/339 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 113/127 places, 310/339 transitions.
RANDOM walk for 40000 steps (2372 resets) in 560 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (556 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (573 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (66 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 802484 steps, run visited all 3 properties in 1293 ms. (steps per millisecond=620 )
Probabilistic random walk after 802484 steps, saw 167656 distinct states, run finished after 1297 ms. (steps per millisecond=618 ) properties seen :3
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 22 stabilizing places and 46 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G(p1))))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 307
Applied a total of 27 rules in 18 ms. Remains 114 /127 variables (removed 13) and now considering 307/339 (removed 32) transitions.
[2024-06-02 21:06:52] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 114 cols
[2024-06-02 21:06:52] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:06:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 21:06:52] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:06:52] [INFO ] Invariant cache hit.
[2024-06-02 21:06:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:06:52] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 339 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/127 places, 307/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 113/127 places, 307/339 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-00 finished in 666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 112 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 109 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 109 transition count 305
Applied a total of 41 rules in 98 ms. Remains 109 /127 variables (removed 18) and now considering 305/339 (removed 34) transitions.
[2024-06-02 21:06:52] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 109 cols
[2024-06-02 21:06:52] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:06:53] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-02 21:06:53] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 21:06:53] [INFO ] Invariant cache hit.
[2024-06-02 21:06:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:06:53] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 446 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/127 places, 305/339 transitions.
Applied a total of 0 rules in 12 ms. Remains 108 /108 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 556 ms. Remains : 108/127 places, 305/339 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-02 finished in 596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(p0)&&X(G(!p0))))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 337
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 336
Applied a total of 3 rules in 2 ms. Remains 126 /127 variables (removed 1) and now considering 336/339 (removed 3) transitions.
[2024-06-02 21:06:53] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
// Phase 1: matrix 310 rows 126 cols
[2024-06-02 21:06:53] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:06:53] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 21:06:53] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2024-06-02 21:06:53] [INFO ] Invariant cache hit.
[2024-06-02 21:06:53] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:06:53] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 316 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 336/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 336/336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 320 ms. Remains : 125/127 places, 336/339 transitions.
Stuttering acceptance computed with spot in 151 ms :[p0, p0, true, true, true]
Running random walk in product with property : FireWire-PT-10-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-03 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X((p0||X(X(F(p2)))))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 336
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 125 transition count 334
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 124 transition count 331
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 123 transition count 329
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 122 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 121 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 120 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 119 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 118 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 117 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 116 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 115 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 115 transition count 310
Applied a total of 24 rules in 11 ms. Remains 115 /127 variables (removed 12) and now considering 310/339 (removed 29) transitions.
[2024-06-02 21:06:53] [INFO ] Flow matrix only has 284 transitions (discarded 26 similar events)
// Phase 1: matrix 284 rows 115 cols
[2024-06-02 21:06:53] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:06:53] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:06:53] [INFO ] Flow matrix only has 284 transitions (discarded 26 similar events)
[2024-06-02 21:06:53] [INFO ] Invariant cache hit.
[2024-06-02 21:06:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:06:54] [INFO ] Implicit Places using invariants and state equation in 192 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 276 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/127 places, 310/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 289 ms. Remains : 114/127 places, 310/339 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-04 finished in 487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(p2))))'
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 122 transition count 327
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 120 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 120 transition count 327
Applied a total of 19 rules in 37 ms. Remains 120 /127 variables (removed 7) and now considering 327/339 (removed 12) transitions.
[2024-06-02 21:06:54] [INFO ] Flow matrix only has 297 transitions (discarded 30 similar events)
// Phase 1: matrix 297 rows 120 cols
[2024-06-02 21:06:54] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:06:54] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 21:06:54] [INFO ] Flow matrix only has 297 transitions (discarded 30 similar events)
[2024-06-02 21:06:54] [INFO ] Invariant cache hit.
[2024-06-02 21:06:54] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:06:54] [INFO ] Implicit Places using invariants and state equation in 173 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 241 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/127 places, 327/339 transitions.
Applied a total of 0 rules in 8 ms. Remains 119 /119 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 286 ms. Remains : 119/127 places, 327/339 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-05 finished in 436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(((!X(p0) U p1)||F(p2)||p1)))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Applied a total of 7 rules in 4 ms. Remains 124 /127 variables (removed 3) and now considering 331/339 (removed 8) transitions.
[2024-06-02 21:06:54] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
// Phase 1: matrix 305 rows 124 cols
[2024-06-02 21:06:54] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:06:54] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 21:06:54] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 21:06:54] [INFO ] Invariant cache hit.
[2024-06-02 21:06:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 21:06:54] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-06-02 21:06:54] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 21:06:54] [INFO ] Invariant cache hit.
[2024-06-02 21:06:54] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:06:57] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 2 ms to minimize.
[2024-06-02 21:06:57] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:06:57] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:06:57] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:06:57] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-02 21:06:57] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-02 21:06:57] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:06:58] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 304/428 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 1/429 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 0/429 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 183 constraints, problems are : Problem set: 0 solved, 330 unsolved in 14453 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 304/428 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 330/512 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:07:14] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:07:14] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 1/429 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:07:30] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 429/429 variables, and 516 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 11/11 constraints]
After SMT, in 44820ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 44825ms
Starting structural reductions in LTL mode, iteration 1 : 124/127 places, 331/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45069 ms. Remains : 124/127 places, 331/339 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Computed a total of 20 stabilizing places and 41 stable transitions
Computed a total of 20 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (2209 resets) in 233 ms. (170 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 11 factoid took 259 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 331/331 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2024-06-02 21:07:40] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 21:07:40] [INFO ] Invariant cache hit.
[2024-06-02 21:07:41] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 21:07:41] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 21:07:41] [INFO ] Invariant cache hit.
[2024-06-02 21:07:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 21:07:41] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-06-02 21:07:41] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 21:07:41] [INFO ] Invariant cache hit.
[2024-06-02 21:07:41] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:07:43] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:07:43] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 6 ms to minimize.
[2024-06-02 21:07:43] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:07:43] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:07:43] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:07:43] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-06-02 21:07:43] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:07:44] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 304/428 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 1/429 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 0/429 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 183 constraints, problems are : Problem set: 0 solved, 330 unsolved in 13831 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 304/428 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 330/512 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:07:59] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:07:59] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 1/429 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:08:15] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 429/429 variables, and 516 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 11/11 constraints]
After SMT, in 44070ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 44073ms
Finished structural reductions in LTL mode , in 1 iterations and 44316 ms. Remains : 124/124 places, 331/331 transitions.
Computed a total of 20 stabilizing places and 41 stable transitions
Computed a total of 20 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 114 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (2213 resets) in 116 ms. (341 steps per ms) remains 1/5 properties
BEST_FIRST walk for 32094 steps (507 resets) in 50 ms. (629 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 11 factoid took 282 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 82 ms.
Built C files in :
/tmp/ltsmin1131401577468032595
[2024-06-02 21:08:26] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1131401577468032595
Running compilation step : cd /tmp/ltsmin1131401577468032595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 668 ms.
Running link step : cd /tmp/ltsmin1131401577468032595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1131401577468032595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12984856291706094679.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 331/331 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2024-06-02 21:08:41] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 21:08:41] [INFO ] Invariant cache hit.
[2024-06-02 21:08:41] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:08:41] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 21:08:41] [INFO ] Invariant cache hit.
[2024-06-02 21:08:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 21:08:42] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-06-02 21:08:42] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2024-06-02 21:08:42] [INFO ] Invariant cache hit.
[2024-06-02 21:08:42] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:08:43] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:08:43] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:08:44] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:08:44] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:08:44] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:08:44] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-06-02 21:08:44] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:08:44] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 304/428 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 1/429 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 0/429 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 183 constraints, problems are : Problem set: 0 solved, 330 unsolved in 13513 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 304/428 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 330/512 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:09:00] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:09:00] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 1/429 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 21:09:15] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 429/429 variables, and 516 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 11/11 constraints]
After SMT, in 43752ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 43757ms
Finished structural reductions in LTL mode , in 1 iterations and 44025 ms. Remains : 124/124 places, 331/331 transitions.
Built C files in :
/tmp/ltsmin18373031151120857931
[2024-06-02 21:09:25] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18373031151120857931
Running compilation step : cd /tmp/ltsmin18373031151120857931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 548 ms.
Running link step : cd /tmp/ltsmin18373031151120857931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18373031151120857931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14557809994701903006.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 21:09:41] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:09:41] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:09:41] [INFO ] Time to serialize gal into /tmp/LTL4527017538748552411.gal : 4 ms
[2024-06-02 21:09:41] [INFO ] Time to serialize properties into /tmp/LTL5787407929255532883.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4527017538748552411.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2833431333746062446.hoa' '-atoms' '/tmp/LTL5787407929255532883.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5787407929255532883.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2833431333746062446.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...699
Computing Next relation with stutter on 79224 deadlock states
Detected timeout of ITS tools.
[2024-06-02 21:09:56] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:09:56] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:09:56] [INFO ] Time to serialize gal into /tmp/LTL1058683795191827522.gal : 3 ms
[2024-06-02 21:09:56] [INFO ] Time to serialize properties into /tmp/LTL6272510543306512771.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1058683795191827522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6272510543306512771.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(X((((!(X("((p3==1)&&(p119==1))")))U("((p13==1)&&(p25==1))"))||(F("((p3==0)||(p119==0))")))||("((p13==1)&&(p25==1))"))))))
Formula 0 simplified : G(F(!"((p13==1)&&(p25==1))" & X(!"((p13==1)&&(p25==1))" W "((p3==1)&&(p119==1))")) & FG!"((p3==0)||(p119==0))")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...699
Computing Next relation with stutter on 79224 deadlock states
Detected timeout of ITS tools.
[2024-06-02 21:10:11] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:10:11] [INFO ] Applying decomposition
[2024-06-02 21:10:11] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16129451118959034927.txt' '-o' '/tmp/graph16129451118959034927.bin' '-w' '/tmp/graph16129451118959034927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16129451118959034927.bin' '-l' '-1' '-v' '-w' '/tmp/graph16129451118959034927.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:10:11] [INFO ] Decomposing Gal with order
[2024-06-02 21:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:10:11] [INFO ] Removed a total of 514 redundant transitions.
[2024-06-02 21:10:11] [INFO ] Flatten gal took : 54 ms
[2024-06-02 21:10:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 12 ms.
[2024-06-02 21:10:11] [INFO ] Time to serialize gal into /tmp/LTL8429249292349605036.gal : 5 ms
[2024-06-02 21:10:11] [INFO ] Time to serialize properties into /tmp/LTL12417060167874129115.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8429249292349605036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12417060167874129115.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(X((((!(X("((i0.u0.p3==1)&&(i0.u0.p119==1))")))U("((i3.i0.u4.p13==1)&&(i3.i0.u5.p25==1))"))||(F("((i0.u0.p3==0)||(i0.u0.p119==0)...209
Formula 0 simplified : G(F(!"((i3.i0.u4.p13==1)&&(i3.i0.u5.p25==1))" & X(!"((i3.i0.u4.p13==1)&&(i3.i0.u5.p25==1))" W "((i0.u0.p3==1)&&(i0.u0.p119==1))")) &...194
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t91, t94, t96, t133, t134, t135, t...873
Computing Next relation with stutter on 79224 deadlock states
13 unique states visited
0 strongly connected components in search stack
22 transitions explored
8 items max in DFS search stack
832 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.34979,185660,1,0,231551,5441,3603,943431,474,34912,789799
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FireWire-PT-10-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property FireWire-PT-10-LTLFireability-06 finished in 205931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(G(p2)))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Applied a total of 15 rules in 11 ms. Remains 120 /127 variables (removed 7) and now considering 321/339 (removed 18) transitions.
[2024-06-02 21:10:20] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 120 cols
[2024-06-02 21:10:20] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:10:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:10:20] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 21:10:20] [INFO ] Invariant cache hit.
[2024-06-02 21:10:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 21:10:20] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 241 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 321/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 253 ms. Remains : 119/127 places, 321/339 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-08 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 112 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 109 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 109 transition count 305
Applied a total of 41 rules in 52 ms. Remains 109 /127 variables (removed 18) and now considering 305/339 (removed 34) transitions.
[2024-06-02 21:10:21] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 109 cols
[2024-06-02 21:10:21] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:10:21] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 21:10:21] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 21:10:21] [INFO ] Invariant cache hit.
[2024-06-02 21:10:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:10:21] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 209 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/127 places, 305/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 265 ms. Remains : 108/127 places, 305/339 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-09 finished in 342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U p1)&&F(G(!p1))))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 113 transition count 306
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 111 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 111 transition count 306
Applied a total of 37 rules in 33 ms. Remains 111 /127 variables (removed 16) and now considering 306/339 (removed 33) transitions.
[2024-06-02 21:10:21] [INFO ] Flow matrix only has 276 transitions (discarded 30 similar events)
// Phase 1: matrix 276 rows 111 cols
[2024-06-02 21:10:21] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:10:21] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 21:10:21] [INFO ] Flow matrix only has 276 transitions (discarded 30 similar events)
[2024-06-02 21:10:21] [INFO ] Invariant cache hit.
[2024-06-02 21:10:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 21:10:21] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 204 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/127 places, 306/339 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 110/127 places, 306/339 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, p0, (NOT p1), p1]
Running random walk in product with property : FireWire-PT-10-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 0 reset in 163 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[true, p0, (NOT p1), p1, false, false]
RANDOM walk for 40000 steps (2263 resets) in 120 ms. (330 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (29 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2024-06-02 21:10:22] [INFO ] Flow matrix only has 276 transitions (discarded 30 similar events)
// Phase 1: matrix 276 rows 110 cols
[2024-06-02 21:10:22] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:10:22] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 36/386 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 2/6 constraints, State Equation: 0/110 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 219 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), p1, false]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), p1, false]
[2024-06-02 21:10:23] [INFO ] Flow matrix only has 276 transitions (discarded 30 similar events)
[2024-06-02 21:10:23] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), true]
Knowledge based reduction with 8 factoid took 240 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p1), p1, false]
Support contains 2 out of 110 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 306/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-06-02 21:10:23] [INFO ] Flow matrix only has 276 transitions (discarded 30 similar events)
[2024-06-02 21:10:23] [INFO ] Invariant cache hit.
[2024-06-02 21:10:23] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 21:10:23] [INFO ] Flow matrix only has 276 transitions (discarded 30 similar events)
[2024-06-02 21:10:23] [INFO ] Invariant cache hit.
[2024-06-02 21:10:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 21:10:23] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-06-02 21:10:23] [INFO ] Redundant transitions in 16 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-02 21:10:23] [INFO ] Flow matrix only has 276 transitions (discarded 30 similar events)
[2024-06-02 21:10:23] [INFO ] Invariant cache hit.
[2024-06-02 21:10:23] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 21:10:25] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 10 ms to minimize.
[2024-06-02 21:10:25] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:10:25] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:10:25] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:10:25] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 275/385 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 41/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 21:10:29] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 164 constraints, problems are : Problem set: 0 solved, 305 unsolved in 11335 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 275/385 variables, 110/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 41/163 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 305/468 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 21:10:39] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:10:40] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 1/386 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 471 constraints, problems are : Problem set: 0 solved, 305 unsolved in 26349 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 8/8 constraints]
After SMT, in 37879ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 37882ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38124 ms. Remains : 110/110 places, 306/306 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), p1, false]
RANDOM walk for 2321 steps (138 resets) in 13 ms. (165 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p1), p1, false]
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), p1, false]
[2024-06-02 21:11:02] [INFO ] Flow matrix only has 276 transitions (discarded 30 similar events)
[2024-06-02 21:11:02] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), true]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), p1, false]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), p1, false]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-10 finished in 41635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))&&G(p2)&&p0)))'
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 307
Applied a total of 27 rules in 7 ms. Remains 114 /127 variables (removed 13) and now considering 307/339 (removed 32) transitions.
[2024-06-02 21:11:03] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 114 cols
[2024-06-02 21:11:03] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:11:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 21:11:03] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:11:03] [INFO ] Invariant cache hit.
[2024-06-02 21:11:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:11:03] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-06-02 21:11:03] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:11:03] [INFO ] Invariant cache hit.
[2024-06-02 21:11:03] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:11:04] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:11:04] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:11:05] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:11:05] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:11:05] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/394 variables, 114/126 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/395 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:11:11] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/395 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 167 constraints, problems are : Problem set: 0 solved, 306 unsolved in 12174 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 114/114 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/394 variables, 114/127 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 39/166 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 306/472 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:11:20] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 1/395 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 21:11:42] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 475 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 114/114 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 8/8 constraints]
After SMT, in 42350ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 42355ms
Starting structural reductions in LTL mode, iteration 1 : 114/127 places, 307/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42570 ms. Remains : 114/127 places, 307/339 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-11 finished in 42756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 112 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 109 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 109 transition count 305
Applied a total of 41 rules in 38 ms. Remains 109 /127 variables (removed 18) and now considering 305/339 (removed 34) transitions.
[2024-06-02 21:11:45] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 109 cols
[2024-06-02 21:11:45] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:11:45] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 21:11:45] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 21:11:45] [INFO ] Invariant cache hit.
[2024-06-02 21:11:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:11:46] [INFO ] Implicit Places using invariants and state equation in 177 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 238 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/127 places, 305/339 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 282 ms. Remains : 108/127 places, 305/339 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-12 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 307
Applied a total of 27 rules in 19 ms. Remains 114 /127 variables (removed 13) and now considering 307/339 (removed 32) transitions.
[2024-06-02 21:11:46] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 114 cols
[2024-06-02 21:11:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:11:46] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 21:11:46] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2024-06-02 21:11:46] [INFO ] Invariant cache hit.
[2024-06-02 21:11:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:11:46] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/127 places, 307/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 236 ms. Remains : 113/127 places, 307/339 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Computed a total of 10 stabilizing places and 17 stable transitions
Computed a total of 10 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-10-LTLFireability-14 finished in 799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((F(p1)&&p0)))||G(p2))))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Applied a total of 15 rules in 15 ms. Remains 120 /127 variables (removed 7) and now considering 321/339 (removed 18) transitions.
[2024-06-02 21:11:46] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 120 cols
[2024-06-02 21:11:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:11:47] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:11:47] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2024-06-02 21:11:47] [INFO ] Invariant cache hit.
[2024-06-02 21:11:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 21:11:47] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 267 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/127 places, 321/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 284 ms. Remains : 119/127 places, 321/339 transitions.
Stuttering acceptance computed with spot in 465 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-15 finished in 767 ms.
All properties solved by simple procedures.
Total runtime 302415 ms.
BK_STOP 1717362707781
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="FireWire-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898900244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-10.tgz
mv FireWire-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;