fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037990000402
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for AutoFlight-PT-03a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
479.500 21250.00 45451.00 357.60 TFFFTFFFFFFFTFFF normal

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-162037990000402.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-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.0K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 23K 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-03a-00
FORMULA_NAME AutoFlight-PT-03a-01
FORMULA_NAME AutoFlight-PT-03a-02
FORMULA_NAME AutoFlight-PT-03a-03
FORMULA_NAME AutoFlight-PT-03a-04
FORMULA_NAME AutoFlight-PT-03a-05
FORMULA_NAME AutoFlight-PT-03a-06
FORMULA_NAME AutoFlight-PT-03a-07
FORMULA_NAME AutoFlight-PT-03a-08
FORMULA_NAME AutoFlight-PT-03a-09
FORMULA_NAME AutoFlight-PT-03a-10
FORMULA_NAME AutoFlight-PT-03a-11
FORMULA_NAME AutoFlight-PT-03a-12
FORMULA_NAME AutoFlight-PT-03a-13
FORMULA_NAME AutoFlight-PT-03a-14
FORMULA_NAME AutoFlight-PT-03a-15

=== Now, execution of the tool begins

BK_START 1620466985297

Running Version 0
[2021-05-08 09:43:08] [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 09:43:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 09:43:08] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-08 09:43:08] [INFO ] Transformed 82 places.
[2021-05-08 09:43:08] [INFO ] Transformed 80 transitions.
[2021-05-08 09:43:08] [INFO ] Found NUPN structural information;
[2021-05-08 09:43:08] [INFO ] Parsed PT model containing 82 places and 80 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 09:43:08] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 15 transitions
Reduce redundant transitions removed 15 transitions.
FORMULA AutoFlight-PT-03a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 65/65 transitions.
Applied a total of 0 rules in 13 ms. Remains 82 /82 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 82 cols
[2021-05-08 09:43:08] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-08 09:43:08] [INFO ] Implicit Places using invariants in 180 ms returned [30, 61, 67, 73, 79]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 204 ms to find 5 implicit places.
// Phase 1: matrix 65 rows 77 cols
[2021-05-08 09:43:08] [INFO ] Computed 17 place invariants in 6 ms
[2021-05-08 09:43:08] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Starting structural reductions, iteration 1 : 77/82 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 76 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 64
Applied a total of 2 rules in 9 ms. Remains 76 /77 variables (removed 1) and now considering 64/65 (removed 1) transitions.
// Phase 1: matrix 64 rows 76 cols
[2021-05-08 09:43:08] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-08 09:43:08] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 64 rows 76 cols
[2021-05-08 09:43:09] [INFO ] Computed 17 place invariants in 10 ms
[2021-05-08 09:43:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-08 09:43:09] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 76/82 places, 64/65 transitions.
[2021-05-08 09:43:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-08 09:43:09] [INFO ] Flatten gal took : 64 ms
FORMULA AutoFlight-PT-03a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 09:43:09] [INFO ] Flatten gal took : 11 ms
[2021-05-08 09:43:09] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 100000 steps, including 3609 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 30) seen :28
Running SMT prover for 2 properties.
// Phase 1: matrix 64 rows 76 cols
[2021-05-08 09:43:10] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 09:43:10] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2021-05-08 09:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:43:10] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-08 09:43:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-08 09:43:10] [INFO ] [Real]Added 14 Read/Feed constraints in 18 ms returned sat
[2021-05-08 09:43:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:43:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-08 09:43:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:43:10] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-08 09:43:10] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2021-05-08 09:43:10] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2021-05-08 09:43:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2021-05-08 09:43:10] [INFO ] Computed and/alt/rep : 63/162/63 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-08 09:43:10] [INFO ] Added : 63 causal constraints over 13 iterations in 216 ms. Result :sat
[2021-05-08 09:43:10] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p1&&X((p1 U (F(p3)||G(p1)||p2))))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 74 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 62
Applied a total of 4 rules in 5 ms. Remains 74 /76 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 74 cols
[2021-05-08 09:43:10] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 09:43:10] [INFO ] Implicit Places using invariants in 145 ms returned [7, 14, 21, 24, 27, 46, 73]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 146 ms to find 7 implicit places.
// Phase 1: matrix 62 rows 67 cols
[2021-05-08 09:43:10] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-08 09:43:11] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Starting structural reductions, iteration 1 : 67/76 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 57 transition count 52
Applied a total of 20 rules in 37 ms. Remains 57 /67 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 57 cols
[2021-05-08 09:43:11] [INFO ] Computed 10 place invariants in 11 ms
[2021-05-08 09:43:11] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 52 rows 57 cols
[2021-05-08 09:43:11] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-08 09:43:11] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 57/76 places, 52/64 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-03a-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s13 1) (NEQ s40 1)), p1:(NEQ s20 1), p2:(OR (NEQ s13 1) (NEQ s40 1)), p3:(NEQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Knowledge obtained : [p0, p1, p2, (NOT p3)]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
[2021-05-08 09:43:12] [INFO ] Flatten gal took : 28 ms
[2021-05-08 09:43:13] [INFO ] Flatten gal took : 18 ms
[2021-05-08 09:43:13] [INFO ] Time to serialize gal into /tmp/LTL765758332152889857.gal : 1 ms
[2021-05-08 09:43:13] [INFO ] Time to serialize properties into /tmp/LTL16934454198235464083.ltl : 2 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/LTL765758332152889857.gal, -t, CGAL, -LTL, /tmp/LTL16934454198235464083.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/LTL765758332152889857.gal -t CGAL -LTL /tmp/LTL16934454198235464083.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((p15!=1)||(p46!=1))")||(("(p23!=1)")&&(X(("(p23!=1)")U((("((p15!=1)||(p46!=1))")||(F("(p3!=0)")))||(G("(p23!=1)"))))))))))
Formula 0 simplified : !XF("((p15!=1)||(p46!=1))" | ("(p23!=1)" & X("(p23!=1)" U ("((p15!=1)||(p46!=1))" | F"(p3!=0)" | G"(p23!=1)"))))
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t8, t10, t12, t14, t22, t34, t37, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/43/9/52
Computing Next relation with stutter on 6 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
14 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,0.174607,20484,1,0,108,17549,131,53,1619,14329,117
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-03a-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-03a-00 finished in 2525 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&(F(p0) U G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 74 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 62
Applied a total of 4 rules in 4 ms. Remains 74 /76 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 74 cols
[2021-05-08 09:43:13] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 09:43:13] [INFO ] Implicit Places using invariants in 78 ms returned [7, 14, 24, 27, 46, 73]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 81 ms to find 6 implicit places.
// Phase 1: matrix 62 rows 68 cols
[2021-05-08 09:43:13] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-08 09:43:13] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Starting structural reductions, iteration 1 : 68/76 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 66 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 66 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 59
Applied a total of 6 rules in 22 ms. Remains 65 /68 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 65 cols
[2021-05-08 09:43:13] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-08 09:43:13] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 59 rows 65 cols
[2021-05-08 09:43:13] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-08 09:43:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 09:43:13] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 65/76 places, 59/64 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s25 1), p1:(AND (EQ s19 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 79 steps with 2 reset in 1 ms.
FORMULA AutoFlight-PT-03a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-01 finished in 483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(X(G(p0)))||(p1&&X((X(F(p2))||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 74 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 62
Applied a total of 4 rules in 2 ms. Remains 74 /76 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 74 cols
[2021-05-08 09:43:13] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 09:43:13] [INFO ] Implicit Places using invariants in 87 ms returned [14, 21, 27, 73]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 88 ms to find 4 implicit places.
// Phase 1: matrix 62 rows 70 cols
[2021-05-08 09:43:13] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:43:13] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 70/76 places, 62/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 70 cols
[2021-05-08 09:43:13] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 09:43:13] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 2 iterations. Remains : 70/76 places, 62/64 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-03a-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (NEQ s22 1) (NEQ s60 1)), p0:(AND (OR (NEQ s22 1) (NEQ s60 1)) (OR (NEQ s7 1) (NEQ s51 1))), p2:(OR (NEQ s43 1) (NEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 5 reset in 0 ms.
FORMULA AutoFlight-PT-03a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-02 finished in 524 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||F(!p1)) U X(X(G((F(p2)||G(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 74 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 62
Applied a total of 4 rules in 3 ms. Remains 74 /76 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 74 cols
[2021-05-08 09:43:14] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 09:43:14] [INFO ] Implicit Places using invariants in 172 ms returned [14, 21, 27, 46, 73]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 177 ms to find 5 implicit places.
// Phase 1: matrix 62 rows 69 cols
[2021-05-08 09:43:14] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-08 09:43:14] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 69/76 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 67 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 67 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 66 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 66 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 65 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 65 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 64 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 64 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 63 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 63 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 55
Applied a total of 14 rules in 17 ms. Remains 62 /69 variables (removed 7) and now considering 55/62 (removed 7) transitions.
// Phase 1: matrix 55 rows 62 cols
[2021-05-08 09:43:14] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-08 09:43:14] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 55 rows 62 cols
[2021-05-08 09:43:14] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-08 09:43:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 09:43:14] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 62/76 places, 55/64 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NEQ s22 1) (NEQ s52 1)), p2:(AND (EQ s7 1) (EQ s43 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-03a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-03 finished in 559 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(((F(p2)&&p1)||p0))||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 63
Applied a total of 2 rules in 2 ms. Remains 75 /76 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 75 cols
[2021-05-08 09:43:14] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 09:43:15] [INFO ] Implicit Places using invariants in 420 ms returned [7, 14, 21, 27, 46]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 429 ms to find 5 implicit places.
// Phase 1: matrix 63 rows 70 cols
[2021-05-08 09:43:15] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-08 09:43:15] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 70/76 places, 63/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 69 transition count 62
Applied a total of 2 rules in 2 ms. Remains 69 /70 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 69 cols
[2021-05-08 09:43:15] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-08 09:43:15] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 62 rows 69 cols
[2021-05-08 09:43:15] [INFO ] Computed 12 place invariants in 18 ms
[2021-05-08 09:43:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 09:43:15] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 69/76 places, 62/64 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : AutoFlight-PT-03a-04 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (EQ s42 0) (EQ s68 0)), p1:(AND (EQ s21 1) (EQ s58 1)), p2:(AND (EQ s42 1) (EQ s68 1)), p3:(EQ s15 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, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 142 ms.
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Knowledge obtained : [p0, (NOT p1), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 33333 reset in 139 ms.
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 313 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Support contains 5 out of 69 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 69/69 places, 62/62 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 69 transition count 62
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 18 place count 69 transition count 64
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 69 transition count 64
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 41 place count 52 transition count 47
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 58 place count 52 transition count 47
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 52 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 51 transition count 46
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 51 transition count 46
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 66 rules in 51 ms. Remains 51 /69 variables (removed 18) and now considering 46/62 (removed 16) transitions.
[2021-05-08 09:43:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 46 rows 51 cols
[2021-05-08 09:43:17] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-08 09:43:17] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/69 places, 46/62 transitions.
Product exploration explored 100000 steps with 33333 reset in 490 ms.
Product exploration explored 100000 steps with 33333 reset in 521 ms.
[2021-05-08 09:43:18] [INFO ] Flatten gal took : 4 ms
[2021-05-08 09:43:18] [INFO ] Flatten gal took : 14 ms
[2021-05-08 09:43:18] [INFO ] Time to serialize gal into /tmp/LTL1968028334566443081.gal : 6 ms
[2021-05-08 09:43:18] [INFO ] Time to serialize properties into /tmp/LTL1438096841303624935.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/LTL1968028334566443081.gal, -t, CGAL, -LTL, /tmp/LTL1438096841303624935.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/LTL1968028334566443081.gal -t CGAL -LTL /tmp/LTL1438096841303624935.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((F(("((p48==0)||(p81==0))")||(("((p24==1)&&(p66==1))")&&(F("((p48==1)&&(p81==1))")))))||(G("(p17==1)"))))))
Formula 0 simplified : !XX(F("((p48==0)||(p81==0))" | ("((p24==1)&&(p66==1))" & F"((p48==1)&&(p81==1))")) | G"(p17==1)")
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t8, t10, t12, t14, t37, t58, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/54/8/62
Computing Next relation with stutter on 6 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
11 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,0.120751,21040,1,0,118,20454,175,64,1981,15629,145
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-03a-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-03a-04 finished in 3527 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 74 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 62
Applied a total of 4 rules in 2 ms. Remains 74 /76 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 74 cols
[2021-05-08 09:43:18] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 09:43:18] [INFO ] Implicit Places using invariants in 112 ms returned [7, 14, 21, 24, 27, 46, 73]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 112 ms to find 7 implicit places.
// Phase 1: matrix 62 rows 67 cols
[2021-05-08 09:43:18] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:43:18] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 67/76 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 57 transition count 52
Applied a total of 20 rules in 7 ms. Remains 57 /67 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 57 cols
[2021-05-08 09:43:18] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:43:18] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 52 rows 57 cols
[2021-05-08 09:43:18] [INFO ] Computed 10 place invariants in 9 ms
[2021-05-08 09:43:18] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 57/76 places, 52/64 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s17 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2766 steps with 101 reset in 4 ms.
FORMULA AutoFlight-PT-03a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-05 finished in 559 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U p1)&&F((p2||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 74 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 62
Applied a total of 4 rules in 2 ms. Remains 74 /76 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 74 cols
[2021-05-08 09:43:18] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-08 09:43:19] [INFO ] Implicit Places using invariants in 438 ms returned [14, 21, 24, 27, 46, 73]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 441 ms to find 6 implicit places.
// Phase 1: matrix 62 rows 68 cols
[2021-05-08 09:43:19] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-08 09:43:19] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 68/76 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 66 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 66 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 63 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 63 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 62 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 62 transition count 56
Applied a total of 12 rules in 4 ms. Remains 62 /68 variables (removed 6) and now considering 56/62 (removed 6) transitions.
// Phase 1: matrix 56 rows 62 cols
[2021-05-08 09:43:19] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-08 09:43:19] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 56 rows 62 cols
[2021-05-08 09:43:19] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-08 09:43:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 09:43:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 62/76 places, 56/64 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-03a-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s32 1), p0:(EQ s35 1), p2:(AND (EQ s7 1) (EQ s43 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-06 finished in 819 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((((G(p1) U p2) U X(!p3))&&p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 74 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 62
Applied a total of 4 rules in 5 ms. Remains 74 /76 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 74 cols
[2021-05-08 09:43:19] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 09:43:19] [INFO ] Implicit Places using invariants in 128 ms returned [7, 14, 21, 24, 73]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 129 ms to find 5 implicit places.
// Phase 1: matrix 62 rows 69 cols
[2021-05-08 09:43:19] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-08 09:43:19] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 69/76 places, 62/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 69 /69 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 69 cols
[2021-05-08 09:43:19] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-08 09:43:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 69/76 places, 62/64 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), true, p3, p3, (OR (AND (NOT p2) p3) (AND (NOT p1) p3)), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-03a-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p2 p3) (AND p1 p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 2}, { cond=(AND p1 p3), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s42 1) (EQ s68 1)), p2:(AND (EQ s6 1) (EQ s57 1)), p1:(AND (EQ s23 1) (EQ s63 1)), p3:(OR (NEQ s42 1) (NEQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-08 finished in 472 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0)) U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 63
Applied a total of 2 rules in 1 ms. Remains 75 /76 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 75 cols
[2021-05-08 09:43:20] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 09:43:20] [INFO ] Implicit Places using invariants in 46 ms returned [14, 21, 24, 27, 46]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 47 ms to find 5 implicit places.
// Phase 1: matrix 63 rows 70 cols
[2021-05-08 09:43:20] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-08 09:43:20] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 70/76 places, 63/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 69 transition count 62
Applied a total of 2 rules in 1 ms. Remains 69 /70 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 69 cols
[2021-05-08 09:43:20] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-08 09:43:20] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 62 rows 69 cols
[2021-05-08 09:43:20] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-08 09:43:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 09:43:20] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 69/76 places, 62/64 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s42 1)), p0:(AND (EQ s62 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-10 finished in 390 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 70 transition count 44
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 43 place count 51 transition count 44
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 43 place count 51 transition count 36
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 62 place count 40 transition count 36
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 62 place count 40 transition count 33
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 37 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 35 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 35 transition count 31
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 30 transition count 26
Applied a total of 82 rules in 10 ms. Remains 30 /76 variables (removed 46) and now considering 26/64 (removed 38) transitions.
// Phase 1: matrix 26 rows 30 cols
[2021-05-08 09:43:20] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 09:43:20] [INFO ] Implicit Places using invariants in 25 ms returned [17, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
[2021-05-08 09:43:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 28 cols
[2021-05-08 09:43:20] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:43:20] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 28/76 places, 26/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 25
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 24
Applied a total of 4 rules in 2 ms. Remains 26 /28 variables (removed 2) and now considering 24/26 (removed 2) transitions.
// Phase 1: matrix 24 rows 26 cols
[2021-05-08 09:43:20] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-08 09:43:20] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 24 rows 26 cols
[2021-05-08 09:43:20] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-08 09:43:20] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 26/76 places, 24/64 transitions.
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-11 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:(EQ s1 0)], 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 286 steps with 23 reset in 1 ms.
FORMULA AutoFlight-PT-03a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-11 finished in 160 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 74 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 62
Applied a total of 4 rules in 1 ms. Remains 74 /76 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 74 cols
[2021-05-08 09:43:20] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 09:43:20] [INFO ] Implicit Places using invariants in 49 ms returned [7, 14, 21, 24, 27, 46, 73]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 59 ms to find 7 implicit places.
// Phase 1: matrix 62 rows 67 cols
[2021-05-08 09:43:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-08 09:43:20] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 67/76 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 57 transition count 52
Applied a total of 20 rules in 9 ms. Remains 57 /67 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 57 cols
[2021-05-08 09:43:20] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:43:20] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 52 rows 57 cols
[2021-05-08 09:43:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-08 09:43:20] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 57/76 places, 52/64 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03a-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s16 0) (NEQ s43 0)), p1:(OR (NEQ s14 1) (NEQ s20 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 117 ms.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 57/57 places, 52/52 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 57 transition count 52
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 13 place count 57 transition count 52
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 57 transition count 52
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 23 place count 49 transition count 44
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 49 transition count 44
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 49 transition count 44
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 45 transition count 40
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 45 transition count 40
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 47 rules in 31 ms. Remains 45 /57 variables (removed 12) and now considering 40/52 (removed 12) transitions.
[2021-05-08 09:43:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 45 cols
[2021-05-08 09:43:21] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:43:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/57 places, 40/52 transitions.
Product exploration explored 100000 steps with 50000 reset in 272 ms.
Product exploration explored 100000 steps with 50000 reset in 275 ms.
[2021-05-08 09:43:22] [INFO ] Flatten gal took : 3 ms
[2021-05-08 09:43:22] [INFO ] Flatten gal took : 3 ms
[2021-05-08 09:43:22] [INFO ] Time to serialize gal into /tmp/LTL4956754637372862953.gal : 1 ms
[2021-05-08 09:43:22] [INFO ] Time to serialize properties into /tmp/LTL5120173152221691075.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/LTL4956754637372862953.gal, -t, CGAL, -LTL, /tmp/LTL5120173152221691075.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/LTL4956754637372862953.gal -t CGAL -LTL /tmp/LTL5120173152221691075.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X("((p16!=1)||(p23!=1))"))||("((p18!=0)&&(p60!=0))"))))
Formula 0 simplified : !F("((p18!=0)&&(p60!=0))" | X"((p16!=1)||(p23!=1))")
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t8, t10, t12, t14, t22, t34, t37, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/43/9/52
Computing Next relation with stutter on 6 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
9 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,0.103556,19540,1,0,108,17549,135,53,1619,14331,119
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-03a-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-03a-12 finished in 1916 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U G(p1)) U p2))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 70 transition count 47
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 38 place count 54 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 53 transition count 46
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 39 place count 53 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 53 place count 45 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 53 place count 45 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 43 transition count 38
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 41 transition count 36
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 41 transition count 36
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 71 place count 36 transition count 31
Applied a total of 71 rules in 5 ms. Remains 36 /76 variables (removed 40) and now considering 31/64 (removed 33) transitions.
// Phase 1: matrix 31 rows 36 cols
[2021-05-08 09:43:22] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-08 09:43:22] [INFO ] Implicit Places using invariants in 27 ms returned [19, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
[2021-05-08 09:43:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 34 cols
[2021-05-08 09:43:22] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:43:22] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 34/76 places, 31/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 33 transition count 30
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 33 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 32 transition count 29
Applied a total of 4 rules in 2 ms. Remains 32 /34 variables (removed 2) and now considering 29/31 (removed 2) transitions.
// Phase 1: matrix 29 rows 32 cols
[2021-05-08 09:43:22] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:43:22] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 29 rows 32 cols
[2021-05-08 09:43:22] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:43:22] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 32/76 places, 29/64 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03a-14 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s13 1) (EQ s25 1)), p1:(NEQ s18 1), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 83 steps with 4 reset in 0 ms.
FORMULA AutoFlight-PT-03a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-14 finished in 338 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))||(F(p0)&&G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 74 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 62
Applied a total of 4 rules in 1 ms. Remains 74 /76 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 74 cols
[2021-05-08 09:43:23] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-08 09:43:23] [INFO ] Implicit Places using invariants in 41 ms returned [7, 14, 21, 24, 27, 46, 73]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 49 ms to find 7 implicit places.
// Phase 1: matrix 62 rows 67 cols
[2021-05-08 09:43:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:43:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 67/76 places, 62/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 57 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 57 transition count 52
Applied a total of 20 rules in 7 ms. Remains 57 /67 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 57 cols
[2021-05-08 09:43:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:43:23] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 52 rows 57 cols
[2021-05-08 09:43:23] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:43:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 57/76 places, 52/64 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s20 1), p1:(OR (NEQ s4 1) (NEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5641 reset in 102 ms.
Product exploration explored 100000 steps with 5517 reset in 183 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5729 reset in 123 ms.
Product exploration explored 100000 steps with 5551 reset in 145 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 57/57 places, 52/52 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 57 transition count 52
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 13 place count 57 transition count 52
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 57 transition count 52
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 23 place count 49 transition count 44
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 49 transition count 44
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 49 transition count 44
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 45 transition count 40
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 45 transition count 40
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 48 rules in 5 ms. Remains 45 /57 variables (removed 12) and now considering 40/52 (removed 12) transitions.
[2021-05-08 09:43:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 40 rows 45 cols
[2021-05-08 09:43:24] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-08 09:43:25] [INFO ] Dead Transitions using invariants and state equation in 507 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/57 places, 40/52 transitions.
Product exploration explored 100000 steps with 8485 reset in 264 ms.
Stack based approach found an accepted trace after 81883 steps with 6945 reset with depth 9 and stack size 8 in 133 ms.
FORMULA AutoFlight-PT-03a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-15 finished in 2412 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620467006547

--------------------
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-03a"
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-03a, 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-162037990000402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-03a.tgz
mv AutoFlight-PT-03a 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 ;