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.r468-smll-171620167100131.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 ltsminxred
Input is AutoFlight-PT-05b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167100131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 113K 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-05b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717187262161

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:27:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:27:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:27:45] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2024-05-31 20:27:45] [INFO ] Transformed 482 places.
[2024-05-31 20:27:45] [INFO ] Transformed 480 transitions.
[2024-05-31 20:27:45] [INFO ] Found NUPN structural information;
[2024-05-31 20:27:45] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 573 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-05b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 480/480 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 419 transition count 417
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 419 transition count 417
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 134 place count 419 transition count 409
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 162 place count 391 transition count 381
Iterating global reduction 1 with 28 rules applied. Total rules applied 190 place count 391 transition count 381
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 195 place count 386 transition count 376
Iterating global reduction 1 with 5 rules applied. Total rules applied 200 place count 386 transition count 376
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 205 place count 381 transition count 371
Iterating global reduction 1 with 5 rules applied. Total rules applied 210 place count 381 transition count 371
Applied a total of 210 rules in 326 ms. Remains 381 /482 variables (removed 101) and now considering 371/480 (removed 109) transitions.
// Phase 1: matrix 371 rows 381 cols
[2024-05-31 20:27:46] [INFO ] Computed 34 invariants in 39 ms
[2024-05-31 20:27:46] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-05-31 20:27:46] [INFO ] Invariant cache hit.
[2024-05-31 20:27:47] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-05-31 20:27:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-31 20:27:58] [INFO ] Deduced a trap composed of 21 places in 380 ms of which 70 ms to minimize.
[2024-05-31 20:27:58] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 5 ms to minimize.
[2024-05-31 20:27:58] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 5 ms to minimize.
[2024-05-31 20:27:59] [INFO ] Deduced a trap composed of 63 places in 317 ms of which 7 ms to minimize.
[2024-05-31 20:27:59] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 6 ms to minimize.
[2024-05-31 20:27:59] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 6 ms to minimize.
[2024-05-31 20:27:59] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 7 ms to minimize.
[2024-05-31 20:28:00] [INFO ] Deduced a trap composed of 56 places in 209 ms of which 6 ms to minimize.
[2024-05-31 20:28:00] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 6 ms to minimize.
[2024-05-31 20:28:00] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 6 ms to minimize.
[2024-05-31 20:28:00] [INFO ] Deduced a trap composed of 29 places in 272 ms of which 6 ms to minimize.
[2024-05-31 20:28:01] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 5 ms to minimize.
[2024-05-31 20:28:01] [INFO ] Deduced a trap composed of 64 places in 288 ms of which 5 ms to minimize.
[2024-05-31 20:28:01] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 5 ms to minimize.
[2024-05-31 20:28:01] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 6 ms to minimize.
[2024-05-31 20:28:02] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 9 ms to minimize.
[2024-05-31 20:28:02] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 4 ms to minimize.
[2024-05-31 20:28:02] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:28:02] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 5 ms to minimize.
[2024-05-31 20:28:03] [INFO ] Deduced a trap composed of 76 places in 306 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-31 20:28:07] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 5 ms to minimize.
[2024-05-31 20:28:08] [INFO ] Deduced a trap composed of 55 places in 260 ms of which 6 ms to minimize.
[2024-05-31 20:28:08] [INFO ] Deduced a trap composed of 59 places in 245 ms of which 5 ms to minimize.
[2024-05-31 20:28:08] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 4 ms to minimize.
[2024-05-31 20:28:08] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 6 ms to minimize.
[2024-05-31 20:28:09] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 6 ms to minimize.
[2024-05-31 20:28:09] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:28:09] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 4 ms to minimize.
[2024-05-31 20:28:10] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 5 ms to minimize.
[2024-05-31 20:28:10] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 5 ms to minimize.
[2024-05-31 20:28:11] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 5 ms to minimize.
[2024-05-31 20:28:11] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 4 ms to minimize.
[2024-05-31 20:28:11] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 4 ms to minimize.
[2024-05-31 20:28:11] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 5 ms to minimize.
[2024-05-31 20:28:11] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 6 ms to minimize.
[2024-05-31 20:28:12] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 5 ms to minimize.
[2024-05-31 20:28:12] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 5 ms to minimize.
[2024-05-31 20:28:12] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 4 ms to minimize.
[2024-05-31 20:28:14] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 4 ms to minimize.
[2024-05-31 20:28:14] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-31 20:28:16] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 5 ms to minimize.
[2024-05-31 20:28:16] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 4 ms to minimize.
[2024-05-31 20:28:16] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 4 ms to minimize.
[2024-05-31 20:28:17] [INFO ] Deduced a trap composed of 54 places in 319 ms of which 6 ms to minimize.
SMT process timed out in 30357ms, After SMT, problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 30393ms
Starting structural reductions in LTL mode, iteration 1 : 381/482 places, 371/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32077 ms. Remains : 381/482 places, 371/480 transitions.
Support contains 24 out of 381 places after structural reductions.
[2024-05-31 20:28:18] [INFO ] Flatten gal took : 124 ms
[2024-05-31 20:28:18] [INFO ] Flatten gal took : 61 ms
[2024-05-31 20:28:18] [INFO ] Input system was already deterministic with 371 transitions.
Support contains 21 out of 381 places (down from 24) after GAL structural reductions.
RANDOM walk for 40000 steps (160 resets) in 1374 ms. (29 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40003 steps (13 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
[2024-05-31 20:28:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 313/353 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:28:19] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/381 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:28:19] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 3 ms to minimize.
[2024-05-31 20:28:19] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 3 ms to minimize.
[2024-05-31 20:28:19] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:28:19] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 371/752 variables, 381/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:28:20] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/752 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/752 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/752 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1171 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 313/353 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/381 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:28:20] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 4 ms to minimize.
[2024-05-31 20:28:20] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-05-31 20:28:20] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-31 20:28:20] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-31 20:28:21] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 371/752 variables, 381/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/752 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/752 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/752 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 752/752 variables, and 427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 992 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 2199ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 322 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=53 )
Parikh walk visited 1 properties in 25 ms.
Computed a total of 95 stabilizing places and 95 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' '!(F((G(p0)&&F(G(p1)))))'
Support contains 4 out of 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 380 transition count 244
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 142 rules applied. Total rules applied 268 place count 254 transition count 228
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 279 place count 245 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 281 place count 243 transition count 226
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 281 place count 243 transition count 177
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 379 place count 194 transition count 177
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 527 place count 120 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 528 place count 119 transition count 92
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 539 place count 111 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 542 place count 108 transition count 89
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 542 place count 108 transition count 84
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 552 place count 103 transition count 84
Applied a total of 552 rules in 110 ms. Remains 103 /381 variables (removed 278) and now considering 84/371 (removed 287) transitions.
// Phase 1: matrix 84 rows 103 cols
[2024-05-31 20:28:21] [INFO ] Computed 26 invariants in 2 ms
[2024-05-31 20:28:21] [INFO ] Implicit Places using invariants in 152 ms returned [43, 60, 83, 88, 92, 97, 102]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 154 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/381 places, 84/371 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 90 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 90 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 89 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 89 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 88 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 88 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 87 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 87 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 86 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 86 transition count 74
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 24 place count 84 transition count 72
Applied a total of 24 rules in 41 ms. Remains 84 /96 variables (removed 12) and now considering 72/84 (removed 12) transitions.
// Phase 1: matrix 72 rows 84 cols
[2024-05-31 20:28:21] [INFO ] Computed 19 invariants in 2 ms
[2024-05-31 20:28:21] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-31 20:28:21] [INFO ] Invariant cache hit.
[2024-05-31 20:28:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:28:22] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/381 places, 72/371 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 600 ms. Remains : 84/381 places, 72/371 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-00
Stuttering criterion allowed to conclude after 51 steps with 1 reset in 3 ms.
FORMULA AutoFlight-PT-05b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLCardinality-00 finished in 948 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' '!((p0 U X(X((p1||((p0 U G(!p2))&&G(p3)))))))'
Support contains 7 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 379 transition count 369
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 379 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 379 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 378 transition count 367
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 378 transition count 367
Applied a total of 7 rules in 72 ms. Remains 378 /381 variables (removed 3) and now considering 367/371 (removed 4) transitions.
// Phase 1: matrix 367 rows 378 cols
[2024-05-31 20:28:22] [INFO ] Computed 34 invariants in 8 ms
[2024-05-31 20:28:22] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-31 20:28:22] [INFO ] Invariant cache hit.
[2024-05-31 20:28:23] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-05-31 20:28:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-31 20:28:31] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 4 ms to minimize.
[2024-05-31 20:28:31] [INFO ] Deduced a trap composed of 53 places in 194 ms of which 7 ms to minimize.
[2024-05-31 20:28:32] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 6 ms to minimize.
[2024-05-31 20:28:32] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 3 ms to minimize.
[2024-05-31 20:28:32] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 5 ms to minimize.
[2024-05-31 20:28:32] [INFO ] Deduced a trap composed of 53 places in 262 ms of which 5 ms to minimize.
[2024-05-31 20:28:33] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 5 ms to minimize.
[2024-05-31 20:28:33] [INFO ] Deduced a trap composed of 56 places in 211 ms of which 3 ms to minimize.
[2024-05-31 20:28:33] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 4 ms to minimize.
[2024-05-31 20:28:33] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 4 ms to minimize.
[2024-05-31 20:28:33] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 5 ms to minimize.
[2024-05-31 20:28:34] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:28:34] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 4 ms to minimize.
[2024-05-31 20:28:34] [INFO ] Deduced a trap composed of 64 places in 172 ms of which 4 ms to minimize.
[2024-05-31 20:28:34] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 4 ms to minimize.
[2024-05-31 20:28:34] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 3 ms to minimize.
[2024-05-31 20:28:35] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 5 ms to minimize.
[2024-05-31 20:28:35] [INFO ] Deduced a trap composed of 63 places in 252 ms of which 5 ms to minimize.
[2024-05-31 20:28:35] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 4 ms to minimize.
[2024-05-31 20:28:35] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-31 20:28:40] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-31 20:28:40] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:28:40] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 2 ms to minimize.
[2024-05-31 20:28:40] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-31 20:28:40] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 3 ms to minimize.
[2024-05-31 20:28:41] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 2 ms to minimize.
[2024-05-31 20:28:41] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:28:41] [INFO ] Deduced a trap composed of 58 places in 192 ms of which 4 ms to minimize.
[2024-05-31 20:28:41] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 5 ms to minimize.
[2024-05-31 20:28:42] [INFO ] Deduced a trap composed of 58 places in 258 ms of which 5 ms to minimize.
[2024-05-31 20:28:42] [INFO ] Deduced a trap composed of 63 places in 222 ms of which 4 ms to minimize.
[2024-05-31 20:28:43] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 5 ms to minimize.
[2024-05-31 20:28:43] [INFO ] Deduced a trap composed of 60 places in 277 ms of which 5 ms to minimize.
[2024-05-31 20:28:44] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 5 ms to minimize.
[2024-05-31 20:28:44] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 5 ms to minimize.
[2024-05-31 20:28:44] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 5 ms to minimize.
[2024-05-31 20:28:45] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 5 ms to minimize.
[2024-05-31 20:28:45] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-31 20:28:49] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 4 ms to minimize.
[2024-05-31 20:28:49] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 5 ms to minimize.
[2024-05-31 20:28:50] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 5 ms to minimize.
[2024-05-31 20:28:50] [INFO ] Deduced a trap composed of 63 places in 273 ms of which 5 ms to minimize.
[2024-05-31 20:28:50] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 4 ms to minimize.
[2024-05-31 20:28:50] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 5 ms to minimize.
[2024-05-31 20:28:51] [INFO ] Deduced a trap composed of 63 places in 213 ms of which 5 ms to minimize.
[2024-05-31 20:28:51] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 5 ms to minimize.
[2024-05-31 20:28:53] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 3 ms to minimize.
SMT process timed out in 30123ms, After SMT, problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 30130ms
Starting structural reductions in LTL mode, iteration 1 : 378/381 places, 367/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30896 ms. Remains : 378/381 places, 367/371 transitions.
Stuttering acceptance computed with spot in 1191 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), true, p2, (NOT p3), p2, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p3) (NOT p1)), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND p2 (NOT p3)), (AND p2 (NOT p3) p0 (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-01
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 5 ms.
FORMULA AutoFlight-PT-05b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLCardinality-01 finished in 32132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 377 transition count 367
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 377 transition count 367
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 377 transition count 365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 375 transition count 363
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 375 transition count 363
Applied a total of 14 rules in 56 ms. Remains 375 /381 variables (removed 6) and now considering 363/371 (removed 8) transitions.
// Phase 1: matrix 363 rows 375 cols
[2024-05-31 20:28:54] [INFO ] Computed 34 invariants in 7 ms
[2024-05-31 20:28:54] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-31 20:28:54] [INFO ] Invariant cache hit.
[2024-05-31 20:28:55] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-31 20:28:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:29:04] [INFO ] Deduced a trap composed of 49 places in 367 ms of which 7 ms to minimize.
[2024-05-31 20:29:04] [INFO ] Deduced a trap composed of 17 places in 374 ms of which 7 ms to minimize.
[2024-05-31 20:29:05] [INFO ] Deduced a trap composed of 62 places in 325 ms of which 6 ms to minimize.
[2024-05-31 20:29:05] [INFO ] Deduced a trap composed of 65 places in 343 ms of which 6 ms to minimize.
[2024-05-31 20:29:06] [INFO ] Deduced a trap composed of 56 places in 326 ms of which 5 ms to minimize.
[2024-05-31 20:29:06] [INFO ] Deduced a trap composed of 58 places in 314 ms of which 6 ms to minimize.
[2024-05-31 20:29:06] [INFO ] Deduced a trap composed of 55 places in 297 ms of which 5 ms to minimize.
[2024-05-31 20:29:06] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 6 ms to minimize.
[2024-05-31 20:29:07] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 5 ms to minimize.
[2024-05-31 20:29:07] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 5 ms to minimize.
[2024-05-31 20:29:07] [INFO ] Deduced a trap composed of 56 places in 334 ms of which 6 ms to minimize.
[2024-05-31 20:29:08] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 5 ms to minimize.
[2024-05-31 20:29:08] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 5 ms to minimize.
[2024-05-31 20:29:08] [INFO ] Deduced a trap composed of 22 places in 306 ms of which 6 ms to minimize.
[2024-05-31 20:29:09] [INFO ] Deduced a trap composed of 64 places in 289 ms of which 5 ms to minimize.
[2024-05-31 20:29:09] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 4 ms to minimize.
[2024-05-31 20:29:09] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 3 ms to minimize.
[2024-05-31 20:29:09] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 4 ms to minimize.
[2024-05-31 20:29:09] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 4 ms to minimize.
[2024-05-31 20:29:09] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:29:14] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 6 ms to minimize.
[2024-05-31 20:29:14] [INFO ] Deduced a trap composed of 30 places in 274 ms of which 5 ms to minimize.
[2024-05-31 20:29:15] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 6 ms to minimize.
[2024-05-31 20:29:15] [INFO ] Deduced a trap composed of 32 places in 285 ms of which 5 ms to minimize.
[2024-05-31 20:29:15] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 5 ms to minimize.
[2024-05-31 20:29:15] [INFO ] Deduced a trap composed of 61 places in 274 ms of which 5 ms to minimize.
[2024-05-31 20:29:16] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 5 ms to minimize.
[2024-05-31 20:29:16] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 5 ms to minimize.
[2024-05-31 20:29:16] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 5 ms to minimize.
[2024-05-31 20:29:16] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 4 ms to minimize.
[2024-05-31 20:29:17] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 4 ms to minimize.
[2024-05-31 20:29:17] [INFO ] Deduced a trap composed of 82 places in 275 ms of which 6 ms to minimize.
[2024-05-31 20:29:17] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 5 ms to minimize.
[2024-05-31 20:29:18] [INFO ] Deduced a trap composed of 57 places in 276 ms of which 4 ms to minimize.
[2024-05-31 20:29:18] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 2 ms to minimize.
[2024-05-31 20:29:19] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 5 ms to minimize.
[2024-05-31 20:29:19] [INFO ] Deduced a trap composed of 59 places in 195 ms of which 3 ms to minimize.
[2024-05-31 20:29:19] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:29:19] [INFO ] Deduced a trap composed of 62 places in 236 ms of which 5 ms to minimize.
[2024-05-31 20:29:19] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:29:20] [INFO ] Deduced a trap composed of 62 places in 228 ms of which 5 ms to minimize.
[2024-05-31 20:29:21] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 5 ms to minimize.
[2024-05-31 20:29:21] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 6 ms to minimize.
[2024-05-31 20:29:21] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:29:21] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 4 ms to minimize.
[2024-05-31 20:29:21] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 4 ms to minimize.
[2024-05-31 20:29:22] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 4 ms to minimize.
[2024-05-31 20:29:22] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 5 ms to minimize.
[2024-05-31 20:29:22] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 4 ms to minimize.
[2024-05-31 20:29:22] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 4 ms to minimize.
[2024-05-31 20:29:23] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 4 ms to minimize.
[2024-05-31 20:29:23] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 4 ms to minimize.
[2024-05-31 20:29:24] [INFO ] Deduced a trap composed of 59 places in 253 ms of which 5 ms to minimize.
[2024-05-31 20:29:24] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 3 ms to minimize.
[2024-05-31 20:29:24] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 4 ms to minimize.
[2024-05-31 20:29:24] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 4 ms to minimize.
[2024-05-31 20:29:25] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 4 ms to minimize.
[2024-05-31 20:29:25] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 4 ms to minimize.
[2024-05-31 20:29:25] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 4 ms to minimize.
SMT process timed out in 30062ms, After SMT, problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 30067ms
Starting structural reductions in LTL mode, iteration 1 : 375/381 places, 363/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30808 ms. Remains : 375/381 places, 363/371 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLCardinality-06 finished in 30975 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' '!(((p0||G(p1)) U X(!p0)))'
Support contains 3 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 377 transition count 367
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 377 transition count 367
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 377 transition count 365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 375 transition count 363
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 375 transition count 363
Applied a total of 14 rules in 38 ms. Remains 375 /381 variables (removed 6) and now considering 363/371 (removed 8) transitions.
[2024-05-31 20:29:25] [INFO ] Invariant cache hit.
[2024-05-31 20:29:25] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-31 20:29:25] [INFO ] Invariant cache hit.
[2024-05-31 20:29:26] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-31 20:29:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:29:35] [INFO ] Deduced a trap composed of 49 places in 372 ms of which 6 ms to minimize.
[2024-05-31 20:29:36] [INFO ] Deduced a trap composed of 17 places in 338 ms of which 6 ms to minimize.
[2024-05-31 20:29:36] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 9 ms to minimize.
[2024-05-31 20:29:36] [INFO ] Deduced a trap composed of 65 places in 363 ms of which 6 ms to minimize.
[2024-05-31 20:29:37] [INFO ] Deduced a trap composed of 56 places in 326 ms of which 6 ms to minimize.
[2024-05-31 20:29:37] [INFO ] Deduced a trap composed of 58 places in 321 ms of which 6 ms to minimize.
[2024-05-31 20:29:37] [INFO ] Deduced a trap composed of 55 places in 325 ms of which 6 ms to minimize.
[2024-05-31 20:29:38] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 6 ms to minimize.
[2024-05-31 20:29:38] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 6 ms to minimize.
[2024-05-31 20:29:38] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 5 ms to minimize.
[2024-05-31 20:29:38] [INFO ] Deduced a trap composed of 56 places in 276 ms of which 5 ms to minimize.
[2024-05-31 20:29:39] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 5 ms to minimize.
[2024-05-31 20:29:39] [INFO ] Deduced a trap composed of 60 places in 251 ms of which 5 ms to minimize.
[2024-05-31 20:29:39] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 6 ms to minimize.
[2024-05-31 20:29:40] [INFO ] Deduced a trap composed of 64 places in 342 ms of which 6 ms to minimize.
[2024-05-31 20:29:40] [INFO ] Deduced a trap composed of 62 places in 280 ms of which 6 ms to minimize.
[2024-05-31 20:29:40] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 5 ms to minimize.
[2024-05-31 20:29:41] [INFO ] Deduced a trap composed of 57 places in 244 ms of which 5 ms to minimize.
[2024-05-31 20:29:41] [INFO ] Deduced a trap composed of 62 places in 247 ms of which 5 ms to minimize.
[2024-05-31 20:29:41] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:29:46] [INFO ] Deduced a trap composed of 15 places in 301 ms of which 5 ms to minimize.
[2024-05-31 20:29:46] [INFO ] Deduced a trap composed of 30 places in 299 ms of which 5 ms to minimize.
[2024-05-31 20:29:47] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 5 ms to minimize.
[2024-05-31 20:29:47] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 5 ms to minimize.
[2024-05-31 20:29:47] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 5 ms to minimize.
[2024-05-31 20:29:47] [INFO ] Deduced a trap composed of 61 places in 236 ms of which 5 ms to minimize.
[2024-05-31 20:29:48] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 5 ms to minimize.
[2024-05-31 20:29:48] [INFO ] Deduced a trap composed of 16 places in 321 ms of which 6 ms to minimize.
[2024-05-31 20:29:48] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 4 ms to minimize.
[2024-05-31 20:29:49] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 5 ms to minimize.
[2024-05-31 20:29:49] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 5 ms to minimize.
[2024-05-31 20:29:49] [INFO ] Deduced a trap composed of 82 places in 298 ms of which 5 ms to minimize.
[2024-05-31 20:29:50] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 4 ms to minimize.
[2024-05-31 20:29:50] [INFO ] Deduced a trap composed of 57 places in 266 ms of which 5 ms to minimize.
[2024-05-31 20:29:50] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 3 ms to minimize.
[2024-05-31 20:29:51] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 4 ms to minimize.
[2024-05-31 20:29:51] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 3 ms to minimize.
[2024-05-31 20:29:51] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:29:51] [INFO ] Deduced a trap composed of 62 places in 242 ms of which 5 ms to minimize.
[2024-05-31 20:29:52] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:29:53] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 4 ms to minimize.
[2024-05-31 20:29:53] [INFO ] Deduced a trap composed of 66 places in 221 ms of which 5 ms to minimize.
[2024-05-31 20:29:53] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 4 ms to minimize.
[2024-05-31 20:29:53] [INFO ] Deduced a trap composed of 63 places in 216 ms of which 5 ms to minimize.
[2024-05-31 20:29:54] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 4 ms to minimize.
[2024-05-31 20:29:54] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:29:54] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 5 ms to minimize.
[2024-05-31 20:29:54] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 4 ms to minimize.
[2024-05-31 20:29:55] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 4 ms to minimize.
[2024-05-31 20:29:55] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 4 ms to minimize.
[2024-05-31 20:29:55] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 4 ms to minimize.
[2024-05-31 20:29:55] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 4 ms to minimize.
[2024-05-31 20:29:56] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:29:56] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 30098ms, After SMT, problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 30106ms
Starting structural reductions in LTL mode, iteration 1 : 375/381 places, 363/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30750 ms. Remains : 375/381 places, 363/371 transitions.
Stuttering acceptance computed with spot in 208 ms :[p0, p0, (AND (NOT p1) p0), p0, true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 26 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05b-LTLCardinality-08 finished in 31691 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(F(p0))))'
Support contains 2 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 378 transition count 368
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 378 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 378 transition count 367
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 376 transition count 365
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 376 transition count 365
Applied a total of 11 rules in 19 ms. Remains 376 /381 variables (removed 5) and now considering 365/371 (removed 6) transitions.
// Phase 1: matrix 365 rows 376 cols
[2024-05-31 20:29:57] [INFO ] Computed 34 invariants in 7 ms
[2024-05-31 20:29:57] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-31 20:29:57] [INFO ] Invariant cache hit.
[2024-05-31 20:29:57] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-05-31 20:29:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-31 20:30:07] [INFO ] Deduced a trap composed of 21 places in 333 ms of which 7 ms to minimize.
[2024-05-31 20:30:07] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 5 ms to minimize.
[2024-05-31 20:30:07] [INFO ] Deduced a trap composed of 16 places in 332 ms of which 5 ms to minimize.
[2024-05-31 20:30:08] [INFO ] Deduced a trap composed of 25 places in 327 ms of which 5 ms to minimize.
[2024-05-31 20:30:08] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 5 ms to minimize.
[2024-05-31 20:30:08] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 5 ms to minimize.
[2024-05-31 20:30:09] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 4 ms to minimize.
[2024-05-31 20:30:09] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:30:09] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 4 ms to minimize.
[2024-05-31 20:30:09] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 4 ms to minimize.
[2024-05-31 20:30:10] [INFO ] Deduced a trap composed of 50 places in 268 ms of which 5 ms to minimize.
[2024-05-31 20:30:12] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 4 ms to minimize.
[2024-05-31 20:30:13] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 3 ms to minimize.
[2024-05-31 20:30:13] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 13 ms to minimize.
[2024-05-31 20:30:13] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-31 20:30:20] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 4 ms to minimize.
[2024-05-31 20:30:20] [INFO ] Deduced a trap composed of 54 places in 276 ms of which 6 ms to minimize.
[2024-05-31 20:30:20] [INFO ] Deduced a trap composed of 60 places in 270 ms of which 5 ms to minimize.
[2024-05-31 20:30:21] [INFO ] Deduced a trap composed of 71 places in 228 ms of which 5 ms to minimize.
[2024-05-31 20:30:21] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 5 ms to minimize.
[2024-05-31 20:30:21] [INFO ] Deduced a trap composed of 61 places in 243 ms of which 24 ms to minimize.
[2024-05-31 20:30:22] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 5 ms to minimize.
[2024-05-31 20:30:22] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 5 ms to minimize.
[2024-05-31 20:30:24] [INFO ] Deduced a trap composed of 29 places in 245 ms of which 5 ms to minimize.
[2024-05-31 20:30:24] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 5 ms to minimize.
[2024-05-31 20:30:24] [INFO ] Deduced a trap composed of 61 places in 248 ms of which 6 ms to minimize.
[2024-05-31 20:30:25] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 5 ms to minimize.
[2024-05-31 20:30:26] [INFO ] Deduced a trap composed of 80 places in 197 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/741 variables, and 62 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-31 20:30:33] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 6 ms to minimize.
[2024-05-31 20:30:33] [INFO ] Deduced a trap composed of 51 places in 299 ms of which 6 ms to minimize.
[2024-05-31 20:30:34] [INFO ] Deduced a trap composed of 53 places in 282 ms of which 6 ms to minimize.
[2024-05-31 20:30:34] [INFO ] Deduced a trap composed of 59 places in 296 ms of which 5 ms to minimize.
[2024-05-31 20:30:34] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 5 ms to minimize.
[2024-05-31 20:30:35] [INFO ] Deduced a trap composed of 63 places in 257 ms of which 8 ms to minimize.
[2024-05-31 20:30:35] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 5 ms to minimize.
[2024-05-31 20:30:35] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 4 ms to minimize.
[2024-05-31 20:30:35] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 5 ms to minimize.
[2024-05-31 20:30:36] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 5 ms to minimize.
[2024-05-31 20:30:36] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 5 ms to minimize.
[2024-05-31 20:30:36] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 6 ms to minimize.
[2024-05-31 20:30:36] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 5 ms to minimize.
[2024-05-31 20:30:37] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 5 ms to minimize.
[2024-05-31 20:30:37] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 4 ms to minimize.
[2024-05-31 20:30:37] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 4 ms to minimize.
[2024-05-31 20:30:38] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:30:38] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:30:38] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:30:38] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-31 20:30:40] [INFO ] Deduced a trap composed of 79 places in 169 ms of which 4 ms to minimize.
[2024-05-31 20:30:40] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 4 ms to minimize.
[2024-05-31 20:30:40] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 4 ms to minimize.
[2024-05-31 20:30:41] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 4 ms to minimize.
[2024-05-31 20:30:41] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 4 ms to minimize.
[2024-05-31 20:30:41] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 3 ms to minimize.
[2024-05-31 20:30:41] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:30:42] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 4 ms to minimize.
[2024-05-31 20:30:43] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 4 ms to minimize.
[2024-05-31 20:30:44] [INFO ] Deduced a trap composed of 75 places in 209 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-31 20:30:47] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 4 ms to minimize.
[2024-05-31 20:30:47] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 3 ms to minimize.
[2024-05-31 20:30:47] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 4 ms to minimize.
[2024-05-31 20:30:47] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-05-31 20:30:47] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 4 ms to minimize.
[2024-05-31 20:30:47] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 3 ms to minimize.
[2024-05-31 20:30:48] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
[2024-05-31 20:30:48] [INFO ] Deduced a trap composed of 59 places in 260 ms of which 5 ms to minimize.
[2024-05-31 20:30:48] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 4 ms to minimize.
[2024-05-31 20:30:49] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-31 20:30:55] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/741 variables, and 103 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 0/364 constraints, Known Traps: 69/69 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 376/381 places, 365/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60931 ms. Remains : 376/381 places, 365/371 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 183 ms.
Product exploration explored 100000 steps with 33333 reset in 306 ms.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05b-LTLCardinality-10 finished in 61637 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 3 out of 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 380 transition count 241
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 146 rules applied. Total rules applied 275 place count 251 transition count 224
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 287 place count 241 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 289 place count 239 transition count 222
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 289 place count 239 transition count 174
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 385 place count 191 transition count 174
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 386 place count 190 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 387 place count 190 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 387 place count 190 transition count 172
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 389 place count 189 transition count 172
Performed 71 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 531 place count 118 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 532 place count 117 transition count 90
Applied a total of 532 rules in 70 ms. Remains 117 /381 variables (removed 264) and now considering 90/371 (removed 281) transitions.
// Phase 1: matrix 90 rows 117 cols
[2024-05-31 20:30:58] [INFO ] Computed 34 invariants in 3 ms
[2024-05-31 20:30:59] [INFO ] Implicit Places using invariants in 167 ms returned [49, 68, 85, 91, 97, 103, 109, 116]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 171 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/381 places, 90/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 103 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 103 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 102 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 102 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 101 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 101 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 100 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 100 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 98 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 98 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 97 transition count 78
Applied a total of 24 rules in 28 ms. Remains 97 /109 variables (removed 12) and now considering 78/90 (removed 12) transitions.
// Phase 1: matrix 78 rows 97 cols
[2024-05-31 20:30:59] [INFO ] Computed 26 invariants in 1 ms
[2024-05-31 20:30:59] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-31 20:30:59] [INFO ] Invariant cache hit.
[2024-05-31 20:30:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:30:59] [INFO ] Implicit Places using invariants and state equation in 291 ms returned [37, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 419 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/381 places, 78/371 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 95 transition count 76
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 4 place count 93 transition count 76
Applied a total of 4 rules in 9 ms. Remains 93 /95 variables (removed 2) and now considering 76/78 (removed 2) transitions.
// Phase 1: matrix 76 rows 93 cols
[2024-05-31 20:30:59] [INFO ] Computed 24 invariants in 2 ms
[2024-05-31 20:30:59] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-31 20:30:59] [INFO ] Invariant cache hit.
[2024-05-31 20:30:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-31 20:30:59] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 93/381 places, 76/371 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1110 ms. Remains : 93/381 places, 76/371 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-11
Product exploration explored 100000 steps with 4146 reset in 420 ms.
Product exploration explored 100000 steps with 4169 reset in 384 ms.
Computed a total of 10 stabilizing places and 3 stable transitions
Computed a total of 10 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 218 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 76/76 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-31 20:31:01] [INFO ] Invariant cache hit.
[2024-05-31 20:31:01] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-31 20:31:01] [INFO ] Invariant cache hit.
[2024-05-31 20:31:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-31 20:31:01] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-31 20:31:01] [INFO ] Redundant transitions in 2 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-31 20:31:01] [INFO ] Invariant cache hit.
[2024-05-31 20:31:01] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 2/93 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-31 20:31:02] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 76/169 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 22/140 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 140 constraints, problems are : Problem set: 0 solved, 68 unsolved in 3114 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 93/93 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 2/93 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 76/169 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 22/140 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 68/208 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-31 20:31:07] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/169 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 209 constraints, problems are : Problem set: 0 solved, 68 unsolved in 4373 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 93/93 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 2/2 constraints]
After SMT, in 7508ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 7511ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7902 ms. Remains : 93/93 places, 76/76 transitions.
Computed a total of 10 stabilizing places and 3 stable transitions
Computed a total of 10 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 218 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 250 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4164 reset in 310 ms.
Product exploration explored 100000 steps with 4138 reset in 363 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-31 20:31:10] [INFO ] Invariant cache hit.
[2024-05-31 20:31:10] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-31 20:31:10] [INFO ] Invariant cache hit.
[2024-05-31 20:31:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-31 20:31:11] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-31 20:31:11] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-31 20:31:11] [INFO ] Invariant cache hit.
[2024-05-31 20:31:11] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 2/93 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-31 20:31:11] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 76/169 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 22/140 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 140 constraints, problems are : Problem set: 0 solved, 68 unsolved in 3125 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 93/93 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 2/93 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 76/169 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 22/140 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 68/208 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-31 20:31:16] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/169 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 209 constraints, problems are : Problem set: 0 solved, 68 unsolved in 4776 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 93/93 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 2/2 constraints]
After SMT, in 7913ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 7914ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8276 ms. Remains : 93/93 places, 76/76 transitions.
Treatment of property AutoFlight-PT-05b-LTLCardinality-11 finished in 20199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 377 transition count 367
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 377 transition count 367
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 377 transition count 365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 375 transition count 363
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 375 transition count 363
Applied a total of 14 rules in 34 ms. Remains 375 /381 variables (removed 6) and now considering 363/371 (removed 8) transitions.
// Phase 1: matrix 363 rows 375 cols
[2024-05-31 20:31:19] [INFO ] Computed 34 invariants in 4 ms
[2024-05-31 20:31:19] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-31 20:31:19] [INFO ] Invariant cache hit.
[2024-05-31 20:31:19] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-31 20:31:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:31:29] [INFO ] Deduced a trap composed of 49 places in 373 ms of which 7 ms to minimize.
[2024-05-31 20:31:29] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 6 ms to minimize.
[2024-05-31 20:31:30] [INFO ] Deduced a trap composed of 62 places in 343 ms of which 6 ms to minimize.
[2024-05-31 20:31:30] [INFO ] Deduced a trap composed of 65 places in 359 ms of which 5 ms to minimize.
[2024-05-31 20:31:30] [INFO ] Deduced a trap composed of 56 places in 303 ms of which 5 ms to minimize.
[2024-05-31 20:31:31] [INFO ] Deduced a trap composed of 58 places in 302 ms of which 8 ms to minimize.
[2024-05-31 20:31:31] [INFO ] Deduced a trap composed of 55 places in 283 ms of which 6 ms to minimize.
[2024-05-31 20:31:31] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 5 ms to minimize.
[2024-05-31 20:31:32] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 6 ms to minimize.
[2024-05-31 20:31:32] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 6 ms to minimize.
[2024-05-31 20:31:32] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 5 ms to minimize.
[2024-05-31 20:31:32] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 4 ms to minimize.
[2024-05-31 20:31:33] [INFO ] Deduced a trap composed of 60 places in 244 ms of which 5 ms to minimize.
[2024-05-31 20:31:33] [INFO ] Deduced a trap composed of 22 places in 354 ms of which 6 ms to minimize.
[2024-05-31 20:31:33] [INFO ] Deduced a trap composed of 64 places in 322 ms of which 6 ms to minimize.
[2024-05-31 20:31:34] [INFO ] Deduced a trap composed of 62 places in 289 ms of which 6 ms to minimize.
[2024-05-31 20:31:34] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 5 ms to minimize.
[2024-05-31 20:31:34] [INFO ] Deduced a trap composed of 57 places in 237 ms of which 5 ms to minimize.
[2024-05-31 20:31:34] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 4 ms to minimize.
[2024-05-31 20:31:35] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:31:40] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 5 ms to minimize.
[2024-05-31 20:31:40] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 5 ms to minimize.
[2024-05-31 20:31:40] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 5 ms to minimize.
[2024-05-31 20:31:41] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 5 ms to minimize.
[2024-05-31 20:31:41] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 4 ms to minimize.
[2024-05-31 20:31:41] [INFO ] Deduced a trap composed of 61 places in 241 ms of which 4 ms to minimize.
[2024-05-31 20:31:41] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 5 ms to minimize.
[2024-05-31 20:31:42] [INFO ] Deduced a trap composed of 16 places in 285 ms of which 5 ms to minimize.
[2024-05-31 20:31:42] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 4 ms to minimize.
[2024-05-31 20:31:42] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 4 ms to minimize.
[2024-05-31 20:31:43] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 10 ms to minimize.
[2024-05-31 20:31:43] [INFO ] Deduced a trap composed of 82 places in 305 ms of which 5 ms to minimize.
[2024-05-31 20:31:43] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 4 ms to minimize.
[2024-05-31 20:31:44] [INFO ] Deduced a trap composed of 57 places in 295 ms of which 5 ms to minimize.
[2024-05-31 20:31:44] [INFO ] Deduced a trap composed of 57 places in 185 ms of which 3 ms to minimize.
[2024-05-31 20:31:44] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 4 ms to minimize.
[2024-05-31 20:31:45] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 3 ms to minimize.
[2024-05-31 20:31:45] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2024-05-31 20:31:45] [INFO ] Deduced a trap composed of 62 places in 234 ms of which 5 ms to minimize.
[2024-05-31 20:31:45] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:31:46] [INFO ] Deduced a trap composed of 62 places in 240 ms of which 4 ms to minimize.
[2024-05-31 20:31:47] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 5 ms to minimize.
[2024-05-31 20:31:47] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 4 ms to minimize.
[2024-05-31 20:31:47] [INFO ] Deduced a trap composed of 63 places in 213 ms of which 5 ms to minimize.
[2024-05-31 20:31:47] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 4 ms to minimize.
[2024-05-31 20:31:47] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 5 ms to minimize.
[2024-05-31 20:31:48] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 5 ms to minimize.
[2024-05-31 20:31:48] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 4 ms to minimize.
[2024-05-31 20:31:48] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 4 ms to minimize.
[2024-05-31 20:31:48] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 4 ms to minimize.
[2024-05-31 20:31:49] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 12 ms to minimize.
[2024-05-31 20:31:49] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/738 variables, and 86 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 52/86 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:31:55] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 4 ms to minimize.
[2024-05-31 20:31:56] [INFO ] Deduced a trap composed of 82 places in 200 ms of which 5 ms to minimize.
[2024-05-31 20:31:56] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 4 ms to minimize.
[2024-05-31 20:31:57] [INFO ] Deduced a trap composed of 59 places in 231 ms of which 4 ms to minimize.
[2024-05-31 20:31:57] [INFO ] Deduced a trap composed of 59 places in 216 ms of which 4 ms to minimize.
[2024-05-31 20:31:57] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 4 ms to minimize.
[2024-05-31 20:31:57] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 4 ms to minimize.
[2024-05-31 20:31:58] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:31:58] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:31:58] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 3 ms to minimize.
[2024-05-31 20:31:58] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 3 ms to minimize.
[2024-05-31 20:31:59] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 4 ms to minimize.
[2024-05-31 20:31:59] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 4 ms to minimize.
[2024-05-31 20:31:59] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 4 ms to minimize.
[2024-05-31 20:31:59] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 3 ms to minimize.
[2024-05-31 20:31:59] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-05-31 20:32:01] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 4 ms to minimize.
[2024-05-31 20:32:01] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 4 ms to minimize.
[2024-05-31 20:32:02] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:32:02] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:32:03] [INFO ] Deduced a trap composed of 71 places in 201 ms of which 4 ms to minimize.
[2024-05-31 20:32:04] [INFO ] Deduced a trap composed of 61 places in 209 ms of which 4 ms to minimize.
[2024-05-31 20:32:04] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (OVERLAPS) 363/738 variables, 375/484 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/738 variables, 362/846 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-31 20:32:18] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/738 variables, and 847 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 76/76 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 375/381 places, 363/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60936 ms. Remains : 375/381 places, 363/371 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 435 ms.
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05b-LTLCardinality-12 finished in 61856 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)))'
[2024-05-31 20:32:21] [INFO ] Flatten gal took : 34 ms
[2024-05-31 20:32:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-31 20:32:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 381 places, 371 transitions and 902 arcs took 7 ms.
Total runtime 276528 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutoFlight-PT-05b-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717187908530

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-05b-LTLCardinality-11
ltl formula formula --ltl=/tmp/2018/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 381 places, 371 transitions and 902 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2018/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2018/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2018/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2018/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 382 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 382, there are 389 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~242 levels ~10000 states ~39764 transitions
pnml2lts-mc( 2/ 4): ~242 levels ~20000 states ~82180 transitions
pnml2lts-mc( 2/ 4): ~242 levels ~40000 states ~172940 transitions
pnml2lts-mc( 2/ 4): ~242 levels ~80000 states ~350000 transitions
pnml2lts-mc( 2/ 4): ~242 levels ~160000 states ~773940 transitions
pnml2lts-mc( 2/ 4): ~242 levels ~320000 states ~1621844 transitions
pnml2lts-mc( 2/ 4): ~242 levels ~640000 states ~3420308 transitions
pnml2lts-mc( 2/ 4): ~242 levels ~1280000 states ~7468188 transitions
pnml2lts-mc( 2/ 4): ~242 levels ~2560000 states ~15564560 transitions
pnml2lts-mc( 2/ 4): ~243 levels ~5120000 states ~31204504 transitions
pnml2lts-mc( 2/ 4): ~243 levels ~10240000 states ~69407148 transitions
pnml2lts-mc( 1/ 4): ~244 levels ~20480000 states ~140116188 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33548252
pnml2lts-mc( 0/ 4): unique states count: 33549111
pnml2lts-mc( 0/ 4): unique transitions count: 240877060
pnml2lts-mc( 0/ 4): - self-loop count: 48
pnml2lts-mc( 0/ 4): - claim dead count: 207322600
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33549127
pnml2lts-mc( 0/ 4): - cum. max stack depth: 987
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33549127 states 240877091 transitions, fanout: 7.180
pnml2lts-mc( 0/ 4): Total exploration time 366.300 sec (366.270 sec minimum, 366.287 sec on average)
pnml2lts-mc( 0/ 4): States per second: 91589, Transitions per second: 657595
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 269.3MB, 8.4 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/20.0%
pnml2lts-mc( 0/ 4): Stored 374 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 269.3MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-05b, 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 r468-smll-171620167100131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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