Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838851000868.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is GPPP-PT-C0100N0000010000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838851000868
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 9.1K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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 GPPP-PT-C0100N0000010000-LTLFireability-00
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-01
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-02
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-03
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-04
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-05
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-06
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-07
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-08
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-09
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-10
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-11
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-12
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-13
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-14
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679597914559

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000010000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 18:58:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 18:58:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 18:58:37] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-23 18:58:37] [INFO ] Transformed 33 places.
[2023-03-23 18:58:37] [INFO ] Transformed 22 transitions.
[2023-03-23 18:58:37] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 18:58:37] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-23 18:58:38] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
[2023-03-23 18:58:38] [INFO ] Invariant cache hit.
[2023-03-23 18:58:38] [INFO ] Implicit Places using invariants in 38 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 224 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 25 out of 32 places after structural reductions.
[2023-03-23 18:58:38] [INFO ] Flatten gal took : 16 ms
[2023-03-23 18:58:38] [INFO ] Flatten gal took : 5 ms
[2023-03-23 18:58:38] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10140 steps, including 3 resets, run finished after 360 ms. (steps per millisecond=28 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 18:58:38] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-23 18:58:38] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:58:38] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-23 18:58:38] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:58:39] [INFO ] Invariant cache hit.
[2023-03-23 18:58:39] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-23 18:58:39] [INFO ] Invariant cache hit.
[2023-03-23 18:58:39] [INFO ] Implicit Places using invariants in 39 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-00 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:58:39] [INFO ] Invariant cache hit.
[2023-03-23 18:58:39] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
[2023-03-23 18:58:39] [INFO ] Invariant cache hit.
[2023-03-23 18:58:39] [INFO ] Implicit Places using invariants in 35 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s14 1) (AND (GEQ s16 1) (GEQ s19 1))), p1:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8078 reset in 211 ms.
Product exploration explored 100000 steps with 8148 reset in 151 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 405 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=405 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 22 rows 30 cols
[2023-03-23 18:58:40] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-23 18:58:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 18:58:40] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-23 18:58:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:58:40] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-23 18:58:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:58:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 18:58:40] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-23 18:58:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:58:40] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-23 18:58:40] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 18:58:40] [INFO ] Added : 20 causal constraints over 4 iterations in 35 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:58:40] [INFO ] Invariant cache hit.
[2023-03-23 18:58:41] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-23 18:58:41] [INFO ] Invariant cache hit.
[2023-03-23 18:58:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-23 18:58:41] [INFO ] Invariant cache hit.
[2023-03-23 18:58:41] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 90 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 28/30 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 60 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1307 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=217 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 22 rows 28 cols
[2023-03-23 18:58:41] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-23 18:58:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 18:58:41] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 18:58:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:58:41] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-23 18:58:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:58:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 18:58:41] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 18:58:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:58:42] [INFO ] [Nat]Absence check using state equation in 1106 ms returned sat
[2023-03-23 18:58:42] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 18:58:43] [INFO ] Added : 20 causal constraints over 4 iterations in 93 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8120 reset in 130 ms.
Product exploration explored 100000 steps with 8215 reset in 100 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 22/22 transitions.
Graph (complete) has 60 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 26 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 13 ms. Remains 26 /28 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 26 cols
[2023-03-23 18:58:43] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 18:58:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-23 18:58:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 18:58:43] [INFO ] Invariant cache hit.
[2023-03-23 18:58:44] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/28 places, 20/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 26/28 places, 20/22 transitions.
Built C files in :
/tmp/ltsmin17883707352180536071
[2023-03-23 18:58:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17883707352180536071
Running compilation step : cd /tmp/ltsmin17883707352180536071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 176 ms.
Running link step : cd /tmp/ltsmin17883707352180536071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17883707352180536071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4086097014285595051.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2023-03-23 18:58:59] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-23 18:58:59] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
[2023-03-23 18:58:59] [INFO ] Invariant cache hit.
[2023-03-23 18:58:59] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-23 18:58:59] [INFO ] Invariant cache hit.
[2023-03-23 18:58:59] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-23 18:58:59] [INFO ] Invariant cache hit.
[2023-03-23 18:58:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 28/28 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin5049514174112128606
[2023-03-23 18:58:59] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5049514174112128606
Running compilation step : cd /tmp/ltsmin5049514174112128606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 101 ms.
Running link step : cd /tmp/ltsmin5049514174112128606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5049514174112128606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1884154844572703156.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 18:59:14] [INFO ] Flatten gal took : 4 ms
[2023-03-23 18:59:14] [INFO ] Flatten gal took : 2 ms
[2023-03-23 18:59:14] [INFO ] Time to serialize gal into /tmp/LTL15649836544048305920.gal : 2 ms
[2023-03-23 18:59:14] [INFO ] Time to serialize properties into /tmp/LTL7188497618358372535.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15649836544048305920.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2777238766248201172.hoa' '-atoms' '/tmp/LTL7188497618358372535.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7188497618358372535.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2777238766248201172.hoa
Detected timeout of ITS tools.
[2023-03-23 18:59:29] [INFO ] Flatten gal took : 3 ms
[2023-03-23 18:59:29] [INFO ] Flatten gal took : 2 ms
[2023-03-23 18:59:29] [INFO ] Time to serialize gal into /tmp/LTL1387813013860817963.gal : 1 ms
[2023-03-23 18:59:29] [INFO ] Time to serialize properties into /tmp/LTL14320591330595701048.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1387813013860817963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14320591330595701048.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F("((DHAP>=1)||((ADP>=1)&&(PEP>=1)))"))||(X(F("(DHAP>=1)"))))))
Formula 0 simplified : X(G!"((DHAP>=1)||((ADP>=1)&&(PEP>=1)))" & XG!"(DHAP>=1)")
Detected timeout of ITS tools.
[2023-03-23 18:59:44] [INFO ] Flatten gal took : 3 ms
[2023-03-23 18:59:44] [INFO ] Applying decomposition
[2023-03-23 18:59:44] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13845396944918461010.txt' '-o' '/tmp/graph13845396944918461010.bin' '-w' '/tmp/graph13845396944918461010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13845396944918461010.bin' '-l' '-1' '-v' '-w' '/tmp/graph13845396944918461010.weights' '-q' '0' '-e' '0.001'
[2023-03-23 18:59:44] [INFO ] Decomposing Gal with order
[2023-03-23 18:59:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 18:59:44] [INFO ] Flatten gal took : 30 ms
[2023-03-23 18:59:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-23 18:59:44] [INFO ] Time to serialize gal into /tmp/LTL2935624379407636545.gal : 1 ms
[2023-03-23 18:59:44] [INFO ] Time to serialize properties into /tmp/LTL15170328813879781244.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2935624379407636545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15170328813879781244.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("((i4.u1.DHAP>=1)||((u3.ADP>=1)&&(u2.PEP>=1)))"))||(X(F("(i4.u1.DHAP>=1)"))))))
Formula 0 simplified : X(G!"((i4.u1.DHAP>=1)||((u3.ADP>=1)&&(u2.PEP>=1)))" & XG!"(i4.u1.DHAP>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17852549170665879064
[2023-03-23 18:59:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17852549170665879064
Running compilation step : cd /tmp/ltsmin17852549170665879064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 92 ms.
Running link step : cd /tmp/ltsmin17852549170665879064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin17852549170665879064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-01 finished in 95439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1 U X(!p2)))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:00:14] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-23 19:00:14] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2023-03-23 19:00:14] [INFO ] Invariant cache hit.
[2023-03-23 19:00:14] [INFO ] Implicit Places using invariants in 45 ms returned [1, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1)), p2:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s28 700))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2)))
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-02 finished in 417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 30 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 27 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 25 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 24 transition count 16
Applied a total of 14 rules in 19 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2023-03-23 19:00:15] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-23 19:00:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-23 19:00:15] [INFO ] Invariant cache hit.
[2023-03-23 19:00:15] [INFO ] Implicit Places using invariants in 30 ms returned [1, 2, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 16/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 17 transition count 12
Applied a total of 8 rules in 5 ms. Remains 17 /21 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-23 19:00:15] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-23 19:00:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-23 19:00:15] [INFO ] Invariant cache hit.
[2023-03-23 19:00:15] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 170 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s14 700))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 844 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-03 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:00:15] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-23 19:00:15] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-23 19:00:15] [INFO ] Invariant cache hit.
[2023-03-23 19:00:15] [INFO ] Implicit Places using invariants in 51 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s5 1) (GEQ s25 200))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2877 steps with 0 reset in 6 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-04 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 31 transition count 20
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 3 place count 30 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 26 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
Applied a total of 13 rules in 11 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2023-03-23 19:00:15] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-23 19:00:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-23 19:00:15] [INFO ] Invariant cache hit.
[2023-03-23 19:00:15] [INFO ] Implicit Places using invariants in 34 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/32 places, 16/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 73 ms. Remains : 23/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s16 1)) (AND (GEQ s11 1) (GEQ s13 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1262 steps with 0 reset in 8 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-06 finished in 169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1||F(G(p2)))&&p0))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 27 transition count 17
Applied a total of 9 rules in 8 ms. Remains 27 /32 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 27 cols
[2023-03-23 19:00:15] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-23 19:00:15] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-23 19:00:15] [INFO ] Invariant cache hit.
[2023-03-23 19:00:15] [INFO ] Implicit Places using invariants in 41 ms returned [2, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/32 places, 17/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 25/32 places, 17/22 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1)), p1:(GEQ s5 2), p2:(AND (GEQ s1 1) (GEQ s18 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-07 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0)&&F(!p1))||X(G(!p0))))'
Support contains 8 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:00:16] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-23 19:00:16] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-23 19:00:16] [INFO ] Invariant cache hit.
[2023-03-23 19:00:16] [INFO ] Implicit Places using invariants in 29 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 152 ms :[p0, p0, (AND p1 p0), true, p1]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s1 1) (GEQ s24 1))) (NOT (AND (GEQ s7 1) (GEQ s28 1)))), p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 8 factoid took 131 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-08 finished in 610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 12 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2023-03-23 19:00:16] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-23 19:00:16] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-23 19:00:16] [INFO ] Invariant cache hit.
[2023-03-23 19:00:16] [INFO ] Implicit Places using invariants in 31 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 15/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 21/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-09 finished in 163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 14 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
[2023-03-23 19:00:16] [INFO ] Invariant cache hit.
[2023-03-23 19:00:16] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-23 19:00:16] [INFO ] Invariant cache hit.
[2023-03-23 19:00:16] [INFO ] Implicit Places using invariants in 33 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 15/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 21/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-11 finished in 172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((p1||(p2&&X(F(p2))))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 19:00:17] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-23 19:00:17] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-23 19:00:17] [INFO ] Invariant cache hit.
[2023-03-23 19:00:17] [INFO ] Implicit Places using invariants in 31 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LT s9 1), p2:(LT s17 1), p0:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p2)))
Knowledge based reduction with 13 factoid took 220 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-12 finished in 676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!p0))||G(p1))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 19:00:17] [INFO ] Invariant cache hit.
[2023-03-23 19:00:17] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-23 19:00:17] [INFO ] Invariant cache hit.
[2023-03-23 19:00:17] [INFO ] Implicit Places using invariants in 36 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 163 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s20 1), p1:(AND (GEQ s6 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 55 ms.
Product exploration explored 100000 steps with 33333 reset in 81 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000010000-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-13 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Found a Shortening insensitive property : GPPP-PT-C0100N0000010000-LTLFireability-01
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 32 transition count 21
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 28 transition count 19
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 26 transition count 18
Applied a total of 10 rules in 7 ms. Remains 26 /32 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 26 cols
[2023-03-23 19:00:18] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-23 19:00:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-23 19:00:18] [INFO ] Invariant cache hit.
[2023-03-23 19:00:18] [INFO ] Implicit Places using invariants in 27 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/32 places, 18/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 66 ms. Remains : 24/32 places, 18/22 transitions.
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s10 1) (AND (GEQ s12 1) (GEQ s14 1))), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9134 reset in 78 ms.
Product exploration explored 100000 steps with 9142 reset in 89 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 405 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=405 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 24 cols
[2023-03-23 19:00:19] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 19:00:19] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 19:00:19] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 19:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:00:19] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 19:00:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:00:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 19:00:19] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 19:00:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:00:20] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2023-03-23 19:00:20] [INFO ] Computed and/alt/rep : 17/42/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 19:00:20] [INFO ] Added : 16 causal constraints over 4 iterations in 49 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-23 19:00:20] [INFO ] Invariant cache hit.
[2023-03-23 19:00:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-23 19:00:20] [INFO ] Invariant cache hit.
[2023-03-23 19:00:20] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-23 19:00:20] [INFO ] Invariant cache hit.
[2023-03-23 19:00:20] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-23 19:00:20] [INFO ] Invariant cache hit.
[2023-03-23 19:00:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 24/24 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 707 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=353 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-23 19:00:21] [INFO ] Invariant cache hit.
[2023-03-23 19:00:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 19:00:21] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 19:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:00:21] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-23 19:00:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:00:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 19:00:21] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 19:00:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:00:21] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2023-03-23 19:00:21] [INFO ] Computed and/alt/rep : 17/42/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 19:00:21] [INFO ] Added : 16 causal constraints over 4 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9071 reset in 92 ms.
Product exploration explored 100000 steps with 9079 reset in 87 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-23 19:00:21] [INFO ] Invariant cache hit.
[2023-03-23 19:00:21] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-23 19:00:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 19:00:22] [INFO ] Invariant cache hit.
[2023-03-23 19:00:22] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 24/24 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin5700404817828255718
[2023-03-23 19:00:22] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5700404817828255718
Running compilation step : cd /tmp/ltsmin5700404817828255718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 84 ms.
Running link step : cd /tmp/ltsmin5700404817828255718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5700404817828255718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8152227169564017278.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-23 19:00:37] [INFO ] Invariant cache hit.
[2023-03-23 19:00:37] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-23 19:00:37] [INFO ] Invariant cache hit.
[2023-03-23 19:00:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-23 19:00:37] [INFO ] Invariant cache hit.
[2023-03-23 19:00:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-23 19:00:37] [INFO ] Invariant cache hit.
[2023-03-23 19:00:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 24/24 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin13092339291498797443
[2023-03-23 19:00:37] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13092339291498797443
Running compilation step : cd /tmp/ltsmin13092339291498797443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin13092339291498797443;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13092339291498797443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8814163518285699381.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 19:00:52] [INFO ] Flatten gal took : 9 ms
[2023-03-23 19:00:52] [INFO ] Flatten gal took : 3 ms
[2023-03-23 19:00:52] [INFO ] Time to serialize gal into /tmp/LTL490038778124550127.gal : 4 ms
[2023-03-23 19:00:52] [INFO ] Time to serialize properties into /tmp/LTL18302995410064956046.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL490038778124550127.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13965065483295890951.hoa' '-atoms' '/tmp/LTL18302995410064956046.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18302995410064956046.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13965065483295890951.hoa
Detected timeout of ITS tools.
[2023-03-23 19:01:07] [INFO ] Flatten gal took : 1 ms
[2023-03-23 19:01:07] [INFO ] Flatten gal took : 5 ms
[2023-03-23 19:01:07] [INFO ] Time to serialize gal into /tmp/LTL6227053560780409725.gal : 0 ms
[2023-03-23 19:01:07] [INFO ] Time to serialize properties into /tmp/LTL12679544334286423342.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6227053560780409725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12679544334286423342.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F("((DHAP>=1)||((ADP>=1)&&(PEP>=1)))"))||(X(F("(DHAP>=1)"))))))
Formula 0 simplified : X(G!"((DHAP>=1)||((ADP>=1)&&(PEP>=1)))" & XG!"(DHAP>=1)")
Detected timeout of ITS tools.
[2023-03-23 19:01:22] [INFO ] Flatten gal took : 5 ms
[2023-03-23 19:01:22] [INFO ] Applying decomposition
[2023-03-23 19:01:22] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12071992724236983012.txt' '-o' '/tmp/graph12071992724236983012.bin' '-w' '/tmp/graph12071992724236983012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12071992724236983012.bin' '-l' '-1' '-v' '-w' '/tmp/graph12071992724236983012.weights' '-q' '0' '-e' '0.001'
[2023-03-23 19:01:22] [INFO ] Decomposing Gal with order
[2023-03-23 19:01:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 19:01:22] [INFO ] Flatten gal took : 2 ms
[2023-03-23 19:01:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-23 19:01:22] [INFO ] Time to serialize gal into /tmp/LTL7985211909026298844.gal : 1 ms
[2023-03-23 19:01:22] [INFO ] Time to serialize properties into /tmp/LTL16201249198632439895.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7985211909026298844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16201249198632439895.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("((i3.u0.DHAP>=1)||((i0.u2.ADP>=1)&&(i0.u1.PEP>=1)))"))||(X(F("(i3.u0.DHAP>=1)"))))))
Formula 0 simplified : X(G!"((i3.u0.DHAP>=1)||((i0.u2.ADP>=1)&&(i0.u1.PEP>=1)))" & XG!"(i3.u0.DHAP>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2756829937110940015
[2023-03-23 19:01:37] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2756829937110940015
Running compilation step : cd /tmp/ltsmin2756829937110940015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin2756829937110940015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin2756829937110940015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000010000-LTLFireability-01 finished in 94448 ms.
[2023-03-23 19:01:52] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17090092255779387757
[2023-03-23 19:01:52] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2023-03-23 19:01:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 19:01:52] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2023-03-23 19:01:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 19:01:52] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2023-03-23 19:01:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 19:01:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17090092255779387757
Running compilation step : cd /tmp/ltsmin17090092255779387757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-23 19:01:52] [INFO ] Applying decomposition
[2023-03-23 19:01:52] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph606085102748091646.txt' '-o' '/tmp/graph606085102748091646.bin' '-w' '/tmp/graph606085102748091646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph606085102748091646.bin' '-l' '-1' '-v' '-w' '/tmp/graph606085102748091646.weights' '-q' '0' '-e' '0.001'
[2023-03-23 19:01:52] [INFO ] Decomposing Gal with order
[2023-03-23 19:01:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 19:01:52] [INFO ] Removed a total of 2 redundant transitions.
[2023-03-23 19:01:52] [INFO ] Flatten gal took : 4 ms
[2023-03-23 19:01:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-23 19:01:52] [INFO ] Time to serialize gal into /tmp/LTLFireability14074608640958779174.gal : 0 ms
[2023-03-23 19:01:52] [INFO ] Time to serialize properties into /tmp/LTLFireability67662340163889136.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14074608640958779174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability67662340163889136.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F("((i1.u2.DHAP>=1)||((i2.u3.ADP>=1)&&(u4.PEP>=1)))"))||(X(F("(i1.u2.DHAP>=1)"))))))
Formula 0 simplified : X(G!"((i1.u2.DHAP>=1)||((i2.u3.ADP>=1)&&(u4.PEP>=1)))" & XG!"(i1.u2.DHAP>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-23 19:01:52] [INFO ] Flatten gal took : 1 ms
[2023-03-23 19:01:52] [INFO ] Time to serialize gal into /tmp/LTLFireability12233535442874281528.gal : 4 ms
[2023-03-23 19:01:52] [INFO ] Time to serialize properties into /tmp/LTLFireability10274269145938303090.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12233535442874281528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10274269145938303090.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
Compilation finished in 119 ms.
Running link step : cd /tmp/ltsmin17090092255779387757;'gcc' '-shared' '-o' 'gal.so' 'model.o'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X((F("((DHAP>=1)||((ADP>=1)&&(PEP>=1)))"))||(X(F("(DHAP>=1)"))))))
Formula 0 simplified : X(G!"((DHAP>=1)||((ADP>=1)&&(PEP>=1)))" & XG!"(DHAP>=1)")
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17090092255779387757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-23 19:01:52] [INFO ] Flatten gal took : 2 ms
[2023-03-23 19:01:52] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-23 19:01:52] [INFO ] Transformed 32 places.
[2023-03-23 19:01:52] [INFO ] Transformed 22 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 19:01:52] [INFO ] Time to serialize gal into /tmp/LTLFireability1086722577282471744.gal : 1 ms
[2023-03-23 19:01:52] [INFO ] Time to serialize properties into /tmp/LTLFireability1430556512849439961.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1086722577282471744.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1430556512849439961.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F("((DHAP>=1)||((ADP>=1)&&(PEP>=1)))"))||(X(F("(DHAP>=1)"))))))
Formula 0 simplified : X(G!"((DHAP>=1)||((ADP>=1)&&(PEP>=1)))" & XG!"(DHAP>=1)")
ITS-tools command line returned an error code 134
terminate called after throwing an instance of 'char const*'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: LTL layer: formula: X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 5/ 8), 0.008: "X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.051: DFS-FIFO for weak LTL, using special progress label 25
pins2lts-mc-linux64( 0/ 8), 0.051: There are 26 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.051: State length is 33, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.052: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.052: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.052: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.052: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 4.618: ~100 levels ~960 states ~5136 transitions
pins2lts-mc-linux64( 3/ 8), 4.681: ~181 levels ~1920 states ~9608 transitions
pins2lts-mc-linux64( 3/ 8), 4.772: ~354 levels ~3840 states ~18800 transitions
pins2lts-mc-linux64( 3/ 8), 4.968: ~690 levels ~7680 states ~36768 transitions
pins2lts-mc-linux64( 3/ 8), 5.328: ~1406 levels ~15360 states ~76880 transitions
pins2lts-mc-linux64( 3/ 8), 6.666: ~2676 levels ~30720 states ~131104 transitions
pins2lts-mc-linux64( 3/ 8), 6.827: ~2806 levels ~61440 states ~172176 transitions
pins2lts-mc-linux64( 3/ 8), 7.087: ~2806 levels ~122880 states ~252344 transitions
pins2lts-mc-linux64( 3/ 8), 7.502: ~2806 levels ~245760 states ~414008 transitions
pins2lts-mc-linux64( 3/ 8), 8.396: ~2806 levels ~491520 states ~740488 transitions
pins2lts-mc-linux64( 3/ 8), 9.676: ~2806 levels ~983040 states ~1391984 transitions
pins2lts-mc-linux64( 3/ 8), 11.627: ~2806 levels ~1966080 states ~2785728 transitions
pins2lts-mc-linux64( 3/ 8), 16.170: ~2806 levels ~3932160 states ~6051800 transitions
pins2lts-mc-linux64( 3/ 8), 19.571: ~2806 levels ~7864320 states ~12582008 transitions
pins2lts-mc-linux64( 3/ 8), 25.007: ~2806 levels ~15728640 states ~25645480 transitions
pins2lts-mc-linux64( 3/ 8), 37.853: ~2806 levels ~31457280 states ~51953928 transitions
pins2lts-mc-linux64( 3/ 8), 66.427: ~2806 levels ~62914560 states ~113948904 transitions
pins2lts-mc-linux64( 3/ 8), 117.817: ~2806 levels ~125829120 states ~236927560 transitions
pins2lts-mc-linux64( 3/ 8), 221.673: ~2806 levels ~251658240 states ~482510808 transitions
pins2lts-mc-linux64( 3/ 8), 372.200: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 372.216:
pins2lts-mc-linux64( 0/ 8), 372.216: mean standard work distribution: 264.6% (states) 264.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 372.216:
pins2lts-mc-linux64( 0/ 8), 372.216: Explored 49499343 states 95903877 transitions, fanout: 1.937
pins2lts-mc-linux64( 0/ 8), 372.216: Total exploration time 372.160 sec (372.090 sec minimum, 372.112 sec on average)
pins2lts-mc-linux64( 0/ 8), 372.216: States per second: 133006, Transitions per second: 257695
pins2lts-mc-linux64( 0/ 8), 372.216:
pins2lts-mc-linux64( 0/ 8), 372.216: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 372.216: Redundant explorations: -0.0246
pins2lts-mc-linux64( 0/ 8), 372.216:
pins2lts-mc-linux64( 0/ 8), 372.216: Queue width: 8B, total height: 2815, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 372.216: Tree memory: 633.7MB, 13.4 B/state, compr.: 10.0%
pins2lts-mc-linux64( 0/ 8), 372.216: Tree fill ratio (roots/leafs): 36.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 372.216: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 372.216: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 372.216: Est. total memory use: 633.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17090092255779387757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17090092255779387757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Total runtime 567551 ms.

BK_STOP 1679598486024

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000010000"
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-5348"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0100N0000010000, 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 r165-tall-167838851000868"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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