About the Execution of ITS-Tools for AutoFlight-PT-01b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 418.560 | 66445.00 | 99652.00 | 385.90 | FTTFTFFFFTTFTFTT | 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.r026-smll-171620166900067.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 AutoFlight-PT-01b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620166900067
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 22:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 26K May 18 16:42 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 AutoFlight-PT-01b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-01b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716243629979
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-20 22:20:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 22:20:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:20:32] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2024-05-20 22:20:32] [INFO ] Transformed 114 places.
[2024-05-20 22:20:32] [INFO ] Transformed 112 transitions.
[2024-05-20 22:20:32] [INFO ] Found NUPN structural information;
[2024-05-20 22:20:32] [INFO ] Parsed PT model containing 114 places and 112 transitions and 264 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 107 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-01b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 106 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 106 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 106 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 103 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 103 transition count 100
Applied a total of 23 rules in 58 ms. Remains 103 /114 variables (removed 11) and now considering 100/112 (removed 12) transitions.
// Phase 1: matrix 100 rows 103 cols
[2024-05-20 22:20:32] [INFO ] Computed 10 invariants in 20 ms
[2024-05-20 22:20:33] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-20 22:20:33] [INFO ] Invariant cache hit.
[2024-05-20 22:20:33] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-05-20 22:20:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:20:34] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 31 ms to minimize.
[2024-05-20 22:20:34] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 3 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 3 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 3 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 3 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:20:35] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:20:36] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:20:36] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-20 22:20:36] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-20 22:20:36] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-20 22:20:36] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 5 ms to minimize.
[2024-05-20 22:20:36] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:20:37] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 100/203 variables, 103/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 134 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6270 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 100/203 variables, 103/134 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 99/233 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:20:41] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:20:41] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-20 22:20:41] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 236 constraints, problems are : Problem set: 0 solved, 99 unsolved in 5279 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 24/24 constraints]
After SMT, in 11632ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 11650ms
Starting structural reductions in LTL mode, iteration 1 : 103/114 places, 100/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12228 ms. Remains : 103/114 places, 100/112 transitions.
Support contains 21 out of 103 places after structural reductions.
[2024-05-20 22:20:45] [INFO ] Flatten gal took : 42 ms
[2024-05-20 22:20:45] [INFO ] Flatten gal took : 20 ms
[2024-05-20 22:20:45] [INFO ] Input system was already deterministic with 100 transitions.
Support contains 19 out of 103 places (down from 21) after GAL structural reductions.
RANDOM walk for 2258 steps (30 resets) in 232 ms. (9 steps per ms) remains 0/12 properties
Computed a total of 32 stabilizing places and 32 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(X(G((p0&&(F(!p1) U G(p2)))))))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 95
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 95 transition count 92
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 95 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 94 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 94 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 93 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 93 transition count 90
Applied a total of 20 rules in 46 ms. Remains 93 /103 variables (removed 10) and now considering 90/100 (removed 10) transitions.
// Phase 1: matrix 90 rows 93 cols
[2024-05-20 22:20:45] [INFO ] Computed 10 invariants in 14 ms
[2024-05-20 22:20:45] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-20 22:20:45] [INFO ] Invariant cache hit.
[2024-05-20 22:20:46] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-20 22:20:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:20:46] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-20 22:20:47] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:20:47] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:20:47] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:20:47] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-20 22:20:47] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-20 22:20:47] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-20 22:20:47] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:20:48] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:20:48] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 90/183 variables, 93/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:20:49] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 114 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5476 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:20:52] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:20:52] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-20 22:20:52] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-20 22:20:52] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 90/183 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 89/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:20:54] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 208 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5966 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 16/16 constraints]
After SMT, in 11477ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 11482ms
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 90/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11778 ms. Remains : 93/103 places, 90/100 transitions.
Stuttering acceptance computed with spot in 540 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, p1, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-01b-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-01b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLCardinality-03 finished in 12437 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(G(p0)))))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 97 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 95 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 94 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 93 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 93 transition count 89
Applied a total of 21 rules in 12 ms. Remains 93 /103 variables (removed 10) and now considering 89/100 (removed 11) transitions.
// Phase 1: matrix 89 rows 93 cols
[2024-05-20 22:20:58] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 22:20:58] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-20 22:20:58] [INFO ] Invariant cache hit.
[2024-05-20 22:20:58] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-20 22:20:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:20:58] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:20:59] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 3 ms to minimize.
[2024-05-20 22:20:59] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:20:59] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-20 22:20:59] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-20 22:20:59] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-20 22:20:59] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-20 22:20:59] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-20 22:20:59] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:20:59] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-20 22:20:59] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:00] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:00] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:00] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 89/182 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:02] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/182 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 118 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5699 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/182 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 88/206 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:05] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2024-05-20 22:21:05] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:06] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 209 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5788 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 18/18 constraints]
After SMT, in 11508ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 11510ms
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11683 ms. Remains : 93/103 places, 89/100 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-01b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLCardinality-05 finished in 11851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U (G(!p0)||(!p0&&G(p1))))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 102 transition count 69
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 72 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 71 transition count 67
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 63 place count 71 transition count 51
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 95 place count 55 transition count 51
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 51 transition count 47
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 51 transition count 47
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 103 place count 51 transition count 45
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 49 transition count 45
Performed 14 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 135 place count 35 transition count 29
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 3 with 2 rules applied. Total rules applied 137 place count 34 transition count 29
Applied a total of 137 rules in 34 ms. Remains 34 /103 variables (removed 69) and now considering 29/100 (removed 71) transitions.
// Phase 1: matrix 29 rows 34 cols
[2024-05-20 22:21:10] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:21:10] [INFO ] Implicit Places using invariants in 44 ms returned [13, 21, 26, 33]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 47 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/103 places, 29/100 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 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 28 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 28 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 26 transition count 25
Applied a total of 8 rules in 7 ms. Remains 26 /30 variables (removed 4) and now considering 25/29 (removed 4) transitions.
// Phase 1: matrix 25 rows 26 cols
[2024-05-20 22:21:10] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 22:21:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-20 22:21:10] [INFO ] Invariant cache hit.
[2024-05-20 22:21:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-20 22:21:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/103 places, 25/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 26/103 places, 25/100 transitions.
Stuttering acceptance computed with spot in 90 ms :[p0, (AND (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLCardinality-06
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-01b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLCardinality-06 finished in 295 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(p0)))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 97 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 95 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 94 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 93 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 93 transition count 89
Applied a total of 21 rules in 25 ms. Remains 93 /103 variables (removed 10) and now considering 89/100 (removed 11) transitions.
// Phase 1: matrix 89 rows 93 cols
[2024-05-20 22:21:10] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 22:21:10] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-20 22:21:10] [INFO ] Invariant cache hit.
[2024-05-20 22:21:10] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-20 22:21:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:11] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-20 22:21:11] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-20 22:21:11] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
[2024-05-20 22:21:11] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-20 22:21:11] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:21:11] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-20 22:21:11] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-20 22:21:11] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:21:11] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-20 22:21:12] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-20 22:21:12] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:12] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:13] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:13] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 89/182 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:14] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/182 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 118 constraints, problems are : Problem set: 0 solved, 88 unsolved in 6130 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/182 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 88/206 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:17] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-20 22:21:18] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:21:18] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 209 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5121 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 18/18 constraints]
After SMT, in 11273ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 11276ms
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11510 ms. Remains : 93/103 places, 89/100 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 119 steps with 1 reset in 2 ms.
FORMULA AutoFlight-PT-01b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLCardinality-07 finished in 11633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(p1)||X(p0)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 97 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 94 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 94 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 93 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 93 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 92 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 92 transition count 88
Applied a total of 23 rules in 8 ms. Remains 92 /103 variables (removed 11) and now considering 88/100 (removed 12) transitions.
// Phase 1: matrix 88 rows 92 cols
[2024-05-20 22:21:21] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:21:22] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-20 22:21:22] [INFO ] Invariant cache hit.
[2024-05-20 22:21:22] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-20 22:21:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-20 22:21:22] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
[2024-05-20 22:21:22] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-20 22:21:22] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-20 22:21:23] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 22:21:23] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-20 22:21:23] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-20 22:21:23] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/180 variables, 92/109 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-20 22:21:24] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-20 22:21:24] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 2 ms to minimize.
[2024-05-20 22:21:24] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 112 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3905 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-20 22:21:26] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
[2024-05-20 22:21:26] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-20 22:21:26] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-20 22:21:26] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-20 22:21:27] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:21:27] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 88/180 variables, 92/118 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 87/205 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 205 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3551 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 16/16 constraints]
After SMT, in 7479ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 7481ms
Starting structural reductions in LTL mode, iteration 1 : 92/103 places, 88/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7706 ms. Remains : 92/103 places, 88/100 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-01b-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 504 ms.
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 25 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-01b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-01b-LTLCardinality-10 finished in 8670 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 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 102 transition count 66
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 70 place count 69 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 67 transition count 62
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 72 place count 67 transition count 47
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 102 place count 52 transition count 47
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 48 transition count 43
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 48 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 110 place count 48 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 46 transition count 41
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 146 place count 30 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 29 transition count 22
Reduce places removed 2 places and 0 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 3 with 3 rules applied. Total rules applied 150 place count 27 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 151 place count 26 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 151 place count 26 transition count 20
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 153 place count 25 transition count 20
Applied a total of 153 rules in 21 ms. Remains 25 /103 variables (removed 78) and now considering 20/100 (removed 80) transitions.
// Phase 1: matrix 20 rows 25 cols
[2024-05-20 22:21:30] [INFO ] Computed 8 invariants in 1 ms
[2024-05-20 22:21:30] [INFO ] Implicit Places using invariants in 72 ms returned [7, 12, 24]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/103 places, 20/100 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 21 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 21 transition count 19
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 20 transition count 18
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 18 transition count 16
Applied a total of 8 rules in 4 ms. Remains 18 /22 variables (removed 4) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 18 cols
[2024-05-20 22:21:30] [INFO ] Computed 5 invariants in 0 ms
[2024-05-20 22:21:30] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-20 22:21:30] [INFO ] Invariant cache hit.
[2024-05-20 22:21:30] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/103 places, 16/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 18/103 places, 16/100 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLCardinality-13
Product exploration explored 100000 steps with 9367 reset in 449 ms.
Stack based approach found an accepted trace after 9148 steps with 860 reset with depth 12 and stack size 12 in 60 ms.
FORMULA AutoFlight-PT-01b-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-01b-LTLCardinality-13 finished in 774 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((F(p0) U p1))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 67
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 70 transition count 66
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 65 place count 70 transition count 50
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 97 place count 54 transition count 50
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 50 transition count 46
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 50 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 105 place count 50 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 49 transition count 45
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 137 place count 34 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 34 transition count 28
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 3 with 2 rules applied. Total rules applied 140 place count 33 transition count 28
Applied a total of 140 rules in 21 ms. Remains 33 /103 variables (removed 70) and now considering 28/100 (removed 72) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-05-20 22:21:31] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:21:31] [INFO ] Implicit Places using invariants in 80 ms returned [14, 15, 20, 25, 32]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 81 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/103 places, 28/100 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 0 with 1 rules applied. Total rules applied 1 place count 28 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 27 transition count 27
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 25 transition count 25
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 25 transition count 25
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 24 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 24 transition count 24
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 2 with 2 rules applied. Total rules applied 10 place count 23 transition count 23
Applied a total of 10 rules in 6 ms. Remains 23 /28 variables (removed 5) and now considering 23/28 (removed 5) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-20 22:21:31] [INFO ] Computed 5 invariants in 4 ms
[2024-05-20 22:21:31] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-20 22:21:31] [INFO ] Invariant cache hit.
[2024-05-20 22:21:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-20 22:21:31] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/103 places, 23/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 23/103 places, 23/100 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01b-LTLCardinality-15
Product exploration explored 100000 steps with 10122 reset in 159 ms.
Product exploration explored 100000 steps with 10125 reset in 375 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 184 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 873 steps (78 resets) in 18 ms. (45 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 315 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2024-05-20 22:21:33] [INFO ] Invariant cache hit.
[2024-05-20 22:21:33] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-20 22:21:33] [INFO ] Invariant cache hit.
[2024-05-20 22:21:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-20 22:21:33] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-20 22:21:33] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-05-20 22:21:33] [INFO ] Invariant cache hit.
[2024-05-20 22:21:33] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 21 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/46 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 51 constraints, problems are : Problem set: 0 solved, 21 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/23 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 706ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 707ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 836 ms. Remains : 23/23 places, 23/23 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 173 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 777 steps (64 resets) in 12 ms. (59 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 335 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 10078 reset in 101 ms.
Product exploration explored 100000 steps with 10092 reset in 219 ms.
Built C files in :
/tmp/ltsmin11737391609384777464
[2024-05-20 22:21:35] [INFO ] Computing symmetric may disable matrix : 23 transitions.
[2024-05-20 22:21:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:21:35] [INFO ] Computing symmetric may enable matrix : 23 transitions.
[2024-05-20 22:21:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:21:35] [INFO ] Computing Do-Not-Accords matrix : 23 transitions.
[2024-05-20 22:21:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:21:35] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11737391609384777464
Running compilation step : cd /tmp/ltsmin11737391609384777464;'/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 515 ms.
Running link step : cd /tmp/ltsmin11737391609384777464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin11737391609384777464;'/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/stateBased1428004099198371019.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA AutoFlight-PT-01b-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-01b-LTLCardinality-15 finished in 4995 ms.
All properties solved by simple procedures.
Total runtime 64335 ms.
BK_STOP 1716243696424
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="AutoFlight-PT-01b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-01b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620166900067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-01b.tgz
mv AutoFlight-PT-01b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;