Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990000442.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 165K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 10:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 10:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 113K May 5 16:51 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-00
FORMULA_NAME AutoFlight-PT-05b-01
FORMULA_NAME AutoFlight-PT-05b-02
FORMULA_NAME AutoFlight-PT-05b-03
FORMULA_NAME AutoFlight-PT-05b-04
FORMULA_NAME AutoFlight-PT-05b-05
FORMULA_NAME AutoFlight-PT-05b-06
FORMULA_NAME AutoFlight-PT-05b-07
FORMULA_NAME AutoFlight-PT-05b-08
FORMULA_NAME AutoFlight-PT-05b-09
FORMULA_NAME AutoFlight-PT-05b-10
FORMULA_NAME AutoFlight-PT-05b-11
FORMULA_NAME AutoFlight-PT-05b-12
FORMULA_NAME AutoFlight-PT-05b-13
FORMULA_NAME AutoFlight-PT-05b-14
FORMULA_NAME AutoFlight-PT-05b-15

=== Now, execution of the tool begins

BK_START 1620469555159

Running Version 0
[2021-05-08 10:25:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 10:25:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:25:56] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-08 10:25:56] [INFO ] Transformed 482 places.
[2021-05-08 10:25:56] [INFO ] Transformed 480 transitions.
[2021-05-08 10:25:56] [INFO ] Found NUPN structural information;
[2021-05-08 10:25:56] [INFO ] Parsed PT model containing 482 places and 480 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 10:25:56] [INFO ] Initial state test concluded for 3 properties.
FORMULA AutoFlight-PT-05b-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 482 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 482/482 places, 480/480 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 425 transition count 423
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 425 transition count 423
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 123 place count 425 transition count 414
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 145 place count 403 transition count 392
Iterating global reduction 1 with 22 rules applied. Total rules applied 167 place count 403 transition count 392
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 171 place count 399 transition count 388
Iterating global reduction 1 with 4 rules applied. Total rules applied 175 place count 399 transition count 388
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 176 place count 398 transition count 387
Iterating global reduction 1 with 1 rules applied. Total rules applied 177 place count 398 transition count 387
Applied a total of 177 rules in 138 ms. Remains 398 /482 variables (removed 84) and now considering 387/480 (removed 93) transitions.
// Phase 1: matrix 387 rows 398 cols
[2021-05-08 10:25:57] [INFO ] Computed 34 place invariants in 23 ms
[2021-05-08 10:25:57] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 387 rows 398 cols
[2021-05-08 10:25:57] [INFO ] Computed 34 place invariants in 4 ms
[2021-05-08 10:25:57] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
// Phase 1: matrix 387 rows 398 cols
[2021-05-08 10:25:57] [INFO ] Computed 34 place invariants in 4 ms
[2021-05-08 10:25:57] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 398/482 places, 387/480 transitions.
[2021-05-08 10:25:57] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-08 10:25:58] [INFO ] Flatten gal took : 57 ms
FORMULA AutoFlight-PT-05b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 10:25:58] [INFO ] Flatten gal took : 23 ms
[2021-05-08 10:25:58] [INFO ] Input system was already deterministic with 387 transitions.
Incomplete random walk after 100000 steps, including 404 resets, run finished after 353 ms. (steps per millisecond=283 ) properties (out of 19) seen :13
Running SMT prover for 6 properties.
// Phase 1: matrix 387 rows 398 cols
[2021-05-08 10:25:58] [INFO ] Computed 34 place invariants in 5 ms
[2021-05-08 10:25:58] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 10:25:58] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 10:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:25:58] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-08 10:25:58] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 4 ms to minimize.
[2021-05-08 10:25:58] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2021-05-08 10:25:58] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2021-05-08 10:25:59] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2021-05-08 10:25:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 398 ms
[2021-05-08 10:25:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:25:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 10:25:59] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:25:59] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2021-05-08 10:25:59] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2021-05-08 10:25:59] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 0 ms to minimize.
[2021-05-08 10:25:59] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2021-05-08 10:25:59] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2021-05-08 10:25:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 332 ms
[2021-05-08 10:25:59] [INFO ] Computed and/alt/rep : 386/542/386 causal constraints (skipped 0 transitions) in 21 ms.
[2021-05-08 10:26:01] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2021-05-08 10:26:01] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 0 ms to minimize.
[2021-05-08 10:26:01] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2021-05-08 10:26:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 268 ms
[2021-05-08 10:26:01] [INFO ] Added : 367 causal constraints over 74 iterations in 1878 ms. Result :sat
[2021-05-08 10:26:01] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2021-05-08 10:26:01] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned unsat
[2021-05-08 10:26:01] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 10:26:01] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:26:01] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-08 10:26:01] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2021-05-08 10:26:01] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2021-05-08 10:26:01] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 0 ms to minimize.
[2021-05-08 10:26:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2021-05-08 10:26:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:26:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 10:26:02] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:26:02] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-08 10:26:02] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2021-05-08 10:26:02] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 1 ms to minimize.
[2021-05-08 10:26:02] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 0 ms to minimize.
[2021-05-08 10:26:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2021-05-08 10:26:02] [INFO ] Computed and/alt/rep : 386/542/386 causal constraints (skipped 0 transitions) in 32 ms.
[2021-05-08 10:26:04] [INFO ] Added : 385 causal constraints over 77 iterations in 1786 ms. Result :sat
[2021-05-08 10:26:04] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 10:26:04] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 10:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:26:04] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-08 10:26:04] [INFO ] Computed and/alt/rep : 386/542/386 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-08 10:26:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:26:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 10:26:04] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:26:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:26:04] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-08 10:26:04] [INFO ] Computed and/alt/rep : 386/542/386 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-08 10:26:06] [INFO ] Added : 384 causal constraints over 77 iterations in 1636 ms. Result :sat
[2021-05-08 10:26:06] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 10:26:06] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:26:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:26:06] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-08 10:26:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:26:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 10:26:06] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 10:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:26:06] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-08 10:26:06] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 0 ms to minimize.
[2021-05-08 10:26:06] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2021-05-08 10:26:06] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 0 ms to minimize.
[2021-05-08 10:26:06] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 0 ms to minimize.
[2021-05-08 10:26:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 296 ms
[2021-05-08 10:26:06] [INFO ] Computed and/alt/rep : 386/542/386 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-08 10:26:08] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2021-05-08 10:26:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2021-05-08 10:26:08] [INFO ] Added : 386 causal constraints over 78 iterations in 1839 ms. Result :sat
[2021-05-08 10:26:08] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 10:26:08] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:26:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:26:08] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 0 ms to minimize.
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 0 ms to minimize.
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2021-05-08 10:26:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 522 ms
[2021-05-08 10:26:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:26:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 10:26:09] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:26:09] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 0 ms to minimize.
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 0 ms to minimize.
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2021-05-08 10:26:09] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2021-05-08 10:26:10] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2021-05-08 10:26:10] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 0 ms to minimize.
[2021-05-08 10:26:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 522 ms
[2021-05-08 10:26:10] [INFO ] Computed and/alt/rep : 386/542/386 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-08 10:26:11] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2021-05-08 10:26:11] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 0 ms to minimize.
[2021-05-08 10:26:11] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2021-05-08 10:26:12] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2021-05-08 10:26:12] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 0 ms to minimize.
[2021-05-08 10:26:12] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 0 ms to minimize.
[2021-05-08 10:26:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 536 ms
[2021-05-08 10:26:12] [INFO ] Added : 383 causal constraints over 77 iterations in 2136 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((p1&&F(G((p2 U X(p3))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 398/398 places, 387/387 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 385 transition count 374
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 385 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 385 transition count 373
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 381 transition count 369
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 381 transition count 369
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 378 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 378 transition count 366
Applied a total of 41 rules in 66 ms. Remains 378 /398 variables (removed 20) and now considering 366/387 (removed 21) transitions.
// Phase 1: matrix 366 rows 378 cols
[2021-05-08 10:26:12] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-08 10:26:12] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 366 rows 378 cols
[2021-05-08 10:26:12] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-08 10:26:12] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
// Phase 1: matrix 366 rows 378 cols
[2021-05-08 10:26:12] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-08 10:26:12] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 1 iterations. Remains : 378/398 places, 366/387 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p3)), true, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-05b-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 5}, { cond=(NOT p2), acceptance={0} source=4 dest: 6}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s72 1), p1:(EQ s120 1), p2:(EQ s105 1), p3:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 280 steps with 0 reset in 5 ms.
FORMULA AutoFlight-PT-05b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-01 finished in 848 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 398/398 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 397 transition count 247
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 156 rules applied. Total rules applied 295 place count 258 transition count 230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 305 place count 248 transition count 230
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 305 place count 248 transition count 182
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 401 place count 200 transition count 182
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 413 place count 188 transition count 170
Iterating global reduction 3 with 12 rules applied. Total rules applied 425 place count 188 transition count 170
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 425 place count 188 transition count 165
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 435 place count 183 transition count 165
Performed 69 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 573 place count 114 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 574 place count 113 transition count 86
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 13 rules applied. Total rules applied 587 place count 104 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 591 place count 100 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 591 place count 100 transition count 77
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 601 place count 95 transition count 77
Applied a total of 601 rules in 79 ms. Remains 95 /398 variables (removed 303) and now considering 77/387 (removed 310) transitions.
// Phase 1: matrix 77 rows 95 cols
[2021-05-08 10:26:13] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:26:13] [INFO ] Implicit Places using invariants in 58 ms returned [38, 55, 72, 76, 80, 85, 89, 94]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 59 ms to find 8 implicit places.
[2021-05-08 10:26:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 77 rows 87 cols
[2021-05-08 10:26:13] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 10:26:13] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 87/398 places, 77/387 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 71
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 80 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 79 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 78 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 78 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 77 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 76 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 76 transition count 66
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 75 transition count 65
Applied a total of 24 rules in 22 ms. Remains 75 /87 variables (removed 12) and now considering 65/77 (removed 12) transitions.
// Phase 1: matrix 65 rows 75 cols
[2021-05-08 10:26:13] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 10:26:13] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 65 rows 75 cols
[2021-05-08 10:26:13] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 10:26:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 10:26:13] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 75/398 places, 65/387 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s18 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-03 finished in 355 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 398/398 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 397 transition count 250
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 153 rules applied. Total rules applied 289 place count 261 transition count 233
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 300 place count 251 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 301 place count 250 transition count 232
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 301 place count 250 transition count 182
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 401 place count 200 transition count 182
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 412 place count 189 transition count 171
Iterating global reduction 4 with 11 rules applied. Total rules applied 423 place count 189 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 423 place count 189 transition count 168
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 429 place count 186 transition count 168
Performed 70 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 569 place count 116 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 570 place count 115 transition count 88
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 13 rules applied. Total rules applied 583 place count 106 transition count 84
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 587 place count 102 transition count 84
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 587 place count 102 transition count 79
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 597 place count 97 transition count 79
Applied a total of 597 rules in 36 ms. Remains 97 /398 variables (removed 301) and now considering 79/387 (removed 308) transitions.
// Phase 1: matrix 79 rows 97 cols
[2021-05-08 10:26:13] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:26:13] [INFO ] Implicit Places using invariants in 57 ms returned [40, 57, 74, 78, 82, 87, 91, 96]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 58 ms to find 8 implicit places.
[2021-05-08 10:26:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 79 rows 89 cols
[2021-05-08 10:26:13] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 10:26:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 89/398 places, 79/387 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 83 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 83 transition count 73
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 14 place count 82 transition count 72
Applied a total of 14 rules in 5 ms. Remains 82 /89 variables (removed 7) and now considering 72/79 (removed 7) transitions.
// Phase 1: matrix 72 rows 82 cols
[2021-05-08 10:26:13] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 10:26:13] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 72 rows 82 cols
[2021-05-08 10:26:13] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 10:26:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 10:26:13] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 82/398 places, 72/387 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : AutoFlight-PT-05b-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s37 1), p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-05 finished in 311 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 398/398 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 397 transition count 248
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 152 rules applied. Total rules applied 290 place count 259 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 298 place count 251 transition count 234
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 298 place count 251 transition count 186
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 394 place count 203 transition count 186
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 406 place count 191 transition count 174
Iterating global reduction 3 with 12 rules applied. Total rules applied 418 place count 191 transition count 174
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 418 place count 191 transition count 169
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 428 place count 186 transition count 169
Performed 70 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 568 place count 116 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 570 place count 115 transition count 90
Applied a total of 570 rules in 28 ms. Remains 115 /398 variables (removed 283) and now considering 90/387 (removed 297) transitions.
// Phase 1: matrix 90 rows 115 cols
[2021-05-08 10:26:13] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-08 10:26:13] [INFO ] Implicit Places using invariants in 59 ms returned [37, 38, 39, 40, 44, 45, 46, 47, 48, 49, 66, 83, 89, 95, 101, 107, 114]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 60 ms to find 17 implicit places.
[2021-05-08 10:26:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 90 rows 98 cols
[2021-05-08 10:26:13] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 10:26:13] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 98/398 places, 90/387 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 98 transition count 81
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 89 transition count 81
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 83 transition count 75
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 83 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 82 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 82 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 81 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 81 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 80 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 80 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 79 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 79 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 78 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 78 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 77 transition count 69
Applied a total of 42 rules in 12 ms. Remains 77 /98 variables (removed 21) and now considering 69/90 (removed 21) transitions.
// Phase 1: matrix 69 rows 77 cols
[2021-05-08 10:26:13] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-08 10:26:13] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 69 rows 77 cols
[2021-05-08 10:26:13] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 10:26:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-08 10:26:14] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 77/398 places, 69/387 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s34 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-07 finished in 269 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 398/398 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 397 transition count 247
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 155 rules applied. Total rules applied 294 place count 258 transition count 231
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 304 place count 248 transition count 231
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 304 place count 248 transition count 183
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 400 place count 200 transition count 183
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 412 place count 188 transition count 171
Iterating global reduction 3 with 12 rules applied. Total rules applied 424 place count 188 transition count 171
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 424 place count 188 transition count 166
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 434 place count 183 transition count 166
Performed 69 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 572 place count 114 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 573 place count 113 transition count 87
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 13 rules applied. Total rules applied 586 place count 104 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 590 place count 100 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 590 place count 100 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 600 place count 95 transition count 78
Applied a total of 600 rules in 31 ms. Remains 95 /398 variables (removed 303) and now considering 78/387 (removed 309) transitions.
// Phase 1: matrix 78 rows 95 cols
[2021-05-08 10:26:14] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-08 10:26:14] [INFO ] Implicit Places using invariants in 46 ms returned [38, 55, 72, 76, 80, 85, 89, 94]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 47 ms to find 8 implicit places.
[2021-05-08 10:26:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 78 rows 87 cols
[2021-05-08 10:26:14] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 10:26:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 87/398 places, 78/387 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 72
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 80 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 80 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 79 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 79 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 78 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 78 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 77 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 77 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 76 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 76 transition count 67
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 75 transition count 66
Applied a total of 24 rules in 21 ms. Remains 75 /87 variables (removed 12) and now considering 66/78 (removed 12) transitions.
// Phase 1: matrix 66 rows 75 cols
[2021-05-08 10:26:14] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 10:26:14] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 66 rows 75 cols
[2021-05-08 10:26:14] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 10:26:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 10:26:14] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 75/398 places, 66/387 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-08 finished in 260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U G((p1&&(p2 U G(p3))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 398/398 places, 387/387 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 384 transition count 373
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 384 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 384 transition count 372
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 380 transition count 368
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 380 transition count 368
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 378 transition count 366
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 378 transition count 366
Applied a total of 41 rules in 42 ms. Remains 378 /398 variables (removed 20) and now considering 366/387 (removed 21) transitions.
// Phase 1: matrix 366 rows 378 cols
[2021-05-08 10:26:14] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-08 10:26:14] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 366 rows 378 cols
[2021-05-08 10:26:14] [INFO ] Computed 34 place invariants in 6 ms
[2021-05-08 10:26:14] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
// Phase 1: matrix 366 rows 378 cols
[2021-05-08 10:26:14] [INFO ] Computed 34 place invariants in 5 ms
[2021-05-08 10:26:15] [INFO ] Dead Transitions using invariants and state equation in 226 ms returned []
Finished structural reductions, in 1 iterations. Remains : 378/398 places, 366/387 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (NOT p3), true, (NOT p3), (NOT p3), (OR (AND p0 (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p3) p2 (NOT p1) (NOT p0)), (AND p0 p2 (NOT p3))]
Running random walk in product with property : AutoFlight-PT-05b-10 automaton TGBA [mat=[[{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={0, 1} source=0 dest: 3}, { cond=(AND p1 p3 p2), acceptance={1} source=0 dest: 3}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p1 p3 (NOT p2)), acceptance={1} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p3 p2), acceptance={1} source=3 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={1} source=3 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=4 dest: 7}, { cond=(AND p1 p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=6 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2))), acceptance={} source=6 dest: 1}, { cond=(AND p1 p3 p2), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p1 p3 p2), acceptance={1} source=6 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p1) p3) (AND p3 (NOT p2))), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p1) p3) (AND p3 (NOT p2))), acceptance={1} source=6 dest: 6}, { cond=(AND p1 p3 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 p3 p2), acceptance={} source=6 dest: 11}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 7}, { cond=p3, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=9 dest: 9}, { cond=(AND p3 p2), acceptance={1} source=9 dest: 9}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=10 dest: 7}, { cond=(AND p1 p3 (NOT p2) p0), acceptance={} source=10 dest: 8}, { cond=(AND p1 p2 p0), acceptance={} source=10 dest: 9}, { cond=(OR (AND p1 p3 p0) (AND p1 p2 p0)), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p1) p3 p2 (NOT p0)), acceptance={} source=11 dest: 8}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND p1 p3 p2 (NOT p0)), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p1) p3 p2 p0), acceptance={} source=12 dest: 8}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=12 dest: 10}, { cond=(AND p1 p3 p2 p0), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(EQ s182 1), p3:(EQ s124 1), p2:(AND (EQ s157 1) (EQ s302 1)), p0:(EQ s138 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33397 reset in 343 ms.
Product exploration explored 100000 steps with 33286 reset in 291 ms.
Knowledge obtained : [(NOT p1), (NOT p3), (NOT p2), p0]
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (NOT p3), true, (NOT p3), (NOT p3), (OR (AND p0 (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p3) p2 (NOT p1) (NOT p0)), (AND p0 p2 (NOT p3))]
Product exploration explored 100000 steps with 33342 reset in 257 ms.
Product exploration explored 100000 steps with 33294 reset in 260 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (NOT p3), true, (NOT p3), (NOT p3), (OR (AND p0 (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p3) p2 (NOT p1) (NOT p0)), (AND p0 p2 (NOT p3))]
Support contains 5 out of 378 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 378/378 places, 366/366 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 378 transition count 366
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 10 rules applied. Total rules applied 126 place count 378 transition count 361
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 126 place count 378 transition count 386
Deduced a syphon composed of 173 places in 1 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 178 place count 378 transition count 386
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 272 place count 284 transition count 292
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 366 place count 284 transition count 292
Performed 88 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 454 place count 284 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 455 place count 284 transition count 282
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 510 place count 229 transition count 227
Deduced a syphon composed of 112 places in 0 ms
Iterating global reduction 3 with 55 rules applied. Total rules applied 565 place count 229 transition count 227
Deduced a syphon composed of 112 places in 0 ms
Applied a total of 565 rules in 57 ms. Remains 229 /378 variables (removed 149) and now considering 227/366 (removed 139) transitions.
[2021-05-08 10:26:17] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 227 rows 229 cols
[2021-05-08 10:26:17] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-08 10:26:17] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/378 places, 227/366 transitions.
Product exploration explored 100000 steps with 33268 reset in 867 ms.
Product exploration explored 100000 steps with 33365 reset in 826 ms.
[2021-05-08 10:26:19] [INFO ] Flatten gal took : 24 ms
[2021-05-08 10:26:19] [INFO ] Flatten gal took : 17 ms
[2021-05-08 10:26:19] [INFO ] Time to serialize gal into /tmp/LTL14498119289699957886.gal : 9 ms
[2021-05-08 10:26:19] [INFO ] Time to serialize properties into /tmp/LTL9727869519386333386.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14498119289699957886.gal, -t, CGAL, -LTL, /tmp/LTL9727869519386333386.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14498119289699957886.gal -t CGAL -LTL /tmp/LTL9727869519386333386.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("(p210==0)"))U(G(("(p271==1)")&&(("((p238==1)&&(p401==1))")U(G("(p191==1)")))))))
Formula 0 simplified : !(X"(p210==0)" U G("(p271==1)" & ("((p238==1)&&(p401==1))" U G"(p191==1)")))
Detected timeout of ITS tools.
[2021-05-08 10:26:34] [INFO ] Flatten gal took : 17 ms
[2021-05-08 10:26:34] [INFO ] Applying decomposition
[2021-05-08 10:26:34] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11251341567319598913.txt, -o, /tmp/graph11251341567319598913.bin, -w, /tmp/graph11251341567319598913.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11251341567319598913.bin, -l, -1, -v, -w, /tmp/graph11251341567319598913.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:26:34] [INFO ] Decomposing Gal with order
[2021-05-08 10:26:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:26:34] [INFO ] Removed a total of 71 redundant transitions.
[2021-05-08 10:26:34] [INFO ] Flatten gal took : 57 ms
[2021-05-08 10:26:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-08 10:26:34] [INFO ] Time to serialize gal into /tmp/LTL2019543874716509074.gal : 6 ms
[2021-05-08 10:26:34] [INFO ] Time to serialize properties into /tmp/LTL6479245063694276305.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2019543874716509074.gal, -t, CGAL, -LTL, /tmp/LTL6479245063694276305.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2019543874716509074.gal -t CGAL -LTL /tmp/LTL6479245063694276305.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X("(i13.u58.p210==0)"))U(G(("(i15.u76.p271==1)")&&(("((i2.u65.p238==1)&&(i2.u127.p401==1))")U(G("(i12.u53.p191==1)")))))))
Formula 0 simplified : !(X"(i13.u58.p210==0)" U G("(i15.u76.p271==1)" & ("((i2.u65.p238==1)&&(i2.u127.p401==1))" U G"(i12.u53.p191==1)")))
Reverse transition relation is NOT exact ! Due to transitions t125, t148, t151, t162, t165, t205, t227, t251, t276, t293, t374, t375, t376, t377, t378, t379, i0.t124, i0.t122, i1.t138, i1.t137, i1.t135, i2.t178, i2.t177, i2.t175, i3.t220, i3.t198, i3.u44.t16, i3.u44.t223, i3.u55.t20, i3.u55.t201, i4.u14.t2, i4.u14.t296, i5.u12.t1, i5.u12.t304, i6.t289, i6.u17.t284, i7.u23.t6, i7.u23.t279, i8.t269, i8.t244, i8.u24.t7, i8.u24.t272, i8.u35.t12, i8.u35.t247, i9.t265, i9.t240, i9.t216, i9.u27.t259, i9.u39.t235, i9.u47.t213, i10.u31.t10, i10.u31.t254, i11.u41.t15, i11.u41.t230, i12.u52.t19, i12.u52.t208, i13.t22, i13.t21, i13.u60.t189, i13.u60.t191, i14.t164, i15.t150, i17.i0.i0.t117, i19.t97, i19.u124.t88, i20.t36, i20.u132.t77, i21.u142.t66, i22.t55, i23.t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/296/70/366
Computing Next relation with stutter on 800 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11878497607491194039
[2021-05-08 10:26:50] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11878497607491194039
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11878497607491194039]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11878497607491194039] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11878497607491194039] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property AutoFlight-PT-05b-10 finished in 42180 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 398/398 places, 387/387 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 383 transition count 372
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 383 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 383 transition count 371
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 378 transition count 366
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 378 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 375 transition count 363
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 375 transition count 363
Applied a total of 47 rules in 28 ms. Remains 375 /398 variables (removed 23) and now considering 363/387 (removed 24) transitions.
// Phase 1: matrix 363 rows 375 cols
[2021-05-08 10:26:57] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-08 10:26:57] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 363 rows 375 cols
[2021-05-08 10:26:57] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-08 10:26:57] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
// Phase 1: matrix 363 rows 375 cols
[2021-05-08 10:26:57] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-08 10:26:57] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Finished structural reductions, in 1 iterations. Remains : 375/398 places, 363/387 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s164 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 339 ms.
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 324 ms.
Product exploration explored 100000 steps with 50000 reset in 331 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 375 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 375/375 places, 363/363 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 375 transition count 363
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 10 rules applied. Total rules applied 126 place count 375 transition count 358
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 126 place count 375 transition count 386
Deduced a syphon composed of 171 places in 0 ms
Iterating global reduction 2 with 50 rules applied. Total rules applied 176 place count 375 transition count 386
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 268 place count 283 transition count 294
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 2 with 92 rules applied. Total rules applied 360 place count 283 transition count 294
Performed 89 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 449 place count 283 transition count 284
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 507 place count 225 transition count 226
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 565 place count 225 transition count 226
Deduced a syphon composed of 110 places in 0 ms
Applied a total of 565 rules in 33 ms. Remains 225 /375 variables (removed 150) and now considering 226/363 (removed 137) transitions.
[2021-05-08 10:26:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 226 rows 225 cols
[2021-05-08 10:26:59] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-08 10:26:59] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
Finished structural reductions, in 1 iterations. Remains : 225/375 places, 226/363 transitions.
Product exploration explored 100000 steps with 50000 reset in 1141 ms.
Product exploration explored 100000 steps with 50000 reset in 1123 ms.
[2021-05-08 10:27:01] [INFO ] Flatten gal took : 14 ms
[2021-05-08 10:27:01] [INFO ] Flatten gal took : 12 ms
[2021-05-08 10:27:01] [INFO ] Time to serialize gal into /tmp/LTL16486300641730694030.gal : 1 ms
[2021-05-08 10:27:01] [INFO ] Time to serialize properties into /tmp/LTL3796508142401690072.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16486300641730694030.gal, -t, CGAL, -LTL, /tmp/LTL3796508142401690072.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16486300641730694030.gal -t CGAL -LTL /tmp/LTL3796508142401690072.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p252!=1)"))))
Formula 0 simplified : !XF"(p252!=1)"
Detected timeout of ITS tools.
[2021-05-08 10:27:22] [INFO ] Flatten gal took : 5928 ms
[2021-05-08 10:27:22] [INFO ] Applying decomposition
[2021-05-08 10:27:22] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7933905416270001547.txt, -o, /tmp/graph7933905416270001547.bin, -w, /tmp/graph7933905416270001547.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7933905416270001547.bin, -l, -1, -v, -w, /tmp/graph7933905416270001547.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:27:22] [INFO ] Decomposing Gal with order
[2021-05-08 10:27:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:27:22] [INFO ] Removed a total of 75 redundant transitions.
[2021-05-08 10:27:22] [INFO ] Flatten gal took : 26 ms
[2021-05-08 10:27:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-08 10:27:23] [INFO ] Time to serialize gal into /tmp/LTL5211223827742080637.gal : 780 ms
[2021-05-08 10:27:23] [INFO ] Time to serialize properties into /tmp/LTL12083886436300996978.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5211223827742080637.gal, -t, CGAL, -LTL, /tmp/LTL12083886436300996978.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5211223827742080637.gal -t CGAL -LTL /tmp/LTL12083886436300996978.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i12.i1.u70.p252!=1)"))))
Formula 0 simplified : !XF"(i12.i1.u70.p252!=1)"
Reverse transition relation is NOT exact ! Due to transitions t135, t138, t162, t165, t205, t227, t244, t251, t293, t374, t375, t376, t377, t378, t379, i0.t178, i0.t175, i0.i2.t177, i1.t220, i1.t198, i1.i1.u46.t16, i1.i1.u46.t223, i1.i2.u56.t20, i1.i2.u56.t201, i2.u32.t10, i2.u32.t254, i3.t276, i3.t269, i3.i1.u23.t6, i3.i1.u23.t279, i3.i2.u26.t7, i3.i2.u26.t272, i4.u13.t1, i4.u13.t304, i5.u17.t2, i5.u17.t296, i6.t289, i6.u20.t284, i7.i1.t265, i7.i1.u30.t259, i7.i2.t240, i7.i2.u38.t235, i8.u36.t12, i8.u36.t247, i9.u43.t15, i9.u43.t230, i10.i0.t216, i10.i0.u49.t213, i10.i1.t194, i10.i1.u59.t189, i11.u52.t19, i11.u52.t208, i12.i1.t164, i13.t151, i13.t148, i13.i2.t150, i14.i1.t137, i15.t125, i15.t122, i15.i2.t124, i17.t97, i18.i0.t117, i20.i0.t88, i21.i1.t77, i21.i3.t55, i22.i0.t66, i23.i1.t44, i23.i2.t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/295/68/363
Computing Next relation with stutter on 800 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
602 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.06106,276852,1,0,718819,239,3766,753387,113,540,1946860
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-05b-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-05b-11 finished in 34360 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 398/398 places, 387/387 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 384 transition count 373
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 384 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 384 transition count 372
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 380 transition count 368
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 380 transition count 368
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 378 transition count 366
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 378 transition count 366
Applied a total of 41 rules in 23 ms. Remains 378 /398 variables (removed 20) and now considering 366/387 (removed 21) transitions.
// Phase 1: matrix 366 rows 378 cols
[2021-05-08 10:27:30] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-08 10:27:30] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 366 rows 378 cols
[2021-05-08 10:27:30] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-08 10:27:31] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
// Phase 1: matrix 366 rows 378 cols
[2021-05-08 10:27:31] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-08 10:27:31] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 1 iterations. Remains : 378/398 places, 366/387 transitions.
Stuttering acceptance computed with spot in 7957 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 241 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-12 finished in 8412 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 398/398 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 397 transition count 246
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 157 rules applied. Total rules applied 297 place count 257 transition count 229
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 307 place count 247 transition count 229
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 307 place count 247 transition count 181
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 403 place count 199 transition count 181
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 414 place count 188 transition count 170
Iterating global reduction 3 with 11 rules applied. Total rules applied 425 place count 188 transition count 170
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 425 place count 188 transition count 166
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 433 place count 184 transition count 166
Performed 70 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 573 place count 114 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 574 place count 113 transition count 86
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 13 rules applied. Total rules applied 587 place count 104 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 591 place count 100 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 591 place count 100 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 601 place count 95 transition count 77
Applied a total of 601 rules in 29 ms. Remains 95 /398 variables (removed 303) and now considering 77/387 (removed 310) transitions.
// Phase 1: matrix 77 rows 95 cols
[2021-05-08 10:27:39] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:27:39] [INFO ] Implicit Places using invariants in 55 ms returned [38, 55, 72, 76, 80, 85, 89, 94]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 55 ms to find 8 implicit places.
[2021-05-08 10:27:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 77 rows 87 cols
[2021-05-08 10:27:39] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 10:27:39] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 87/398 places, 77/387 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 71
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 80 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 79 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 78 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 78 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 77 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 76 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 76 transition count 66
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 75 transition count 65
Applied a total of 24 rules in 10 ms. Remains 75 /87 variables (removed 12) and now considering 65/77 (removed 12) transitions.
// Phase 1: matrix 65 rows 75 cols
[2021-05-08 10:27:39] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 10:27:39] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 65 rows 75 cols
[2021-05-08 10:27:39] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 10:27:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 10:27:39] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 75/398 places, 65/387 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-14 finished in 258 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 398/398 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 397 transition count 248
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 155 rules applied. Total rules applied 293 place count 259 transition count 231
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 304 place count 249 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 305 place count 248 transition count 230
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 305 place count 248 transition count 183
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 399 place count 201 transition count 183
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 411 place count 189 transition count 171
Iterating global reduction 4 with 12 rules applied. Total rules applied 423 place count 189 transition count 171
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 423 place count 189 transition count 166
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 433 place count 184 transition count 166
Performed 70 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 573 place count 114 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 574 place count 113 transition count 86
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 13 rules applied. Total rules applied 587 place count 104 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 591 place count 100 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 591 place count 100 transition count 77
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 601 place count 95 transition count 77
Applied a total of 601 rules in 26 ms. Remains 95 /398 variables (removed 303) and now considering 77/387 (removed 310) transitions.
// Phase 1: matrix 77 rows 95 cols
[2021-05-08 10:27:39] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:27:39] [INFO ] Implicit Places using invariants in 79 ms returned [38, 55, 72, 76, 80, 85, 89, 94]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 81 ms to find 8 implicit places.
[2021-05-08 10:27:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 77 rows 87 cols
[2021-05-08 10:27:39] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 10:27:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 87/398 places, 77/387 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 71
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 80 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 79 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 78 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 78 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 77 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 76 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 76 transition count 66
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 75 transition count 65
Applied a total of 24 rules in 11 ms. Remains 75 /87 variables (removed 12) and now considering 65/77 (removed 12) transitions.
// Phase 1: matrix 65 rows 75 cols
[2021-05-08 10:27:39] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 10:27:39] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 65 rows 75 cols
[2021-05-08 10:27:39] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 10:27:39] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 75/398 places, 65/387 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s32 1), p0:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-15 finished in 366 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8184682895327326910
[2021-05-08 10:27:39] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2021-05-08 10:27:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 10:27:39] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2021-05-08 10:27:39] [INFO ] Applying decomposition
[2021-05-08 10:27:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 10:27:39] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18180396509925640057.txt, -o, /tmp/graph18180396509925640057.bin, -w, /tmp/graph18180396509925640057.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18180396509925640057.bin, -l, -1, -v, -w, /tmp/graph18180396509925640057.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:27:39] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
[2021-05-08 10:27:39] [INFO ] Decomposing Gal with order
[2021-05-08 10:27:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:27:39] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 10:27:39] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8184682895327326910
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8184682895327326910]
[2021-05-08 10:27:39] [INFO ] Removed a total of 63 redundant transitions.
[2021-05-08 10:27:39] [INFO ] Flatten gal took : 21 ms
[2021-05-08 10:27:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-08 10:27:40] [INFO ] Time to serialize gal into /tmp/LTLFireability12410198030172144050.gal : 2 ms
[2021-05-08 10:27:40] [INFO ] Time to serialize properties into /tmp/LTLFireability3909134153377049834.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability12410198030172144050.gal, -t, CGAL, -LTL, /tmp/LTLFireability3909134153377049834.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability12410198030172144050.gal -t CGAL -LTL /tmp/LTLFireability3909134153377049834.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X("(i12.u60.p210==0)"))U(G(("(i14.i1.u77.p271==1)")&&(("((i0.i2.u67.p238==1)&&(i0.i2.u131.p401==1))")U(G("(i10.u53.p191==1)")))))))
Formula 0 simplified : !(X"(i12.u60.p210==0)" U G("(i14.i1.u77.p271==1)" & ("((i0.i2.u67.p238==1)&&(i0.i2.u131.p401==1))" U G"(i10.u53.p191==1)")))
Compilation finished in 1966 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8184682895327326910]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X((LTLAPp0==true)) U [](((LTLAPp1==true)&&((LTLAPp2==true) U []((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8184682895327326910]
LTSmin run took 554 ms.
FORMULA AutoFlight-PT-05b-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620469663583

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037990000442"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;