MCC'2024- Execution of r576-smll-171734920000092

About the Execution of ITS-Tools for MedleyA-PT-12

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
463.048	204846.00	250833.00	924.50	FTFFFFFFFFFFFFTF	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.r576-smll-171734920000092.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 MedleyA-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920000092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 164K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 43K 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 MedleyA-PT-12-LTLFireability-00
FORMULA_NAME MedleyA-PT-12-LTLFireability-01
FORMULA_NAME MedleyA-PT-12-LTLFireability-02
FORMULA_NAME MedleyA-PT-12-LTLFireability-03
FORMULA_NAME MedleyA-PT-12-LTLFireability-04
FORMULA_NAME MedleyA-PT-12-LTLFireability-05
FORMULA_NAME MedleyA-PT-12-LTLFireability-06
FORMULA_NAME MedleyA-PT-12-LTLFireability-07
FORMULA_NAME MedleyA-PT-12-LTLFireability-08
FORMULA_NAME MedleyA-PT-12-LTLFireability-09
FORMULA_NAME MedleyA-PT-12-LTLFireability-10
FORMULA_NAME MedleyA-PT-12-LTLFireability-11
FORMULA_NAME MedleyA-PT-12-LTLFireability-12
FORMULA_NAME MedleyA-PT-12-LTLFireability-13
FORMULA_NAME MedleyA-PT-12-LTLFireability-14
FORMULA_NAME MedleyA-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368127242

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 22:42:09] [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 22:42:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:42:09] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-06-02 22:42:09] [INFO ] Transformed 172 places.
[2024-06-02 22:42:09] [INFO ] Transformed 166 transitions.
[2024-06-02 22:42:09] [INFO ] Found NUPN structural information;
[2024-06-02 22:42:09] [INFO ] Parsed PT model containing 172 places and 166 transitions and 466 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 160 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-12-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 168 transition count 166
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 16 place count 156 transition count 154
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 156 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 155 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 155 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 154 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 154 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 153 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 153 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 152 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 152 transition count 150
Applied a total of 36 rules in 96 ms. Remains 152 /172 variables (removed 20) and now considering 150/166 (removed 16) transitions.
// Phase 1: matrix 150 rows 152 cols
[2024-06-02 22:42:10] [INFO ] Computed 20 invariants in 24 ms
[2024-06-02 22:42:10] [INFO ] Implicit Places using invariants in 540 ms returned [34, 40]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 602 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/172 places, 150/166 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 737 ms. Remains : 150/172 places, 150/166 transitions.
Support contains 34 out of 150 places after structural reductions.
[2024-06-02 22:42:11] [INFO ] Flatten gal took : 69 ms
[2024-06-02 22:42:11] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:42:11] [INFO ] Input system was already deterministic with 150 transitions.
RANDOM walk for 40000 steps (830 resets) in 2242 ms. (17 steps per ms) remains 3/24 properties
BEST_FIRST walk for 40004 steps (179 resets) in 122 ms. (325 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (176 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
// Phase 1: matrix 150 rows 150 cols
[2024-06-02 22:42:12] [INFO ] Computed 18 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 54/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 35/150 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 150/300 variables, 150/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/300 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 168 constraints, problems are : Problem set: 0 solved, 2 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 54/115 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:42:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 35/150 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 150/300 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/300 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 3444 steps, including 151 resets, run visited all 2 properties in 85 ms. (steps per millisecond=40 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 93 ms.
Computed a total of 10 stabilizing places and 10 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(F((p0||X(F(p1))))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 145 transition count 146
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 145 transition count 146
Applied a total of 9 rules in 11 ms. Remains 145 /150 variables (removed 5) and now considering 146/150 (removed 4) transitions.
// Phase 1: matrix 146 rows 145 cols
[2024-06-02 22:42:13] [INFO ] Computed 17 invariants in 3 ms
[2024-06-02 22:42:13] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-02 22:42:13] [INFO ] Invariant cache hit.
[2024-06-02 22:42:14] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-06-02 22:42:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 22:42:16] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 7 ms to minimize.
[2024-06-02 22:42:16] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-06-02 22:42:16] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-06-02 22:42:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:42:17] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:42:17] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:42:17] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/291 variables, 145/169 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 22:42:19] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 170 constraints, problems are : Problem set: 0 solved, 145 unsolved in 9827 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 22:42:25] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 146/291 variables, 145/171 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 145/316 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 22:42:27] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:42:28] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:42:28] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 22:42:32] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/291 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 22:42:38] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-06-02 22:42:39] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/291 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (OVERLAPS) 0/291 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 322 constraints, problems are : Problem set: 0 solved, 145 unsolved in 23179 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 15/15 constraints]
After SMT, in 33122ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 33131ms
Starting structural reductions in LTL mode, iteration 1 : 145/150 places, 146/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33560 ms. Remains : 145/150 places, 146/150 transitions.
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-02
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 4 ms.
FORMULA MedleyA-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-02 finished in 34010 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((X((p0||X(F(p1))))&&F(p2))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 141 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 141 transition count 131
Applied a total of 17 rules in 18 ms. Remains 141 /150 variables (removed 9) and now considering 131/150 (removed 19) transitions.
// Phase 1: matrix 131 rows 141 cols
[2024-06-02 22:42:47] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 22:42:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:42:47] [INFO ] Invariant cache hit.
[2024-06-02 22:42:47] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-02 22:42:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:42:49] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-06-02 22:42:49] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
[2024-06-02 22:42:49] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 161 constraints, problems are : Problem set: 0 solved, 130 unsolved in 4846 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 130/291 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:42:54] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
[2024-06-02 22:42:54] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:42:55] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 3 ms to minimize.
[2024-06-02 22:42:55] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:42:56] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 3 ms to minimize.
[2024-06-02 22:42:57] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:42:57] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 298 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9997 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints]
After SMT, in 14873ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 14878ms
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15144 ms. Remains : 141/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-03
Stuttering criterion allowed to conclude after 113 steps with 2 reset in 1 ms.
FORMULA MedleyA-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-03 finished in 15427 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 U (G(!p0)||(!p0&&(p1 U (p2||G(p1)))))))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 148 transition count 123
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 121 transition count 121
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 56 place count 121 transition count 97
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 105 place count 96 transition count 97
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 95 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 94 transition count 96
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 112 place count 90 transition count 92
Iterating global reduction 5 with 4 rules applied. Total rules applied 116 place count 90 transition count 92
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 164 place count 66 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 176 place count 60 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 60 transition count 78
Applied a total of 177 rules in 52 ms. Remains 60 /150 variables (removed 90) and now considering 78/150 (removed 72) transitions.
// Phase 1: matrix 78 rows 60 cols
[2024-06-02 22:43:03] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 22:43:03] [INFO ] Implicit Places using invariants in 77 ms returned [23, 31, 35, 38]
[2024-06-02 22:43:03] [INFO ] Actually due to overlaps returned [23, 35, 38]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/150 places, 78/150 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 57 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 77
Applied a total of 4 rules in 8 ms. Remains 55 /57 variables (removed 2) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 55 cols
[2024-06-02 22:43:03] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 22:43:03] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:43:03] [INFO ] Invariant cache hit.
[2024-06-02 22:43:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:43:03] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/150 places, 77/150 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 326 ms. Remains : 55/150 places, 77/150 transitions.
Stuttering acceptance computed with spot in 158 ms :[p0, p0, (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-04
Product exploration explored 100000 steps with 10364 reset in 559 ms.
Product exploration explored 100000 steps with 10367 reset in 320 ms.
Computed a total of 3 stabilizing places and 10 stable transitions
Computed a total of 3 stabilizing places and 10 stable transitions
Detected a total of 3/55 stabilizing places and 10/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 498 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[p0, p0, (AND (NOT p2) (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (3431 resets) in 354 ms. (112 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (526 resets) in 260 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (577 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
[2024-06-02 22:43:05] [INFO ] Invariant cache hit.
[2024-06-02 22:43:05] [INFO ] State equation strengthened by 5 read => feed constraints.
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/43 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 53/132 variables, and 11 constraints, problems are : Problem set: 2 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/55 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR p2 p1) (NOT p0)))), (F p0), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 1180 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 176 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), false]
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 77/77 transitions.
Applied a total of 0 rules in 10 ms. Remains 55 /55 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-06-02 22:43:06] [INFO ] Invariant cache hit.
[2024-06-02 22:43:06] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 22:43:06] [INFO ] Invariant cache hit.
[2024-06-02 22:43:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:43:07] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-02 22:43:07] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-06-02 22:43:07] [INFO ] Invariant cache hit.
[2024-06-02 22:43:07] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-02 22:43:07] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 77/132 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 73 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1694 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 77/132 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 69/142 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-02 22:43:09] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 143 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 2/2 constraints]
After SMT, in 3756ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 3757ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3932 ms. Remains : 55/55 places, 77/77 transitions.
Computed a total of 3 stabilizing places and 10 stable transitions
Computed a total of 3 stabilizing places and 10 stable transitions
Detected a total of 3/55 stabilizing places and 10/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 647 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), false]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (3395 resets) in 210 ms. (189 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (526 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (586 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2024-06-02 22:43:11] [INFO ] Invariant cache hit.
[2024-06-02 22:43:11] [INFO ] State equation strengthened by 5 read => feed constraints.
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/43 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 53/132 variables, and 11 constraints, problems are : Problem set: 2 solved, 0 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/55 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p1))), (F p0), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 832 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 226 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 286 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), false]
Product exploration explored 100000 steps with 10378 reset in 169 ms.
Product exploration explored 100000 steps with 10407 reset in 333 ms.
Built C files in :
/tmp/ltsmin17987863450417218316
[2024-06-02 22:43:13] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2024-06-02 22:43:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:43:13] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2024-06-02 22:43:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:43:14] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2024-06-02 22:43:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:43:14] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17987863450417218316
Running compilation step : cd /tmp/ltsmin17987863450417218316;'/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 796 ms.
Running link step : cd /tmp/ltsmin17987863450417218316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin17987863450417218316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12617483972834701782.hoa' '--buchi-type=spotba'
LTSmin run took 308 ms.
FORMULA MedleyA-PT-12-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-12-LTLFireability-04 finished in 12251 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&&(p1||X(p2))))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 142 transition count 132
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 142 transition count 132
Applied a total of 15 rules in 4 ms. Remains 142 /150 variables (removed 8) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 142 cols
[2024-06-02 22:43:15] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 22:43:15] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 22:43:15] [INFO ] Invariant cache hit.
[2024-06-02 22:43:15] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 22:43:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:43:17] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 3 ms to minimize.
[2024-06-02 22:43:17] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:43:17] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:43:17] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
[2024-06-02 22:43:17] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-06-02 22:43:17] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 4 ms to minimize.
[2024-06-02 22:43:17] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:43:18] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 167 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5848 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 131/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:43:23] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:43:23] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 3 ms to minimize.
[2024-06-02 22:43:24] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 3 ms to minimize.
[2024-06-02 22:43:24] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:43:26] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:43:27] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 304 constraints, problems are : Problem set: 0 solved, 131 unsolved in 11697 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 14/14 constraints]
After SMT, in 17562ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 17565ms
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 132/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17841 ms. Remains : 142/150 places, 132/150 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-05
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-05 finished in 17945 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((p0&&G(p1)))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 143 transition count 133
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 143 transition count 133
Applied a total of 13 rules in 3 ms. Remains 143 /150 variables (removed 7) and now considering 133/150 (removed 17) transitions.
// Phase 1: matrix 133 rows 143 cols
[2024-06-02 22:43:33] [INFO ] Computed 17 invariants in 4 ms
[2024-06-02 22:43:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 22:43:33] [INFO ] Invariant cache hit.
[2024-06-02 22:43:33] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-02 22:43:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 22:43:35] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-06-02 22:43:35] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:43:35] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-06-02 22:43:35] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:43:35] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 22:43:36] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:43:36] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:43:36] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:43:36] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 3 ms to minimize.
[2024-06-02 22:43:37] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 133/276 variables, 143/170 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 170 constraints, problems are : Problem set: 0 solved, 132 unsolved in 7843 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/276 variables, 143/170 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 132/302 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 22:43:43] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:43:44] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-02 22:43:44] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 2 ms to minimize.
[2024-06-02 22:43:44] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:43:44] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 22:43:46] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 22:43:48] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-06-02 22:43:48] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-06-02 22:43:48] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (OVERLAPS) 0/276 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 311 constraints, problems are : Problem set: 0 solved, 132 unsolved in 14316 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 19/19 constraints]
After SMT, in 22177ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 22179ms
Starting structural reductions in LTL mode, iteration 1 : 143/150 places, 133/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22435 ms. Remains : 143/150 places, 133/150 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-06
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-06 finished in 22592 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(p0)||G(p1))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 142 transition count 132
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 142 transition count 132
Applied a total of 15 rules in 4 ms. Remains 142 /150 variables (removed 8) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 142 cols
[2024-06-02 22:43:55] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 22:43:55] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 22:43:55] [INFO ] Invariant cache hit.
[2024-06-02 22:43:56] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 22:43:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:43:57] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 3 ms to minimize.
[2024-06-02 22:43:57] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:43:57] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-06-02 22:43:57] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-06-02 22:43:58] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-06-02 22:43:58] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-02 22:43:58] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/166 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 166 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5372 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/166 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 131/297 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:44:03] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 3 ms to minimize.
[2024-06-02 22:44:04] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 3 ms to minimize.
[2024-06-02 22:44:04] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:44:05] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:44:07] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 302 constraints, problems are : Problem set: 0 solved, 131 unsolved in 11220 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
After SMT, in 16609ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 16612ms
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 132/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16943 ms. Remains : 142/150 places, 132/150 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-07
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-07 finished in 17077 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&&F((G(F(p1))||(!p2&&F(p1)))))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 146 transition count 147
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 146 transition count 147
Applied a total of 7 rules in 7 ms. Remains 146 /150 variables (removed 4) and now considering 147/150 (removed 3) transitions.
// Phase 1: matrix 147 rows 146 cols
[2024-06-02 22:44:12] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 22:44:12] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 22:44:12] [INFO ] Invariant cache hit.
[2024-06-02 22:44:13] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-06-02 22:44:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:44:16] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
[2024-06-02 22:44:16] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:44:16] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-02 22:44:16] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:44:16] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 147/293 variables, 146/171 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-02 22:44:20] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/293 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 172 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11496 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/293 variables, 146/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 146/318 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-06-02 22:44:27] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:44:27] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-06-02 22:44:27] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 323 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 14/14 constraints]
After SMT, in 21558ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 21560ms
Starting structural reductions in LTL mode, iteration 1 : 146/150 places, 147/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21900 ms. Remains : 146/150 places, 147/150 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-09
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-09 finished in 22166 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((p0&&X(X(F(p1)))))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 142 transition count 131
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 142 transition count 131
Applied a total of 16 rules in 3 ms. Remains 142 /150 variables (removed 8) and now considering 131/150 (removed 19) transitions.
// Phase 1: matrix 131 rows 142 cols
[2024-06-02 22:44:35] [INFO ] Computed 18 invariants in 3 ms
[2024-06-02 22:44:35] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 22:44:35] [INFO ] Invariant cache hit.
[2024-06-02 22:44:35] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-02 22:44:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:44:36] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
[2024-06-02 22:44:37] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:44:37] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/273 variables, 142/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 163 constraints, problems are : Problem set: 0 solved, 130 unsolved in 4981 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/273 variables, 142/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 130/293 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:44:42] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:44:42] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:44:42] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 3 ms to minimize.
[2024-06-02 22:44:42] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:44:42] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-06-02 22:44:42] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:44:44] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:44:44] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 3 ms to minimize.
[2024-06-02 22:44:44] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:44:45] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/273 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 303 constraints, problems are : Problem set: 0 solved, 130 unsolved in 11097 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 13/13 constraints]
After SMT, in 16094ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 16096ms
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16432 ms. Remains : 142/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-10
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-10 finished in 16626 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 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 148 transition count 124
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 123 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 122 transition count 122
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 54 place count 122 transition count 95
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 109 place count 94 transition count 95
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 93 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 112 place count 92 transition count 94
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 120 place count 84 transition count 75
Iterating global reduction 5 with 8 rules applied. Total rules applied 128 place count 84 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 128 place count 84 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 83 transition count 74
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 182 place count 57 transition count 48
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 196 place count 50 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 50 transition count 68
Applied a total of 197 rules in 34 ms. Remains 50 /150 variables (removed 100) and now considering 68/150 (removed 82) transitions.
// Phase 1: matrix 68 rows 50 cols
[2024-06-02 22:44:51] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 22:44:51] [INFO ] Implicit Places using invariants in 56 ms returned [15, 22, 26, 29]
[2024-06-02 22:44:51] [INFO ] Actually due to overlaps returned [15, 26, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/150 places, 68/150 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 47 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 67
Applied a total of 4 rules in 6 ms. Remains 45 /47 variables (removed 2) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 45 cols
[2024-06-02 22:44:51] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 22:44:51] [INFO ] Implicit Places using invariants in 62 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/150 places, 67/150 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 77
Applied a total of 2 rules in 5 ms. Remains 43 /44 variables (removed 1) and now considering 77/67 (removed -10) transitions.
// Phase 1: matrix 77 rows 43 cols
[2024-06-02 22:44:51] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 22:44:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 22:44:51] [INFO ] Invariant cache hit.
[2024-06-02 22:44:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:44:51] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 43/150 places, 77/150 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 337 ms. Remains : 43/150 places, 77/150 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-11
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-11 finished in 396 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((X(X(G(p0))) U p0))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 141 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 141 transition count 131
Applied a total of 17 rules in 4 ms. Remains 141 /150 variables (removed 9) and now considering 131/150 (removed 19) transitions.
// Phase 1: matrix 131 rows 141 cols
[2024-06-02 22:44:52] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 22:44:52] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 22:44:52] [INFO ] Invariant cache hit.
[2024-06-02 22:44:52] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-02 22:44:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 161 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6616 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 130/291 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:45:00] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:45:01] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:45:01] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
[2024-06-02 22:45:01] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:45:02] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:45:03] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:45:05] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 298 constraints, problems are : Problem set: 0 solved, 130 unsolved in 12609 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints]
After SMT, in 19249ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 19252ms
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19523 ms. Remains : 141/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-12 finished in 19726 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(p0)))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 150
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 141 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 141 transition count 131
Applied a total of 17 rules in 4 ms. Remains 141 /150 variables (removed 9) and now considering 131/150 (removed 19) transitions.
[2024-06-02 22:45:11] [INFO ] Invariant cache hit.
[2024-06-02 22:45:11] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 22:45:11] [INFO ] Invariant cache hit.
[2024-06-02 22:45:12] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-02 22:45:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:45:14] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:45:14] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-02 22:45:14] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 161 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6335 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 130/291 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:45:20] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 3 ms to minimize.
[2024-06-02 22:45:20] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:45:21] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:45:21] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:45:22] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 3 ms to minimize.
[2024-06-02 22:45:23] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 22:45:24] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 298 constraints, problems are : Problem set: 0 solved, 130 unsolved in 12846 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints]
After SMT, in 19193ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 19197ms
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19506 ms. Remains : 141/150 places, 131/150 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-13
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-13 finished in 19669 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||F(p1)))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 148 transition count 123
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 121 transition count 121
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 56 place count 121 transition count 96
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 107 place count 95 transition count 96
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 94 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 93 transition count 95
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 114 place count 89 transition count 91
Iterating global reduction 5 with 4 rules applied. Total rules applied 118 place count 89 transition count 91
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 168 place count 64 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 180 place count 58 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 58 transition count 76
Applied a total of 181 rules in 28 ms. Remains 58 /150 variables (removed 92) and now considering 76/150 (removed 74) transitions.
// Phase 1: matrix 76 rows 58 cols
[2024-06-02 22:45:31] [INFO ] Computed 15 invariants in 0 ms
[2024-06-02 22:45:31] [INFO ] Implicit Places using invariants in 87 ms returned [21, 29, 33, 36]
[2024-06-02 22:45:31] [INFO ] Actually due to overlaps returned [21, 33, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 99 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/150 places, 76/150 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 55 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 75
Applied a total of 4 rules in 9 ms. Remains 53 /55 variables (removed 2) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 53 cols
[2024-06-02 22:45:31] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 22:45:31] [INFO ] Implicit Places using invariants in 100 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/150 places, 75/150 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 52 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 74
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 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 73
Applied a total of 4 rules in 8 ms. Remains 50 /52 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 50 cols
[2024-06-02 22:45:31] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 22:45:31] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:45:31] [INFO ] Invariant cache hit.
[2024-06-02 22:45:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:45:31] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 50/150 places, 73/150 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 481 ms. Remains : 50/150 places, 73/150 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-15
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-15 finished in 594 ms.
All properties solved by simple procedures.
Total runtime 202545 ms.

BK_STOP 1717368332088

--------------------
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="MedleyA-PT-12"
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 MedleyA-PT-12, 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 r576-smll-171734920000092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-12.tgz
mv MedleyA-PT-12 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;